Abstract
Abstract In this note, we present the main results of a series of forthcoming papers, dealing with bi-jective generalizations of some counting formulas. New intrinsic constructions in oriented matroids on a linearly ordered set of elements establish notably structural links between counting regions and linear programming. We introduce fully optimal bases , which have a simple combinatorial characterization, and strengthen the well-known optimal bases of linear programming. Our main result is that every bounded region of an ordered hyperplane arrangement, or ordered oriented matroid, has a unique fully optimal basis, providing the active bijection between bounded regions and uniactive internal bases. The active bijec-tion is extended to an activity preserving mapping between all reorientations and all bases of an ordered oriented matroid. It gives a bijective interpretation of the equality of two expressions for the Tutte polynomial, as well as a new expression of this polynomial in terms of beta invariants of minors. There are several refinements, such as an activity preserving bijection between regions (acyclic reorientations) and no-broken-circuit subsets, and others in terms of hyperplane arrangements, graphs, and permutations.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
