English
Related papers

Related papers: The Merino--Welsh conjecture for split matroids

200 papers

In this paper, we introduce the concept of the Tutte polynomials of genus $g$ and discuss some of its properties. We note that the Tutte polynomials of genus one are well-known Tutte polynomials. The Tutte polynomials are matroid…

Combinatorics · Mathematics 2019-08-16 Tsuyoshi Miezaki , Manabu Oura , Tadashi Sakuma , Hidehiro Shinohara

We verify the Rota-Heron-Welsh conjecture for matroids realizable as c-arrangements: the coefficients of the characteristic polynomial of the associated matroid are log-concave. This family of matroids strictly contains that of complex…

Combinatorics · Mathematics 2016-07-01 Karim A. Adiprasito , Raman Sanyal

Let $G$ be a matrix and $M(G)$ be the matroid defined by linear dependence on the set $E$ of column vectors of $G.$ Roughly speaking, a parcel is a subset of pairs $(f,g)$ of functions defined on $E$ to an Abelian group $A$ satisfying a…

Combinatorics · Mathematics 2011-12-06 Joseph P. S. Kung

Split matroids form a minor-closed class of matroids, and are defined by placing conditions on the system of split hyperplanes in the matroid base polytope. They can equivalently be defined in terms of structural properties involving cyclic…

Combinatorics · Mathematics 2021-01-07 Amanda Cameron , Dillon Mayhew

Using a quantum field theory renormalization group-like differential equation, we give a new proof of the recipe theorem for the Tutte polynomial for matroids. The solution of such an equation is in fact given by some appropriate characters…

Combinatorics · Mathematics 2013-08-20 Gérard H. E. Duchamp , Nguyen Hoang-Nghia , Thomas Krajewski , Adrian Tanasa

The Tutte polynomial is an important invariant of graphs and matroids. Chen and Guo \emph{[Adv. in Appl. Math. 166 (2025) 102868.]} proved that for a $(k+1)$-edge connected graph $G$ and for any $i$ with $0\leq i <\frac{3(k+1)}{2}$,…

Combinatorics · Mathematics 2025-09-29 Xiaxia Guan , Xian'an Jin , Tianlong Ma , Weihua Yang

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…

Combinatorics · Mathematics 2024-08-07 Joseph E. Bonin

We use the geometry of the stellahedral toric variety to study matroids. We identify the valuative group of matroids with the cohomology ring of the stellahedral toric variety, and show that valuative, homological, and numerical equivalence…

Algebraic Geometry · Mathematics 2023-09-08 Christopher Eur , June Huh , Matt Larson

We introduce a notion of duality (due to Brylawski) that generalizes matroid duality to arbitrary rank functions. This generalized duality allows for generalized operations (deletion and contraction) and a generalized polynomial based on…

Combinatorics · Mathematics 2012-01-10 Gary Gordon

We introduce the notion of a matroid M over a commutative ring R, assigning to every subset of the ground set an R-module according to some axioms. When R is a field, we recover matroids. When R=$\mathbb{Z}$, and when R is a DVR, we get…

Combinatorics · Mathematics 2019-11-19 Alex Fink , Luca Moci

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

Cyclic flats form a common structural invariant of both matroids and $q$-matroids, determining these objects through their weighted lattices of cyclic flats. In this paper we exploit this perspective to establish a correspondence between…

Combinatorics · Mathematics 2026-03-17 Andrew Fulcher

The classical matrix tree theorem relates the number of spanning trees of a connected graph with the product of the nonzero eigenvalues of its Laplacian matrix. The class of regular matroids generalizes that of graphical matroids, and a…

Combinatorics · Mathematics 2014-05-12 Aaron Dall , Julian Pfeifle

We prove that if $ M $ and $ N $ are finitary matroids on a common countable edge set $ E $ then they admit a common independent set $I $ such that there is a bipartition $ E=E_{M}\cup E_{N} $ for which $ I\cap E_M $ spans $ E_M $ in $ M $…

Combinatorics · Mathematics 2021-04-06 Attila Joó

Brylawski proved the coefficients of the Tutte polynomial of a matroid satisfy a set of linear relations. We extend these relations to a generalization of the Tutte polynomial that includes greedoids and antimatroids. This leads to families…

Combinatorics · Mathematics 2014-05-16 Gary Gordon

The Tutte polynomial is a fundamental invariant associated to a graph, matroid, vector arrangement, or hyperplane arrangement. This short survey focuses on some of the most important results on Tutte polynomials of hyperplane arrangements.…

Combinatorics · Mathematics 2017-10-05 Federico Ardila

We give a short proof of the log-concavity of the coefficients of the reduced characteristic polynomial of a matroid. The proof uses an extension of the theory of Lorentzian polynomials to convex cones, and reproves the Hodge-Riemann…

Combinatorics · Mathematics 2021-10-12 Petter Brändén , Jonathan Leake

We present an algebraic framework which simultaneously generalizes the notion of linear subspaces, matroids, valuated matroids, oriented matroids, and regular matroids. To do this, we first introduce algebraic objects called tracts which…

Combinatorics · Mathematics 2018-12-13 Matthew Baker , Nathan Bowler

We show that the algebraic rank of divisors on certain graphs is related to the realizability problem of matroids. As a consequence, we produce a series of examples in which the algebraic rank depends on the ground field. We use the theory…

Algebraic Geometry · Mathematics 2020-12-16 Yoav Len

We study various binomial and monomial ideals arising in the theory of divisors, orientations, and matroids on graphs. We use ideas from potential theory on graphs and from the theory of Delaunay decompositions for lattices to describe…

Combinatorics · Mathematics 2015-11-24 Fatemeh Mohammadi , Farbod Shokrieh
‹ Prev 1 3 4 5 6 7 10 Next ›