Rational Noncrossing Coxeter-Catalan Combinatorics
From MaRDI portal
Publication:6406515
arXiv2208.00121MaRDI QIDQ6406515FDOQ6406515
Authors: Pavel Galashin, Thomas Lam, Minh-Tam Trinh, Nathan Williams 
Publication date: 29 July 2022
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.
Has companion code repository: https://github.com/nathanfwilliams/rational-noncrossing-catalan-combinatorics
Exact enumeration problems, generating functions (05A15) Symmetric functions and generalizations (05E05) Combinatorial aspects of representation theory (05E10) Hecke algebras and their representations (20C08)
This page was built for publication: Rational Noncrossing Coxeter-Catalan Combinatorics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6406515)
