Maps between higher Bruhat orders and higher Stasheff-Tamari posets

Details Maps between higher Bruhat orders and higher Stasheff-Tamari posets Maps between higher Bruhat orders and higher Stasheff-Tamari posets

2002-12-06

arxiv.org/abs/math/0212097v2

Mathematics

Combinatorics

26 pages, 5 figures. Changes from version one are minor and confined to one paragraph

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Maps between higher Bruhat orders and higher Stasheff-Tamari posets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Maps between higher Bruhat orders and higher Stasheff-Tamari posets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Maps between higher Bruhat orders and higher Stasheff-Tamari posets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-86808