Edge-labelled polygonal lattices carry preorders on square-equivalence classes of maximal chains that descend to contractions under lattice quotients, yielding new structural results for Cambrian lattices and the Kapranov-Voevodsky map.
Maps between higher Bruhat orders and higher Stasheff-Tamari posets
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
We make explict a description in terms of convex geometry of the higher Bruhat orders B(n,d) sketched by Kapranov and Voevodsky. We give an analogous description of the higher Stasheff-Tamari poset S_1(n,d). We show that the map f sketched by Kapranov and Voevodsky from B(n,d) to S([0,n+1],d+1) coincides with the map constructed by Rambau, and is a surjection for d<=2. We construct a map analogous to f from S_1(n,d) to B(n-1,d), and show that it is always a poset embedding. We also give an explicit criterion to determine if an element of B(n-1,d) is in the image of this map.
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Preorders on maximal chains: hyperplane arrangements, Cambrian lattices, and maximal green sequences
Edge-labelled polygonal lattices carry preorders on square-equivalence classes of maximal chains that descend to contractions under lattice quotients, yielding new structural results for Cambrian lattices and the Kapranov-Voevodsky map.