Computing the Tutte polynomial of a hyperplane arrangement

Simple item page
dc.creatorArdila, Federico
dc.date2004-09-13
dc.date.accessioned2026-07-07T05:12:05Z
dc.date.available2026-07-07T05:12:05Z
dc.descriptionWe 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.
dc.description27 pages, 2 figures
dc.identifierhttps://arxiv.org/abs/math/0409211
dc.identifierhttp://arxiv.org/abs/math/0409211
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/72457
dc.subjectCombinatorics
dc.subject05A15; 52C35; 05B35
dc.titleComputing the Tutte polynomial of a hyperplane arrangement
dc.typetext

Files

Collections

arXiv