Counting smaller elements in the Tamari and m-Tamari lattices

@article{Chtel2015CountingSE,
  title={Counting smaller elements in the Tamari and m-Tamari lattices},
  author={Gr{\'e}gory Ch{\^a}tel and Viviane Pons},
  journal={J. Comb. Theory, Ser. A},
  year={2015},
  volume={134},
  pages={58-97}
}
  • G. Châtel, V. Pons
  • Published 15 November 2013
  • Mathematics, Computer Science
  • J. Comb. Theory, Ser. A
Exceptional and modern intervals of the Tamari lattice
In this article we use the theory of interval-posets recently introduced by Ch{\^a}tel and Pons in order to describe some interesting families of intervals in the Tamari lattices. These families are
A recursion on maximal chains in the Tamari lattices
Meeting Covered Elements in $\nu$-Tamari Lattices
For each meet-semilattice M , we define an operator PopM : M →M by PopM (x) = ∧ ({y ∈M : y l x} ∪ {x}). When M is the right weak order on a symmetric group, PopM is the pop-stack-sorting map. We
Two bijections on Tamari Intervals
We use a recently introduced combinatorial object, the $\textit{interval-poset}$, to describe two bijections on intervals of the Tamari lattice. Both bijections give a combinatorial proof of some
m-dendriform algebras
The Fuss-Catalan numbers are a generalization of the Catalan numbers. They enumerate a large class of objects and in particular m-Dyck paths and m+1-ary trees. Recently, F. Bergeron defined an
Geometry of $\nu $-Tamari lattices in types $A$ and $B$
In this paper, we exploit the combinatorics and geometry of triangulations of products of simplices to derive new results in the context of Catalan combinatorics of $\nu$-Tamari lattices. In our
Cubic realizations of Tamari interval lattices
We introduce cubic coordinates, which are integer words encoding intervals in the Tamari lattices. Cubic coordinates are in bijection with interval-posets, themselves known to be in bijection with
GEOMETRIC REALIZATIONS OF TAMARI INTERVAL LATTICES VIA CUBIC COORDINATES
We introduce cubic coordinates, which are integer words encoding intervals in the Tamari lattices. Cubic coordinates are in bijection with interval-posets, themselves known to be in bijection with
An extension of Tamari lattices
For any finite path $v$ on the square grid consisting of north and east unit steps, starting at (0,0), we construct a poset Tam$(v)$ that consists of all the paths weakly above $v$ with the same
...
...

References

SHOWING 1-10 OF 18 REFERENCES
The Number of Intervals in the m-Tamari Lattices
TLDR
The number of intervals in this lattice is proved to be $$ m+1}{n(mn+1)} {(m+1)^2 n+m\choose n-1}.
Sur le nombre d'intervalles dans les treillis de Tamari
We enumerate the intervals in the Tamari lattices. For this, we introduce an inductive description of the intervals. Then a notion of "new interval" is defined and these are also enumerated. A a side
Permutation statistics and linear extensions of posets
Flows on rooted trees and the Narayana idempotents
Several generating series for flows on rooted trees are introduced, as elements in the group of series associated with the Pre-Lie operad. By combinatorial arguments, one proves identities that
Enumerative combinatorics
TLDR
This review of 3 Enumerative Combinatorics, by Charalambos A.good, does not support this; the label ‘Example’ is given in a rather small font followed by a ‘PROOF,’ and the body of an example is nonitalic, utterly unlike other statements accompanied by demonstrations.
Higher Trivariate Diagonal Harmonics via generalized Tamari Posets
We consider the graded $\S_n$-modules of higher diagonally harmonic polynomials in three sets of variables (the trivariate case), and show that they have interesting ties with generalizations of the
Hopf Algebra of the Planar Binary Trees
is a sub-Hopf algebra. There is a basis Qn of Soln such that the composite map k[Qn]&Soln k[Sn] has the following property: its linear dual k[Sn] k[Qn] is induced by a set-theoretic map Sn Qn . In
AN ALGORITHM FOR THE ORGANIZATION OF INFORMATION
TLDR
The organization of information placed in the points of an automatic computer is discussed and the role of memory, storage and retrieval in this regard is discussed.
Flows on Rooted Trees and the Menous-Novelli-Thibon Idempotents
Several generating series for flows on rooted trees are introduced, as elements in the group of series associated with the Pre-Lie operad. By combinatorial arguments, one proves identities that
...
...