NSF PAR Search | NSF Public Access Repository

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.

Charmed roots and the Kroweras complement

https://doi.org/10.1112/jlms.70025

Dequêne, Benjamin; Frieden, Gabriel; Iraci, Alessandro; Schreier‐Aigner, Florian; Thomas, Hugh; Williams, Nathan (November 2024, Journal of the London Mathematical Society)

Abstract Although both noncrossing partitions and nonnesting partitions are uniformly enumerated for Weyl groups, the exact relationship between these two sets of combinatorial objects remains frustratingly mysterious. In this paper, we give a precise combinatorial answer in the case of the symmetric group: for any standard Coxeter element, we construct an equivariant bijection between noncrossing partitions under theKreweras complementand nonnesting partitions under a Coxeter‐theoretically natural cyclic action we call theKroweras complement. Our equivariant bijection is the unique bijection that is both equivariant and support‐preserving, and is built using local rules depending on a new definition ofcharmed roots. Charmed roots are determined by the choice of Coxeter element — in the special case of the linear Coxeter element , we recover one of the standard bijections between noncrossing and nonnesting partitions.

Free, publicly-accessible full text available November 1, 2025

Abstract Generalized associahedra are a well‐studied family of polytopes associated with a finite‐type cluster algebra and a choice of starting cluster. We show that the generalized associahedra constructed by Padrol, Palu, Pilaud, and Plamondon, building on ideas from Arkani‐Hamed, Bai, He, and Yan, can be naturally viewed as moment polytopes for an open patch of the quotient of the cluster ‐variety with universal coefficients by its maximal natural torus action. We prove our result by showing that the construction of Padrol, Palu, Pilaud, and Plamondon can be understood on the basis of the way that moment polytopes behave under symplectic reduction.

We define an action of words in

[m]^{n}

R^{m}

to give a new characterization of rational parking functions—they are exactly those words whose action has a fixed point. We use this viewpoint to give a simple definition of Gorsky, Mazin, and Vazirani’s zeta map on rational parking functions when

m

and

n

are coprime [Trans. Amer. Math. Soc. 368 (2016), pp. 8403–8445], and prove that this zeta map is invertible. A specialization recovers Loehr and Warrington’s sweep map on rational Dyck paths (see D. Armstrong, N. A. Loehr, and G. S. Warrington [Adv. Math. 284 (2015), pp. 159–185; E. Gorsky, M. Mazin, and M. Vazirani [Electron. J. Combin. 24 (2017), p. 29; H. Thomas and N. Williams, Selecta Math. (N.S.) 24 (2018), pp. 2003–2034]).

Search for: All records