1.8k citations
- Thomas Jefferson National Accelerator FacilityUS402 papers
- University of GlasgowGB304 papers
- William & MaryUS287 papers
- Commissariat à l'Énergie Atomique et aux Énergies AlternativesFR272 papers
- Centre National de la Recherche ScientifiqueFR271 papers
- University of VirginiaUS271 papers
- A. Alikhanyan National LaboratoryAM264 papers
- Old Dominion UniversityUS262 papers
- Florida International UniversityUS261 papers
- Catholic University of AmericaUS260 papers
- Ohio UniversityUS253 papers
- Carnegie Mellon UniversityUS235 papers
7 papers · 2 filters
Coincidences between intervals in two partial orders on complex reflection groups
Joel Brewster Lewis, Jiayuan Wang
In a finite real reflection group, the reflection length of each element is equal to the codimension of its fixed space, and the two coincident functions determine a partial order…
Hurwitz numbers for reflection groups III: Uniform formulas
Theo Douvropoulos, Joel Brewster Lewis, Alejandro H. Morales
We give uniform formulas for the number of full reflection factorizations of a parabolic quasi-Coxeter element in a Weyl group or complex reflection group, generalizing the formula…
Connectivity gaps among matroids with the same enumerative invariants
Joseph E. Bonin, Kevin Long
Many important enumerative invariants of a matroid can be obtained from its Tutte polynomial, and many more are determined by two stronger invariants, the -invariant a…
A characterization of positroids, with applications to amalgams and excluded minors
Joseph E. Bonin
A matroid of rank on elements is a positroid if it has a representation by an by matrix over , each by submatrix of which has nonnegative determ…
Enumeration of Payphone Permutations
Max A. Alekseyev
The desire for privacy significantly impacts various aspects of social behavior as illustrated by people's tendency to seek out the most secluded spot when multiple options are ava…
Maximizing the number of integer pairs summing to powers of 2 via graph labeling and solving restricted systems of linear (in)equations
Max A. Alekseyev
We address the problem of finding sets of integers of a given size with a maximum number of pairs summing to powers of . By fixing particular pairs, this problem reduces to find…