The Active Bijection between Regions and Simplices in Supersolvable Arrangements of Hyperplanes

Comparing two expressions of the Tutte polynomial of an ordered oriented matroid yields a remarkable numerical relation between the numbers of reorientations and bases with given activities. A natural activity preserving reorientation-to-basis mapping compatible with this relation is described in a series of papers by the present authors. This mapping, equivalent to a bijection between regions and no broken cir- cuit subsets, provides a bijective version of several enumerative results due to Stanley, Winder, Zaslavsky, and Las Vergnas, expressing the number of acyclic orientations in graphs, or the number of regions in real arrangements of hyperplanes or pseudohyper- planes (i.e. oriented matroids), as evaluations of the Tutte polynomial. In the present paper, we consider in detail the supersolvable case { a notion introduced by Stanley { in the context of arrangements of hyperplanes. For linear orderings compatible with the supersolvable structure, special properties are available, yielding constructions signicantly simpler than those in the general case. As an application, we completely carry out the computation of the active bijection for the Coxeter arrangements An and Bn. It turns out that in both cases the active bijection is closely related to a classical bijection between permutations and increasing trees.

[1]  Anders Björner,et al.  Matroid Applications: Homology and Shellability of Matroids and Geometric Lattices , 1992 .

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

[3]  Branko Grünbaum,et al.  Venn Diagrams and Independent Families of Sets. , 1975 .

[4]  Pankaj K. Agarwal.  Intersection and decomposition algorithms for planar arrangements , 1991 .

[5]  Tom Brylawski,et al.  Matroid Applications: The Tutte Polynomial and Its Applications , 1992 .

[6]  Ileana Streinu,et al.  On the Folkman-Lawrence Topological Representation Theorem for Oriented Matroids of Rank 3 , 2001, Eur. J. Comb..

[7]  Leonidas J. Guibas,et al.  On the general motion-planning problem with two degrees of freedom , 2015, SCG '88.

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

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

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

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

[12]  Jean Françon.  Arbres Binaires de Recherche: Propriétés Combinatioires et Applications , 1976, RAIRO Theor. Informatics Appl..

[13]  Leonard H. Soicher,et al.  An Algorithmic Approach to Fundamental Groups and Covers of Combinatorial Cell Complexes , 2000, J. Symb. Comput..

[14]  Michel Las Vergnas,et al.  Convexity in oriented matroids , 1980, J. Comb. Theory B.

[15]  Paul H. Edelman,et al.  Hyperplane arrangements with a lattice of regions , 1990, Discret. Comput. Geom..

[16]  Charalambos A. Charalambides,et al.  Enumerative combinatorics , 2018, SIGA.

[17]  D. W. Blackett,et al.  Elementary Topology: A Combinatorial and Algebraic Approach , 1967 .

[18]  Godfried T. Toussaint,et al.  Finding Hamiltonian Circuits in Arrangements of Jordan Curves is NP-Complete , 1994, Inf. Process. Lett..

[19]  Leonidas J. Guibas,et al.  Combinatorial complexity bounds for arrangements of curves and spheres , 1990, Discret. Comput. Geom..

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

[21]  B. Sturmfels.  Oriented Matroids , 1993 .

[22]  Leonidas J. Guibas,et al.  Arrangements of Curves in the Plane - Topology, Combinatorics and Algorithms , 2018, Theor. Comput. Sci..

[23]  Günter M. Ziegler,et al.  Broken circuit complexes: Factorizations and generalizations , 1991, J. Comb. Theory B.

[24]  Micha Sharir,et al.  On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles , 1986, Discret. Comput. Geom..

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

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

[27]  S. Yuzvinsky,et al.  Orlik-Solomon algebras in algebra and topology , 2001 .

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

[29]  R. Stanley,et al.  Supersolvable lattices , 1972 .

[30]  H. Crapo,et al.  The Tutte polynomial , 1969, 1707.03459.

[31]  Jonathan L. Gross,et al.  Topological Graph Theory , 1987, Handbook of Graph Theory.