COMPUTING THE TUTTE POLYNOMIAL OF A HYPERPLANE ARRAGEMENT
By Federico Ardila. 2004
52 citations recorded by the source corpus.
We define and study the Tutte polynomial of a hyperplane arrangement. We introduce a method for computing the Tutte polynomial by solving a related enumerative problem. As a consequence, we obtain new formulas for the generating functions enumerating alternating trees, labelled trees, semiorders and Dyck paths.
Subfields: Discrete Mathematics and Combinatorics, Electrical and Electronic Engineering, Mathematical Physics
View Paper: https://www.semanticscholar.org/paper/b3e18b24da256dbab352ec619ae1f59142410a1e
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Discrete Mathematics and Combinatorics
- Federico Ardila
- Luca Moci
- Petter Brand'en
- Alexander Postnikov
- Lauren K. Williams
- David E. Speyer
- Thomas Lam
- June Huh
In Electrical and Electronic Engineering
In Mathematical Physics
- Petter Brand'en
- Federico Ardila
- Alexander Postnikov
- Luca Moci
- Thomas Lam
- Eric Katz
- Julius Borcea
- Peter R. W. McNamara
Citations in the corpus
- Combinatorics and geometry of power ideals (2008, background): “A. We will need some basic facts about matroids, Tutte polynomials, and their connection with hyperplane arrangements. We will outline the necessary background information, and we refer the reader to [1, 14, 21] for further details. 4.1. The ideals I A;k and I0 A;k . Let Abe a central hyperplane arr”
- The multivariate arithmetic Tutte polynomial (2012, background): “(Here E is the ground set of the arithmetic matroid A, while rk and m are the rank and the multiplicity functions respectively).”