2 citations · 3 across the 6 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
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…
math.CO2010
An elementary chromatic reduction for gain graphs and special hyperplane arrangements
Pascal Berthome, Raul Cordovil, David Forge +2
A gain graph is a graph whose edges are labelled invertibly by "gains" from a group. "Switching" is a transformation of gain graphs that generalizes conjugation in a group. A "weak…