Computing the Tutte polynomial of a hyperplane arragement

From MaRDI portal
Publication:952923

DOI10.2140/PJM.2007.230.1zbMATH Open1152.52011arXivmath/0409211OpenAlexW2147276944MaRDI QIDQ952923FDOQ952923

Federico Ardila

Publication date: 14 November 2008

Published in: Pacific Journal of Mathematics (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/math/0409211






Cited In (19)


   Recommendations





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)