On rank functions for heaps

Details On rank functions for heaps On rank functions for heaps

2003-02-27

arxiv.org/abs/math/0302347v1

Mathematics

Combinatorics

18 pages AMSTeX, 3 figures

Scientific paper

Motivated by work of Stembridge, we study rank functions for Viennot's heaps
of pieces. We produce a simple and sufficient criterion for a heap to be a
ranked poset and apply the results to the heaps arising from fully commutative
words in Coxeter groups.

Affiliated with

Also associated with

No associations

Rating

On rank functions for heaps 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 On rank functions for heaps, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On rank functions for heaps will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-331068