Linial arrangements and local binary search trees

MaRDI QIDQ6256818zbMATH OpenFDO

Authors David Forge

Publication date 28 November 2014

Mathematics Subject Classification ID

Combinatorial identities, bijective combinatorics (05A19) Trees (05C05) Signed and weighted graphs (05C22) Enumeration in graph theory (05C30) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)

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.

This page was built for publication: Linial arrangements and local binary search trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6256818)