Pith. sign in

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

arxiv math/0212097 v2 pith:7RU3T2SF submitted 2002-12-06 math.CO math.MG

classification math.COmath.MG
keywords higheranalogousbruhatdescriptiongivekapranovordersposet
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Preorders on maximal chains: hyperplane arrangements, Cambrian lattices, and maximal green sequences

    math.CO 2025-06 conditional novelty 8.0 of 10

    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...

Pith tools