Arithmetic matroids, the Tutte polynomial and toric arrangements
نویسندگان
چکیده
منابع مشابه
A Tutte Polynomial for Toric Arrangements
We introduce a multiplicity Tutte polynomial M(x, y), with applications to zonotopes and toric arrangements. We prove that M(x, y) satisfies a deletion-restriction recursion and has positive coefficients. The characteristic polynomial and the Poincaré polynomial of a toric arrangement are shown to be specializations of the associated polynomial M(x, y), likewise the corresponding polynomials fo...
متن کاملZonotopes, toric arrangements, and generalized Tutte polynomials
We introduce a multiplicity Tutte polynomial M(x, y), which generalizes the ordinary one and has applications to zonotopes and toric arrangements. We prove that M(x, y) satisfies a deletion-restriction recurrence and has positive coefficients. The characteristic polynomial and the Poincaré polynomial of a toric arrangement are shown to be specializations of the associated polynomial M(x, y), li...
متن کاملThe multivariate arithmetic Tutte polynomial
We introduce an arithmetic version of the multivariate Tutte polynomial recently studied by Sokal, and a quasi-polynomial that interpolates between the two. We provide a generalized Fortuin-Kasteleyn representation for representable arithmetic matroids, with applications to arithmetic colorings and flows. We give a new proof of the positivity of the coefficients of the arithmetic Tutte polynomi...
متن کامل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...
متن کاملThe Tutte Polynomial for Matroids of Bounded Branch-Width
It is a classical result of Jaeger, Vertigan and Welsh that evaluating the Tutte polynomial of a graph is #P -hard in all but few special points. On the other hand, several papers in past years have shown that the Tutte polynomial of a graph can be efficiently computed for graphs of bounded tree-width. In this paper we present a recursive formula computing the Tutte polynomial of a matroid M re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 2013
ISSN: 0001-8708
DOI: 10.1016/j.aim.2012.09.001