Linial arrangements and local binary search trees

2014/11/28 by David Forge, Forge, David
Engineering · Mathematics · #05A19 #05C05 #05C22 #05C30 #52C35 #Advanced Combinatorial Mathematics #Advanced Mathematical Identities #Combinatorics (math.CO) #FOS: Mathematics #graph theory and CDMA systems #math.CO #msc:05A19 #msc:05C05 #msc:05C22 #msc:05C30 #msc:52C35

paper · pdf · doi:10.48550/arxiv.1411.7834

13 pages, 1 figure. arXiv admin note: text overlap with arXiv:1403.2573

arxiv created 2014/11/28 · openalex publication_date 2014/11/28 · arxiv updated 2014/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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 k-ary labelled trees that we introduce for this purpose.

Citations

• Bijections between affine hyperplane arrangements and valued graphs

Related

• An analogue of the plactic monoid for binary search trees
• Self-Adjusting Binary Search Trees: What Makes Them Tick?
• Gessel polynomials, rooks, and extended Linial arrangements
• Bijections in weakly increasing trees via binary trees
• A bijection for the evolution of B-trees