Computing the Tutte polynomial of a hyperplane arragement
نویسندگان
چکیده
منابع مشابه
Computing the Tutte Polynomial of a Hyperplane Arragement
Theorem 1.1 [Zaslavsky 1975]. Let A be a hyperplane arrangement in Rn . The number of regions into which A dissects Rn is equal to (−1)χA(−1). The number of regions which are relatively bounded is equal to (−1)χA(1). Theorem 1.2 [Orlik and Solomon 1980]. Let A be a hyperplane arrangement in Cn , and let MA =Cn− ⋃ H∈A H be its complement. Then the Poincaré polynomial of the cohomology ring of MA...
متن کاملComputing the Tutte polynomial of a hyperplane arrangement
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 tre...
متن کاملComputing the Tutte polynomial of Archimedean tilings
We describe an algorithm to compute the Tutte polynomial of large fragments of Archimedean tilings by squares, triangles, hexagons and combinations thereof. Our algorithm improves a well known method for computing the Tutte polynomial of square lattices. We also address the problem of obtaining Tutte polynomial evaluations from the symbolic expressions generated by our algorithm, improving the ...
متن کاملOn the tutte polynomial of benzenoid chains
The Tutte polynomial of a graph G, T(G, x,y) is a polynomial in two variables defined for every undirected graph contains information about how the graph is connected. In this paper a simple formula for computing Tutte polynomial of a benzenoid chain is presented.
متن کاملThe Complexity of Computing the Tutte Polynomial on Transversal Matroids
The complexity of computing the Tutte polynomial T(~/c,x,y) is determined for transversal matroid ,4s and algebraic numbers x and y. It is shown that for fixed x and y the problem of computing T(~,x,y) for JA a transversal matroid is ~pP-complete unless the numbers x and y satisfy (x 1)(y 1) = 1, in which case it is polynomial-time computable. In particular, the problem of counting bases in a t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 2007
ISSN: 0030-8730
DOI: 10.2140/pjm.2007.230.1