Cambrian acyclic domains: counting c-singletons

DOI10.1007/S11083-019-09520-4zbMATH Open1484.06028arXiv1802.07978OpenAlexW3006248919MaRDI QIDQ2006983FDOQ2006983

Jean-Philippe Labbé, Carsten E. M. C. Lange

Publication date: 12 October 2020

Published in: Order (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1802.07978

zbMATH Keywords

enumerationCoxeter groupspseudoline arrangementssortable elementsgeneralized permutahedraacyclic sets

Mathematics Subject Classification ID

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Lectures on Polytopes
• \(Y\)-systems and generalized associahedra
• Cambrian lattices.
• Cluster algebras, quiver representations and triangulated categories
• Clusters, Coxeter-sortable elements and noncrossing partitions
• Permutohedra, Associahedra, and Beyond
• Homotopy Associativity of H-Spaces. I
• Faces of generalized permutohedra
• A realization of graph associahedra
• Brick polytopes of spherical subword complexes and generalized associahedra
• Subword complexes, cluster complexes, and generalized multi-associahedra
• The brick polytope of a sorting network
• Multitriangulations, pseudotriangulations and primitive sorting networks
• Permutahedra and generalized associahedra.
• Associahedra, Tamari lattices and related structures. Tamari memorial Festschrift
• On the fully commutative elements of Coxeter groups
• The associahedron and triangulations of the \(n\)-gon
• Realizations of the associahedron and cyclohedron
• Higher Bruhat orders and cyclic hyperplane arrangements
• Constructions and complexity of secondary polytopes
• Permutahedra and Associahedra
• Axioms and hulls
• Coding and counting arrangements of pseudolines
• Realization of the Stasheff polytope
• Isometry classes of generalized associahedra
• Acyclic sets of linear orders
• Acyclic sets of linear orders via the Bruhat orders
• Condorcet domains of tiling type
• The Weak Bruhat Order of $\text{S}_\Sigma $, Consistent Sets, and Catalan Numbers
• Acyclic sets of linear orders: a progress report
• The enumeration of Coxeter elements
• Monoïdes préordonnés et chaînes de Malcev
• Associahedra via spines
• Polytopal realizations of finite type \(\mathbf{g}\)-vector fans
• Enumeration of basic ideals in type B

Cited In (3)

• Constructing large peak-pit Condorcet domains
• Symmetric maximal Condorcet domains
• Structured preferences: a literature survey

Uses Software

• OEIS

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)