REVIEW 1 cited by
Maps between higher Bruhat orders and higher Stasheff-Tamari posets
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original 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.
Forward citations
Cited by 1 Pith paper
-
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 Kapr...
Discussion (0). Continue with ORCID to comment.