Computing the Tutte polynomial of a hyperplane arragement
From MaRDI portal
Abstract: We define and study the Tutte polynomial of a hyperplane arrangement. We introduce a method for computing it by solving an enumerative problem in a finite field. For specific arrangements, the computation of Tutte polynomials is then reduced to certain related enumerative questions. As a consequence, we obtain new formulas for the generating functions enumerating alternating trees, labelled trees, semiorders and Dyck paths.
Recommendations
Cited in
(20)- The arithmetic Tutte polynomials of the classical root systems
- The bipermutahedron
- Gessel polynomials, rooks, and extended linial arrangements
- Hyperplane arrangements in CoCoA
- The zonotope of a root system
- Computing characteristic polynomials of hyperplane arrangements with symmetries
- A statistic for regions of braid deformations
- On the enumeration of a certain type of hyperplane arrangements
- The Tutte polynomial of symmetric hyperplane arrangements
- Lattice points in orthotopes and a huge polynomial Tutte invariant of weighted gain graphs
- Free hyperplane arrangements over arbitrary fields
- Combinatorics and geometry of power ideals
- scientific article; zbMATH DE number 7499156 (Why is no real title available?)
- Deformations of the braid arrangement and trees
- New perspectives on polynomial invariants
- The multivariate arithmetic Tutte polynomial
- A branch statistic for trees: interpreting coefficients of the characteristic polynomial of braid deformations
- The geometry of geometries: matroid theory, old and new
- The Tutte polynomial of ideal arrangements
- Combinatorially equivalent hyperplane arrangements
This page was built for publication: Computing the Tutte polynomial of a hyperplane arragement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q952923)