Enumerative combinatorics
On the rotation distance in the lattice of binary trees
Information Processing Letters
Matchings for linearly indecomposable modular lattices
Discrete Mathematics
On the structure of the lattice of noncrossing partitions
Discrete Mathematics
Chains in the lattice of noncrossing partitions
Discrete Mathematics
Two shortest path metrics on well-formed parentheses strings
Information Processing Letters
Non-crossing partitions for classical reflection groups
Discrete Mathematics
Discrete Mathematics
Information Theory and Reliable Communication
Information Theory and Reliable Communication
Generating binary trees by Glivenko classes on Tamari lattices
Information Processing Letters
Right-arm rotation distance between binary trees
Information Processing Letters
Efficient lower and upper bounds of the diagonal-flip distance between triangulations
Information Processing Letters
Motzkin subposets and Motzkin geodesics in Tamari lattices
Information Processing Letters
| Hi-index | 5.24 |
We introduce a new lattice structure B"n on binary trees of size n. We exhibit efficient algorithms for computing meet and join of two binary trees and give several properties of this lattice. More precisely, we prove that the length of a longest (resp. shortest) path between 0 and 1 in B"n equals to the Eulerian numbers 2^n-(n+1) (resp. (n-1)^2) and that the number of coverings is (2nn-1). Finally, we exhibit a matching in a constructive way. Then we propose some open problems about this new structure.