English
Related papers

Related papers: The Merino--Welsh conjecture is false for matroids

200 papers

The Merino-Welsh conjecture states that for a graph $G$ without loops and bridges the Tutte polynomial $T_G(x,y)$ satisfies the inequality $$\max(T_G(2,0),T_G(0,2))\geqslant T_G(1,1).$$ Later Jackson proved that for any matroid $M$ without…

Combinatorics · Mathematics 2026-02-20 Péter Csikvári

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

In 1999 Merino and Welsh conjectured that evaluations of the Tutte polynomial of a graph satisfy an inequality. In this short article we show that the conjecture generalized to matroids holds for the large class of all split matroids by…

Combinatorics · Mathematics 2023-09-11 Luis Ferroni , Benjamin Schröter

Let $M$ be a matroid without loops or coloops and let $T(M;x,y)$ be its Tutte polynomial. In 1999 Merino and Welsh conjectured that $$\max(T(M;2,0), T(M;0,2))\geq T(M;1,1)$$ holds for graphic matroids. Ten years later, Conde and Merino…

Combinatorics · Mathematics 2016-10-28 Kolja Knauer , Leonardo Martínez-Sandoval , Jorge Luis Ramírez Alfonsín

We prove that the Tutte polynomial of a coloopless paving matroid is convex along the portions of the line segments x+y=p lying in the positive quadrant. Every coloopless paving matroids is in the class of matroids which contain two…

Combinatorics · Mathematics 2010-04-16 L. E. Chavez-Lomelí , C. Merino , S. D. Noble , M. Ramírez-Ibañez

We study algebraic properties of the Tutte polynomial of a matroid and its generalizations to other combinatorially defined bivariate polynomial invariants. Merino, de Mier and Noy showed that the Tutte polynomial of a connected matroid is…

Combinatorics · Mathematics 2025-10-08 Andrew Goodall , Florent Jouve , Jean-Sébastien Sereni

We present counterexamples to a 30-year-old conjecture of Las Vergnas [J. Combin. Theory Ser. B, 1988] regarding the Tutte polynomial of binary matroids.

Combinatorics · Mathematics 2018-09-05 Robert Brijder , Hendrik Jan Hoogeboom

The multivariate arithmetic Tutte polynomial of arithmetic matroids is a generalization of the multivariate Tutte polynomial of matroids. In this note, we give the convolution formulas for the multivariate arithmetic Tutte polynomial of the…

Combinatorics · Mathematics 2023-10-10 Tianlong Ma , Xian'an Jin , Weiling Yang

We consider a specialization $Y_M(q,t)$ of the Tutte polynomial of a matroid $M$ which is inspired by analogy with the Potts model from statistical mechanics. The only information lost in this specialization is the number of loops of $M$.…

Combinatorics · Mathematics 2016-09-07 David G. Wagner

Lop\'ez de Medrano-Rin\'con-Shaw defined Chern-Schwartz-MacPherson cycles for an arbitrary matroid $M$ and proved by an inductive geometric argument that the unsigned degrees of these cycles agree with the coefficients of $T(M;x,0)$, where…

Combinatorics · Mathematics 2022-07-21 Ahmed Umer Ashraf , Spencer Backman

We give a convolution formula for the Tutte polynomial T_M (x,y) of a matroid M.

Combinatorics · Mathematics 2007-05-23 W. Kook , V. Reiner , Dennis Stanton

White's conjecture predicts quadratic generators for the ideal of any matroid base polytope. We prove that White's conjecture for any matroid $M$ implies it also for any matroid $M'$, where $M$ and $M'$ differ by one basis. Our study is…

Combinatorics · Mathematics 2025-01-30 Kangjin Han , Mateusz Michałek , Julian Weigert

Vaught's Conjecture states that if $T$ is a complete first order theory in a countable language that has more than $\aleph_0$ pairwise non-isomorphic countably infinite models, then $T$ has $2^{\aleph_0}$ such models. Morley showed that if…

Logic · Mathematics 2018-11-21 M. Assem , T. S. Ahmed , G. Sági , D. Sziráki

Vertigan has shown that if $M$ is a binary matroid, then $|T_M(-\iota,\iota)|$, the modulus of the Tutte polynomial of $M$ as evaluated in $(-\iota, \iota)$, can be expressed in terms of the bicycle dimension of $M$. In this paper, we…

Combinatorics · Mathematics 2013-03-28 Rudi Pendavingh

A 1965 result of Crapo shows that every elementary lift of a matroid $M$ can be constructed from a linear class of circuits of $M$. In a recent paper, Walsh generalized this construction by defining a rank-$k$ lift of a matroid $M$ given a…

Combinatorics · Mathematics 2025-02-19 Daniel Irving Bernstein , Zach Walsh

Recently, several proofs of the Mason--Welsh conjecture for matroids have been found, which asserts the log-concavity of the sequence that counts independent sets of a given size. In this article we use the theory of Lorentzian polynomials,…

Combinatorics · Mathematics 2024-07-09 Jeffrey Giansiracusa , Felipe Rincón , Victoria Schleis , Martin Ulirsch

We provide a full classification of all families of matroids that are closed under duality and minors, and for which the Tutte polynomial is a universal valuative invariant. There are four inclusion-wise maximal families, two of which are…

Combinatorics · Mathematics 2025-02-10 Luis Ferroni , Benjamin Schröter

For any matroid $M$, we compute the Tutte polynomial $T_M(x,y)$ using the mixed intersection numbers of certain classes in the combinatorial Chow ring $A^\bullet(M)$ arising from hypersimplices. Using the mixed Hodge-Riemann relations, we…

Algebraic Geometry · Mathematics 2023-03-27 Andrew Berget , Hunter Spink , Dennis Tseng

The matroid-based valuation conjecture of Ostrovsky and Paes Leme states that all gross substitutes valuations on $n$ items can be produced from merging and endowments of weighted ranks of matroids defined on at most $m(n)$ items. We show…

Combinatorics · Mathematics 2020-05-15 Ngoc Mai Tran

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…

Computational Complexity · Computer Science 2020-07-29 Andreas Björklund , Petteri Kaski
‹ Prev 1 2 3 10 Next ›