English
Related papers

Related papers: The Tutte polynomials of genus $g$

200 papers

For a polynomial with palindromic coefficients, unimodality is equivalent to having a nonnegative $g$-vector. A sufficient condition for unimodality is having a nonnegative $\gamma$-vector, though one can have negative entries in the…

Combinatorics · Mathematics 2016-01-20 Charles Brittenham , Andrew Carroll , T. Kyle Petersen , Connor Thomas

Let A be a (central) arrangement of hyperplanes in a finite dimension complex vector space V. Let M(A) be the dependence matroid determined by A. The Orlik-Solomon algebra OS(M) of a matroid M is the exterior algebra on the points modulo…

Combinatorics · Mathematics 2012-01-19 Raul Cordovil , David Forge

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.

Combinatorics · Mathematics 2016-01-13 Ada Morse

The weighted transition polynomial of a multimatroid is a generalization of the Tutte polynomial. By defining the activity of a skew class with respect to a basis in a multimatroid, we obtain an activities expansion for the weighted…

Combinatorics · Mathematics 2025-02-24 Criel Merino , Iain Moffatt , Steven Noble

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…

Logic in Computer Science · Computer Science 2013-09-10 Benny Godlin , Emilia Katz , Johann A. Makowsky

The matroidal version of the Merino--Welsh conjecture states that the Tutte polynomial $T_M(x,y)$ of any matroid $M$ without loops and coloops satisfies that $$\max(T_M(2,0),T_M(0,2))\geq T_M(1,1).$$ Equivalently, if the Merino--Welsh…

Combinatorics · Mathematics 2024-02-26 Csongor Beke , Gergely Kál Csáji , Péter Csikvári , Sára Pituk

The Merino-Welsh conjectures say that subject to conditions, there is an inequality among the Tutte-polynomial evaluations $T(M;2,0)$, $T(M;0,2)$, and $T(M;1,1)$. We present three results on a Merino-Welsh conjecture. These results are…

Combinatorics · Mathematics 2025-02-21 Joseph P. S. Kung

We study classes $P_{g,T}(\alpha;\beta)$ on the moduli space of stable, genus g curves with rational tails defined by pushing forward the virtual fundamental classes of spaces of relative stable maps to an unparameterized projective line. A…

Algebraic Geometry · Mathematics 2011-07-06 Renzo Cavalieri , Steffen Marcus , Jonathan Wise

We study an operation in matroid theory that allows one to transition a given matroid into another with more bases via relaxing a \emph{stressed subset}. This framework provides a new combinatorial characterization of the class of split…

Combinatorics · Mathematics 2024-09-12 Luis Ferroni , Benjamin Schröter

Consider the Laguerre polynomials and deform them by the introduction in the measure of an exponential singularity at zero. In [Chen Y., Its A., J. Approx. Theory 162 (2010), 270-297, arXiv:0808.3590] the authors proved that this…

Mathematical Physics · Physics 2018-07-24 Mattia Cafasso , Manuel D. de la Iglesia

Let k be a field of characteristic zero. We consider graded subalgebras A of k[x_1,...,x_m]/(x_1^2,...,x_m^2) generated by d linearly independant linear forms. Representations of matroids over k provide a natural description of the…

Combinatorics · Mathematics 2007-05-23 David G. Wagner

As already done for the matrix case for example in [Joe Harris, Algebraic Geometry - A first course, p.256] we give a parametrization of the Bouligand tangent cone of the variety of tensors of bounded TT rank. We discuss how the proof…

Optimization and Control · Mathematics 2017-05-30 Benjamin Kutschan

We give a self-contained proof of the strongest version of Mason's conjecture, namely that for any matroid the sequence of the number of independent sets of given sizes is ultra log-concave. To do this, we introduce a class of polynomials,…

Combinatorics · Mathematics 2018-11-06 Nima Anari , Kuikui Liu , Shayan Oveis Gharan , Cynthia Vinzant

The two operations, deletion and contraction of an edge, on multigraphs directly lead to the Tutte polynomial which satisfies a universal problem. As observed by Brylawski in terms of order relations, these operations may be interpreted as…

Discrete Mathematics · Computer Science 2013-03-08 Laurent Poinsot

The Tutte equations are ported (or set-pointed) when the equations F(N) = g_e F(N/e) + r_e F(N\e) are omitted for elements e in a distinguished set called ports. Solutions F can distinguish different orientations of the same matroid. A…

Combinatorics · Mathematics 2007-05-23 Seth Chaiken

The classical volume polynomial in algebraic geometry measures the degrees of ample (and nef) divisors on a smooth projective variety. We introduce an analogous volume polynomial for matroids, and give a complete combinatorial formula. For…

Combinatorics · Mathematics 2019-08-20 Christopher Eur

We associate a quotient of superspace to any hyperplane arrangement by considering the differential closure of an ideal generated by powers of certain homogeneous linear forms. This quotient is a superspace analogue of the external…

Combinatorics · Mathematics 2024-04-03 Brendon Rhoades , Vasu Tewari , Andy Wilson

A bimatroid is a matroid-like generalization of the collection of regular minors of a matrix. In this article, we use the theory of Lorentzian polynomials to study the logarithmic concavity of natural sequences associated to bimatroids.…

Combinatorics · Mathematics 2025-08-07 Felix Röhrle , Martin Ulirsch

A multivariate polynomial is stable if it is non-vanishing whenever all variables have positive imaginary parts. A matroid has the weak half-plane property (WHPP) if there exists a stable polynomial with support equal to the set of bases of…

Combinatorics · Mathematics 2012-04-18 Petter Brändén , Rafael S. González D'León

In this paper we employ Tutte's theory of bridges to derive a decomposition theorem for binary matroids arising from signed graphs. The proposed decomposition differs from previous decomposition results on matroids that have appeared in the…

Combinatorics · Mathematics 2015-03-17 Konstantinos Papalamprou , Leonidas Pitsoulis