Related papers: The arithmetic Tutte polynomials of the classical …
We provide a unified, elementary, topological approach to the classical results stating the continuity of the complex roots of a polynomial with respect to its coefficients, and the continuity of the coefficients with respect to the roots.…
We introduce and study the notion of the $G$-Tutte polynomial for a list $\mathcal{A}$ of elements in a finitely generated abelian group $\Gamma$ and an abelian group $G$, which is defined by counting the number of homomorphisms from…
We present a new method to calculate analytically the roots of the general complex polynomial of degree three. Thismethod is based on the approach of appropriated changes of variable involving an arbitrary parameter. The advantageof this…
A gain graph is a graph whose edges are orientably labelled from a group. A weighted gain graph is a gain graph with vertex weights from an abelian semigroup, where the gain group is lattice ordered and acts on the weight semigroup. For…
We introduce an arithmetic version of the multivariate Tutte polynomial, and (for representable arithmetic matroids) a quasi-polynomial that interpolates between the two. A generalized Fortuin-Kasteleyn representation with applications to…
We describe a construction of the Tutte polynomial for both matroids and $q$-matroids based on an appropriate partition of the underlying support lattice into intervals that correspond to prime-free minors, which we call a Tutte partition.…
Graph invariants are a useful tool in graph theory. Not only do they encode useful information about the graphs to which they are associated, but complete invariants can be used to distinguish between non-isomorphic graphs. Polynomial…
Specializing the $\gamma$-basis for the vector space $\mathcal{G}(n,r)$ spanned by the set of symbols on bit sequences with $r$ $1$'s and $n-r$ $0$'s, we obtain a frame or spanning set for the vector space $\mathcal{T}(n,r)$ spanned by…
Given any polynomial system with fixed monomial term structure, we give explicit formulae for the generic number of roots with specified coordinate vanishing restrictions. For the case of affine space minus an arbitrary union of coordinate…
We describe the multiplicative invariant algebras of the root lattices of all irreducible root systems under the action of the Weyl group. In each case, a finite system of fundamental invariants is determined and the class group of the…
From the configuration of a matroid (which records the size and rank of the cyclic flats and the containments among them, but not the sets), one can compute several much-studied matroid invariants, including the Tutte polynomial and a…
In the paper [Proceedings of the Japan Academy, Ser. A Mathematical Sciences, 95(10) 111-113], the authors introduce the concept of the Tutte polynomials of genus $g$ and announce that each matroid $M$ can be reconstructed from its Tutte…
In this paper, we survey results regarding the interlace polynomial of a graph, connections to such graph polynomials as the Martin and Tutte polynomials, and generalizations to the realms of isotropic systems and delta-matroids.
We introduce the minor-closed, dual-closed class of multi-path matroids. We give a polynomial-time algorithm for computing the Tutte polynomial of a multi-path matroid, we describe their basis activities, and we prove some basic structural…
The intersection data of a hyperplane arrangement is described by a geometric lattice, or equivalently a simple matroid. There is a rich interplay between this combinatorial structure and the topology of the arrangement complement. In this…
The classical relationship between the Tutte polynomial of graph theory and the Potts model of statistical mechanics has resulted in valuable interactions between the disciplines. Unfortunately, it does not include the external magnetic…
$q$-Matroids are defined on complemented modular support lattices. Minors of length 2 are of four types as in a "classical" matroid. Tutte polynomials $\tau(x,y)$ of matroids are calculated either by recursion over deletion/contraction of…
We show that the Bernstein-Sato polynomial (that is, the b-function) of a hyperplane arrangement with a reduced equation is calculable by combining a generalization of Malgrange's formula with the theory of Aomoto complexes due to Esnault,…
A hypertoric variety is a quaternionic analogue of a toric variety. Just as the topology of toric varieties is closely related to the combinatorics of polytopes, the topology of hypertoric varieties interacts richly with the combinatorics…
The deletion--contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomials in graph theory, the Jones polynomial of an alternating…