The cd-index of Bruhat intervals

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

25 pages, 6 figures

Scientific paper

We study flag enumeration in intervals in the Bruhat order on a Coxeter group by means of a structural recursion on intervals in the Bruhat order. The recursion gives the isomorphism type of a Bruhat interval in terms of smaller intervals, using basic geometric operations which preserve PL sphericity and have a simple effect on the cd-index. This leads to a new proof that Bruhat intervals are PL spheres as well a recursive formula for the cd-index of a Bruhat interval. This recursive formula is used to prove that the cd-indices of Bruhat intervals span the space of cd-polynomials. The structural recursion leads to a conjecture that Bruhat spheres are "smaller" than polytopes. More precisely, we conjecture that if one fixes the lengths of x and y, then the cd-index of a certain dual stacked polytope is a coefficientwise upper bound on the cd-indices of Bruhat intervals [x,y]. We show that this upper bound would be tight by constructing Bruhat intervals which are the face lattices of these dual stacked polytopes. As a weakening of a special case of the conjecture, we show that the flag h-vectors of lower Bruhat intervals are bounded above by the flag h-vectors of Boolean algebras (i.e. simplices).

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

The cd-index of Bruhat intervals 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 The cd-index of Bruhat intervals, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The cd-index of Bruhat intervals will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-640957

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.