Cambrian acyclic domains: counting c-singletons
From MaRDI portal
Publication:2006983
enumerationCoxeter groupspseudoline arrangementssortable elementsgeneralized permutahedraacyclic sets
Exact enumeration problems, generating functions (05A15) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Reflection and Coxeter groups (group-theoretic aspects) (20F55) Continuous lattices and posets, applications (06B35) Planar arrangements of lines and pseudolines (aspects of discrete geometry) (52C30)
Abstract: We study the size of certain acyclic domains that arise from geometric and combinatorial constructions. These acyclic domains consist of all permutations visited by commuting equivalence classes of maximal reduced decompositions if we consider the symmetric group and, more generally, of all c-singletons of a Cambrian lattice associated to the weak order of a finite Coxeter group. For this reason, we call these sets Cambrian acyclic domains. Extending a closed formula of Galambos--Reiner for a particular acyclic domain called Fishburn's alternating scheme, we provide explicit formulae for the size of any Cambrian acyclic domain and characterize the Cambrian acyclic domains of minimum or maximum size.
Recommendations
Cites work
- scientific article; zbMATH DE number 6016068 (Why is no real title available?)
- scientific article; zbMATH DE number 4147800 (Why is no real title available?)
- scientific article; zbMATH DE number 4002104 (Why is no real title available?)
- scientific article; zbMATH DE number 16339 (Why is no real title available?)
- scientific article; zbMATH DE number 53657 (Why is no real title available?)
- scientific article; zbMATH DE number 575960 (Why is no real title available?)
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- scientific article; zbMATH DE number 872231 (Why is no real title available?)
- A realization of graph associahedra
- Acyclic sets of linear orders
- Acyclic sets of linear orders via the Bruhat orders
- Acyclic sets of linear orders: a progress report
- Associahedra via spines
- Associahedra, Tamari lattices and related structures. Tamari memorial Festschrift
- Axioms and hulls
- Brick polytopes of spherical subword complexes and generalized associahedra
- Cambrian lattices.
- Cluster algebras, quiver representations and triangulated categories
- Clusters, Coxeter-sortable elements and noncrossing partitions
- Coding and counting arrangements of pseudolines
- Condorcet domains of tiling type
- Constructions and complexity of secondary polytopes
- Enumeration of basic ideals in type B Lie algebras
- Faces of generalized permutohedra
- Higher Bruhat orders and cyclic hyperplane arrangements
- Homotopy Associativity of H-Spaces. I
- Isometry classes of generalized associahedra
- Lectures on Polytopes
- Monoïdes préordonnés et chaînes de Malcev
- Multitriangulations, pseudotriangulations and primitive sorting networks
- On the fully commutative elements of Coxeter groups
- Permutahedra and associahedra: generalized associahedra from the geometry of finite reflection groups
- Permutahedra and generalized associahedra.
- Permutohedra, Associahedra, and Beyond
- Polytopal realizations of finite type \(\mathbf{g}\)-vector fans
- Realization of the Stasheff polytope
- Realizations of the associahedron and cyclohedron
- Subword complexes, cluster complexes, and generalized multi-associahedra
- The Weak Bruhat Order of $\text{S}_\Sigma $, Consistent Sets, and Catalan Numbers
- The associahedron and triangulations of the \(n\)-gon
- The brick polytope of a sorting network
- The enumeration of Coxeter elements
- \(Y\)-systems and generalized associahedra
Cited in
(3)
This page was built for publication: Cambrian acyclic domains: counting \(c\)-singletons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2006983)
