Tutte polynomials for regular oriented matroids
Jordan Awan, Olivier Bernardi

TL;DR
This paper introduces the A-polynomial, a new invariant for regular oriented matroids that generalizes the Tutte polynomial, capturing properties like acyclicity and cyclicity, and extending known matroid invariants.
Contribution
The paper defines the A-polynomial for regular oriented matroids, establishing its properties, specializations, and its relation to the Tutte polynomial, thus extending matroid invariants to oriented cases.
Findings
A-polynomial specializes to the Tutte polynomial for underlying unoriented matroids.
A-polynomial detects acyclicity and total cyclicity in oriented matroids.
A specialization of the A-polynomial counts reorientations of acyclic orientations.
Abstract
The Tutte polynomial is a fundamental invariant of graphs and matroids. In this article, we define a generalization of the Tutte polynomial to oriented graphs and regular oriented matroids. To any regular oriented matroid , we associate a polynomial invariant , which we call the A-polynomial. The A-polynomial has the following interesting properties among many others: 1. a specialization of gives the Tutte polynomial of the unoriented matroid underlying , 2. when the oriented matroid corresponds to an unoriented matroid (that is, when the elements of the ground set come in pairs with opposite orientations), the -polynomial is equivalent to the Tutte polynomial of this unoriented matroid (up to a change of variables), 3. the A-polynomial detects, among other things, whether is acyclic and whether is totally cyclic. We explore various…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Advanced Combinatorial Mathematics · graph theory and CDMA systems
