Related papers: The arithmetic Tutte polynomials of the classical …
The Tutte polynomial of a connected graph was originally defined by Tutte as a sum over all spanning trees of monomials depending on a fixed linear order on the set of edges. Tuttle proved that while these monomials do depend on the linear…
Many graph polynomials, such as the Tutte polynomial, the interlace polynomial and the matching polynomial, have both a recursive definition and a defining subset expansion formula. In this paper we present a general, logic-based framework…
This article contains general formulas for Tutte and Jones polynomials for families of knots and links given in Conway notation and "portraits of families"-- plots of zeroes of their corresponding Jones polynomials.
We prove some variants of the exponential formula and apply them to the multivariate Tutte polynomials (also known as Potts-model partition functions) of graphs. We also prove some further identities for the multivariate Tutte polynomial,…
We establish a connection between the algebraic geometry of the type B permutohedral toric variety and the combinatorics of delta-matroids. Using this connection, we compute the volume and lattice point counts of type B generalized…
We describe fast algorithms for approximating the connection coefficients between a family of orthogonal polynomials and another family with a polynomially or rationally modified measure. The connection coefficients are computed via…
We study the combinatorics of hyperplane arrangements over arbitrary fields. Specifically, we determine in which situation an arrangement and its reduction modulo a prime number have isomorphic lattices via the use of minimal strong…
The roots of any polynomial of degree m with integer coefficients, can be computed by manipulation of sequences made from 2m distinct symbols and counting the different symbols in the sequences. This method requires only 'primitive'…
The Tutte polynomial and Derksen's $\mathcal{G}$-invariant are the universal deletion-contraction and valuative matroid and polymatroid invariants, respectively. There are only a handful of well known invariants (like the matroid…
We study the complexity of computing the sign of the Tutte polynomial of a graph. As there are only three possible outcomes (positive, negative, and zero), this seems at first sight more like a decision problem than a counting problem.…
The catenary data of a matroid $M$ of rank $r$ on $n$ elements is the vector $(\nu(M;a_0,a_1,\ldots,a_r))$, indexed by compositions $(a_0,a_1,\ldots,a_r)$, where $a_0 \geq 0$,\, $a_i > 0$ for $i \geq 1$, and $a_0+ a_1 + \cdots + a_r = n$,…
The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…
This paper announces results on the behavior of some important algebraic and topological invariants --- Euler characteristic, arithmetic genus, and their intersection homology analogues; the signature, etc. --- and their associated…
The present work is concerned with characterizing some algebraic invariants of edge ideals of hypergraphs. To this aim, firstly, we introduce some kinds of combinatorial invariants similar to matching numbers for hypergraphs. Then we…
This thesis deals with the Tutte polynomial, studied from different points of view. In the first part, we address the enumeration of planar maps equipped with a spanning forest, here called forested maps, with a weight $z$ per face and a…
We realize several combinatorial Hopf algebras based on set compositions, plane trees and segmented compositions in terms of noncommutative polynomials in infinitely many variables. For each of them, we describe a trialgebra structure, an…
We show that computing the Tutte polynomial of a linear matroid of dimension $k$ on $k^{O(1)}$ points over a field of $k^{O(1)}$ elements requires $k^{\Omega(k)}$ time unless the \#ETH---a counting extension of the Exponential Time…
We give a description of the tropical variety of univariate polynomials of degree n having two double roots. As a set, it is given as the union of three types of maximal cones of dimension n-1, where only cones of two of these types are…
The usual methods for root finding of polynomials are based on the iteration of a numerical formula for improvement of successive estimations. The unpredictable nature of the iterations prevents to search roots inside a pre-specified region…
In this paper, we will compute the characteristic polynomials for finite dimensional representations of classical complex Lie algebras and the exceptional Lie algebra of type G2, which can be obtained through the orbits of integral weights…