skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Attention:

The DOI auto-population feature in the Public Access Repository (PAR) will be unavailable from 4:00 PM ET on Tuesday, July 8 until 4:00 PM ET on Wednesday, July 9 due to scheduled maintenance. We apologize for the inconvenience caused.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


Title: Factorization problems in complex reflection groups
We enumerate factorizations of a Coxeter element in a well-generated complex reflection group into arbitrary factors, keeping track of the fixed space dimension of each factor. In the infinite families of generalized permutations, our approach is fully combinatorial. It gives results analogous to those of Jackson in the symmetric group and can be refined to encode a notion of cycle type. As one application of our results, we give a previously overlooked characterization of the poset of 2W-noncrossing partitions.  more » « less
Award ID(s):
1855536
PAR ID:
10226577
Author(s) / Creator(s):
;
Date Published:
Journal Name:
Canadian Journal of Mathematics
ISSN:
0008-414X
Page Range / eLocation ID:
1 to 48
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ; ; ; ; (, Proceedings of the ACM on Interactive, Mobile, Wearable and Ubiquitous Technologies)
    null (Ed.)
    In this paper, we present GEVR, the first Group Event Venue Recommendation system that incorporates mobility via individual location traces and context information into a "social-based" group decision model to provide venue recommendations for groups of mobile users. Our study leverages a real-world dataset collected using the OutWithFriendz mobile app for group event planning, which contains 625 users and over 500 group events. We first develop a novel "social-based" group location prediction model, which adaptively applies different group decision strategies to groups with different social relationship strength to aggregate each group member's location preference, to predict where groups will meet. Evaluation results show that our prediction model not only outperforms commonly used and state-of-the-art group decision strategies with over 80% accuracy for predicting groups' final meeting location clusters, but also provides promising qualities in cold-start scenarios. We then integrate our prediction model with the Foursquare Venue Recommendation API to construct an event venue recommendation framework for groups of mobile users. Evaluation results show that GEVR outperforms the comparative models by a significant margin. 
    more » « less
  2. ; (, Leibniz international proceedings in informatics)
    In network tomography, one goal is to identify a small set of failed links in a network using as little information as possible. One way of setting up this problem is called graph-constrained group testing. Graph-constrained group testing is a variant of the classical combinatorial group testing problem, where the tests that one is allowed are additionally constrained by a graph. In this case, the graph is given by the underlying network topology. The main contribution of this work is to show that for most graphs, the constraints imposed by the graph are no constraint at all. That is, the number of tests required to identify the failed links in graph-constrained group testing is near-optimal even for the corresponding group testing problem with no graph constraints. Our approach is based on a simple randomized construction of tests. To analyze our construction, we prove new results about the size of giant components in randomly sparsified graphs. Finally, we provide empirical results which suggest that our connected-subgraph tests perform better not just in theory but also in practice, and in particular perform better on a real-world network topology. 
    more » « less
  3. (, Proceedings of the 23rd Annual Conference on Research in Undergraduate Mathematics Education)
    Karunakaran, S. S. (Ed.)
    This paper reports a qualitative study of how small group problem solving was enacted differently across sections of a multi-section undergraduate introduction to proof course. Common course materials, common guidelines for instruction, and weekly instructor meetings led by a faculty course coordinator supported similar instruction across sections, including an emphasis on in-class group work. But within that shared structure, classroom observations revealed important differences in how group work was introduced, organized, and managed. Our results focus on differences in the time allotted to group work, the rationale for group work, the selection and organization of groups, and aspects of student activity and participation. We suggest that these differences shaped different opportunities to learn proof writing in small groups. These results have implications for the design and teaching of collegiate mathematics courses where group work is a regular element of classroom work. 
    more » « less
  4. ; ; ; ; (, International Foundation for Autonomous Agents and Multiagent Systems)
    We study the group-fair multi-period mobile facility location problems, where agents from different groups are located on a real line and arrive in different periods. Our goal is to locate k mobile facilities at each period to serve the arriving agents in order to minimize the maximum total group-fair cost and the maximum average group-fair cost objectives that measure the costs or distances of groups of agents to their corresponding facilities across all periods. We first consider the problems from the algorithmic perspective for both group-fair cost objectives. We then consider the problems from the mechanism design perspective, where the agents' locations and arrival periods are private. For both objectives, we design deterministic strategyproof mechanisms to elicit the agents' locations and arrival periods truthfully while optimizing the group-fair cost objectives and show that our mechanisms have almost tight bounds on the approximation ratios for certain periods and settings. Finally, we discuss the extensions of our results to the online setting where agent arrival information is only known at each period. 
    more » « less
  5. ; ; ; ; ; ; ; (, Scientific Reports)
    Abstract Global warming is causing rapid changes to the cryosphere. Predicting the future trajectory of the cryosphere requires quantitative reconstruction of its past variations. A recently identified sea-ice-associated haptophyte, known as Group 2i Isochrysidales, has given rise to a new sea-ice proxy with its characteristic alkenone distributions. However, apart from the occurrence of Group 2i Isochrysidales in regions with sea ice, and the empirical relationship between C37:4alkenone abundance and sea-ice concentration, little is known about the ecology of these haptophyte species. Here, we systematically mapped the spatial and temporal occurrence of known Group 2i Isochrysidales based on environmental DNA in both marine and lacustrine environments. Our results indicate Group 2i is widely distributed in icy marine and lacustrine environments in both Northern and Southern Hemisphere, but is absent in warm environments. Temporally, Group 2i is part of the sea-ice algae bloom during the cold seasons, in contrast to other Isochrysidales that bloom in open waters during warm seasons. Our results indicate that ice is a prerequisite for the occurrence of the psychrophilic Group 2i haptophytes in marine and lacustrine ecosystems and further affirms its value for past ice reconstructions. 
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email