The Weak Bruhat Order of $\text{S}_\Sigma $, Consistent Sets, and Catalan Numbers

DOI10.1137/0404001zbMath0725.90005OpenAlexW2041977735MaRDI QIDQ5202790

James Abello

Publication date: 1991

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0404001

zbMATH Keywords

Catalan numberCoxeter groupweak Bruhat orderArrow's Impossibility Theoremsaturated chainpairwise simple majority voteupper semimodular sublattice

Mathematics Subject Classification ID

Semimodular lattices, geometric lattices (06C10) Ordered groups (06F15) Social choice (91B14)

Related Items

The first higher Stasheff-Tamari orders are quotients of the higher Bruhat orders ⋮ Visibility graphs of staircase polygons and the weak Bruhat order. I: From visibility graphs to maximal chains ⋮ Decision theory and discrete mathematics ⋮ Maximal Condorcet domains ⋮ Condorcet domains of tiling type ⋮ Finding sharper distinctions for conditions of transitivity of the majority method. ⋮ On the number of single-peaked narcissistic or single-crossing narcissistic preference profiles ⋮ Majority rule on rhombus tilings and Condorcet super-domains ⋮ A characterization of the single-crossing domain ⋮ Acyclic sets of linear orders via the Bruhat orders ⋮ The single-peaked domain revisited: a simple global characterization ⋮ Cambrian acyclic domains: counting \(c\)-singletons ⋮ Condorcet domains, median graphs and the single-crossing property ⋮ Constructing large peak-pit Condorcet domains