activity
20012022
most citedLinial arrangements and local binary search trees

8 citations · 12 across the 13 of their papers we have counts for

collaborators
Showing 2014Show all

2 papers · 1 filter

math.CO2014★ 8 cited

Linial arrangements and local binary search trees

David Forge

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…

math.CO2014★ 1 cited

Bijections between affine hyperplane arrangements and valued graphs

Sylvie Corteel, David Forge, Véronique Ventos

We show new bijective proofs of previously known formulas for the number of regions of some deformations of the braid arrangement, by means of a bijection between the no-broken-cir…