Linial arrangements and local binary search trees
Combinatorics
2014-12-01 v1
Abstract
We study the set of NBC sets (no broken circuit sets) of the Linial arrangement and deduce a constructive bijection to the set of local binary search trees. We then generalize this construction to two families of Linial type arrangements for which the bijections are with some -ary labelled trees that we introduce for this purpose.
Cite
@article{arxiv.1411.7834,
title = {Linial arrangements and local binary search trees},
author = {David Forge},
journal= {arXiv preprint arXiv:1411.7834},
year = {2014}
}
Comments
13 pages, 1 figure. arXiv admin note: text overlap with arXiv:1403.2573