8 citations · 12 across the 13 of their papers we have counts for
13 papers
Activity from matroids to rooted trees and beyond
Rigoberto Flórez, David Forge
The interior and exterior activities of bases of a matroid are well-known notions that for instance permit one to define the Tutte polynomial. Recently, we have discovered correspo…
Minimal non-orientable matroids in a projective plane
Rigoberto Florez, David Forge
We construct a new family of minimal non-orientable matroids of rank three. Some of these matroids embed in Desarguesian projective planes. This answers a question of Ziegler: for…
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…
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…
Lattice Points in Orthotopes and a Huge Polynomial Tutte Invariant of Weighted Gain Graphs
David Forge, Thomas Zaslavsky
A gain graph is a graph whose edges are orientably labelled from a group. A weighted gain graph is a gain graph with vertex weights from an abelian semigroup, where the gain group…
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…