The Active Bijection 2.b - Decomposition of activities for oriented matroids, and general definitions of the active bijection

The active bijection for oriented matroids (and real hyperplane arrangements, and graphs, as particular cases) is introduced and investigated by the authors in a series of papers. Given any oriented matroid defined on a linearly ordered ground set, we exhibit one particularit\'e of its bases, which we call its active basis, with remarkable properties. It preserves activities (for oriented matroids in the sense of Las Vergnas, for matroid bases in the sense of Tutte), as well as some active partitions of the ground set associated with oriented matroids and matroid bases. It yields a canonical bijection between classes of reorientations and bases [...]. It also yields a refined bijection between all reorientations and subsets of the ground set. Those bijections are related to various Tutte polynomial expressions [...]. They contain various noticeable bijections involving orientations/signatures/reorientations and spanning trees/simplices/bases of a graph/real hyperplane arrangement/oriented matroid. [...] In previous papers of this series, we defined the active bijection between bounded regions and uniactive internal bases by means of fully optimal bases (No. 1), and we defined a decomposition of activities for matroid bases by means of [...] particular sequences of minors (companion paper, No. 2.a). The present paper is central in the series. First, we define a decomposition of activities for oriented matroids, using the same sequences of minors, yielding a decomposition of an oriented matroid into bounded regions of minors. Second, we use the previous results together to provide the canonical and refined active bijections alluded to above. We also give an overview and examples of the various results of independent interest involved in the construction. They arise as soon as the ground set of an oriented matroid is linearly ordered.

[1]  Gary Gordon,et al.  Interval Partitions and Activities for the Greedoid Tutte Polynomial , 1997 .

[2]  Emeric Gioan Correspondance naturelle entre bases et réorientations des matroïdes orientés , 2002 .

[3]  Richard P. Stanley Acyclic orientations of graphs , 1973, Discret. Math..

[4]  Bodo Lass,et al.  Orientations Acycliques et le Polyno^me Chromatique , 2001, Eur. J. Comb..

[5]  Michel Las Vergnas The Tutte polynomial of a morphism of matroids - 5. Derivatives as generating functions of Tutte activities , 2013, Eur. J. Comb..

[6]  Emeric Gioan,et al.  The active bijection in graphs, hyperplane arrangements, and oriented matroids, 1: The fully optimal basis of a bounded region , 2009, Eur. J. Comb..

[7]  Michel Las Vergnas The Tutte Polynomial of a Morphism of Matroids 6. A Multi-Faceted Counting Formula for Hyperplane Regions and Acyclic Orientations , 2012 .

[8]  Pierre Cartier,et al.  Problemes combinatoires de commutation et rearrangements , 1969 .

[9]  Emeric Gioan,et al.  Fully Optimal Bases and the Active Bijection in Graphs, Hyperplane Arrangements, and Oriented Matroids , 2007, Electron. Notes Discret. Math..

[10]  T. Zaslavsky Facing Up to Arrangements: Face-Count Formulas for Partitions of Space by Hyperplanes , 1975 .

[11]  R. Winder Partitions of N-Space by Hyperplanes , 1966 .

[12]  Dominic Welsh,et al.  The Tutte polynomial , 1999, Random Struct. Algorithms.

[13]  Emeric Gioan,et al.  The Active Bijection between Regions and Simplices in Supersolvable Arrangements of Hyperplanes , 2006, Electron. J. Comb..

[14]  Thomas Zaslavsky,et al.  ON THE INTERPRETATION OF WHITNEY NUMBERS THROUGH ARRANGEMENTS OF HYPERPLANES, ZONOTOPES, NON-RADON PARTITIONS, AND ORIENTATIONS OF GRAPHS , 1983 .

[15]  G. Viennot Heaps of Pieces, I: Basic Definitions and Combinatorial Lemmas , 1989 .

[16]  W. T. Tutte,et al.  A Contribution to the Theory of Chromatic Polynomials , 1954, Canadian Journal of Mathematics.

[17]  Emeric Gioan,et al.  Activity preserving bijections between spanning trees and orientations in graphs , 2005, Discret. Math..

[18]  J. Oxley Matroid Theory (Oxford Graduate Texts in Mathematics) , 2006 .

[19]  Michel Las Vergnas,et al.  Acyclic and totally cyclic orientations of combinatorial geometries , 1977, Discret. Math..

[20]  Gary Gordon,et al.  Generalized activities and the tutte polynomial , 1990, Discret. Math..

[21]  Gerald Berman,et al.  The Dichromate and Orientations of a Graph , 1977, Canadian Journal of Mathematics.

[22]  H. Crapo A higher invariant for matroids , 1967 .

[23]  Emeric Gioan,et al.  A Linear Programming Construction of Fully Optimal Bases in Graphs and Hyperplane Arrangements , 2009, Electron. Notes Discret. Math..

[24]  Ira M. Gessel Acyclic orientations and chromatic generating functions , 2001, Discret. Math..

[25]  J. E. Dawson A construction for a family of sets and its application to matroids , 1981 .

[26]  Emeric Gioan,et al.  Bases, reorientations, and linear programming, in uniform and rank-3 oriented matroids , 2004, Adv. Appl. Math..