Computing the Tutte polynomial of a hyperplane arrangement
Combinatorics
2007-05-23 v1
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.
Cite
@article{arxiv.math/0409211,
title = {Computing the Tutte polynomial of a hyperplane arrangement},
author = {Federico Ardila},
journal= {arXiv preprint arXiv:math/0409211},
year = {2007}
}
Comments
27 pages, 2 figures