The number of intervals in the m-Tamari lattices

Details The number of intervals in the m-Tamari lattices The number of intervals in the m-Tamari lattices

2011-06-08

arxiv.org/abs/1106.1498v2

Mathematics

Combinatorics

19 pages

Scientific paper

An m-ballot path of size n is a path on the square grid consisting of north and east steps, starting at (0,0), ending at (mn,n), and never going below the line {x=my}. The set of these paths can be equipped with a lattice structure, called the m-Tamari lattice, which generalizes the usual Tamari lattice obtained when m=1. We prove that the number of intervals in this lattice is $$ \frac {m+1}{n(mn+1)} {(m+1)^2 n+m\choose n-1}. $$ This formula was recently conjectured by Bergeron in connection with the study of coinvariant spaces. The case m=1 was proved a few years ago by Chapoton. Our proof is based on a recursive description of intervals, which translates into a functional equation satisfied by the associated generating function. The solution of this equation is an algebraic series, obtained by a guess-and-check approach. Finding a bijective proof remains an open problem.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-319906