More Like this

1. Ehrhart theory of paving and panhandle matroids

   https://doi.org/10.1515/advgeom-2023-0020  

   Hanely, Derek; Martin, Jeremy L.; McGinnis, Daniel; Miyata, Dane; Nasr, George D.; Vindas-Meléndez, Andrés R.; Yin, Mei (October 2023, Advances in Geometry)

   Abstract We show that the base polytopeP_Mof any paving matroidMcan be systematically obtained from a hypersimplex by slicing off certain subpolytopes, namely base polytopes of lattice path matroids corresponding to panhandle-shaped Ferrers diagrams. We calculate the Ehrhart polynomials of these matroids and consequently write down the Ehrhart polynomial ofP_M, starting with Katzman’s formula for the Ehrhart polynomial of a hypersimplex. The method builds on and generalizes Ferroni’s work on sparse paving matroids. Combinatorially, our construction corresponds to constructing a uniform matroid from a paving matroid by iterating the operation ofstressed-hyperplane relaxationintroduced by Ferroni, Nasr and Vecchi, which generalizes the standard matroid-theoretic notion of circuit-hyperplane relaxation. We present evidence that panhandle matroids are Ehrhart positive and describe a conjectured combinatorial formula involving chain forests and Eulerian numbers from which Ehrhart positivity of panhandle matroids will follow. As an application of the main result, we calculate the Ehrhart polynomials of matroids associated with Steiner systems and finite projective planes, and show that they depend only on their design-theoretic parameters: for example, while projective planes of the same order need not have isomorphic matroids, their base polytopes must be Ehrhart equivalent. 

   more » « less
2. Cataland: Why the Fuß?

   https://doi.org/10.1090/memo/1535  

   Stump, Christian; Thomas, Hugh; Williams, Nathan (January 2025, Memoirs of the American Mathematical Society)

   The three main objects in noncrossing Catalan combinatorics associated to a finite Coxeter system are noncrossing partitions, clusters, and sortable elements. The first two of these have known Fuß-Catalan generalizations. We provide new viewpoints for both and introduce the missing generalization of sortable elements by lifting the theory from the Coxeter system to the associated positive Artin monoid. We show how this new perspective ties together all three generalizations, providing a uniform framework for noncrossing Fuß-Catalan combinatorics. Having developed the combinatorial theory, we provide an interpretation of our generalizations in the language of the representation theory of hereditary Artin algebras. 

   more » « less
3. Rational noncrossing Coxeter–Catalan combinatorics

   https://doi.org/10.1112/plms.12643  

   Galashin, Pavel; Lam, Thomas; Trinh, Minh‐Tâm; Williams, Nathan (October 2024, Proceedings of the London Mathematical Society)

   Abstract We solve two open problems in Coxeter–Catalan combinatorics. First, we introduce a family of rational noncrossing objects for any finite Coxeter group, using the combinatorics of distinguished subwords. Second, we give a type‐uniform proof that these noncrossing Catalan objects are counted by the rational Coxeter–Catalan number, using the character theory of the associated Hecke algebra and the properties of Lusztig's exotic Fourier transform. We solve the same problems for rational noncrossing parking objects. 

   more » « less
4. Convex cocompactness for Coxeter groups

   https://doi.org/10.4171/jems/1539  

   Danciger, Jeffrey; Guéritaud, François; Kassel, Fanny; Lee, Gye-Seon; Marquis, Ludovic (February 2025, Journal of the European Mathematical Society)

   We investigate representations of Coxeter groups into\mathrm{GL}(n,\mathbb{R})as geometric reflection groups which are convex cocompact in the projective space\mathbb{P}(\mathbb{R}^{n}). We characterize which Coxeter groups admit such representations, and we fully describe the corresponding spaces of convex cocompact representations as reflection groups, in terms of the associated Cartan matrices. The Coxeter groups that appear include all infinite word hyperbolic Coxeter groups; for such groups, the representations as reflection groups that we describe are exactly the projective Anosov ones. We also obtain a large class of nonhyperbolic Coxeter groups, thus providing many examples for the theory of nonhyperbolic convex cocompact subgroups in\mathbb{P}(\mathbb{R}^{n})developed by Danciger–Guéritaud–Kassel (2024). 

   more » « less
5. A Type B Analogue of the Category of Finite Sets with Surjections

   https://doi.org/10.37236/11186  

   Proudfoot, Nicholas (July 2022, The Electronic Journal of Combinatorics)

   We define a type B analogue of the category of finite sets with surjections, and we study the representation theory of this category. We show that the opposite category is quasi-Gröbner, which implies that submodules of finitely generated modules are again finitely generated. We prove that the generating functions of finitely generated modules have certain prescribed poles, and we obtain restrictions on the representations of type B Coxeter groups that can appear in such modules. Our main example is a module that categorifies the degree i Kazhdan–Lusztig coefficients of type B Coxeter arrangements. 

   more » « less