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.









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)