Related papers: Some inequalities for the Tutte polynomial
It has been conjectured that asymptotically almost all matroids are sparse paving, i.e. that $s(n) \sim m(n)$, where $m(n)$ denotes the number of matroids on a fixed groundset of size $n$, and $s(n)$ the number of sparse paving matroids. In…
We consider the Tutte polynomial of three classes of greedoids: those arising from rooted graphs, rooted digraphs and binary matrices. We establish the computational complexity of evaluating each of these polynomials at each fixed rational…
Following the work of Gao and Xie in [2], we state some properties of the inverse Kazhdan-Lusztig polynomial of a matroid. We also give partial answers to a conjecture that states that regular connected matroids are non-degenerate. We link…
Building on a recent joint paper with Sturmfels, here we argue that the combinatorics of matroids is intimately related to the geometry and topology of toric hyperkaehler varieties. We show that just like toric varieties occupy a central…
This article is a survey of matroid theory aimed at algebraic geometers. Matroids are combinatorial abstractions of linear subspaces and hyperplane arrangements. Not all matroids come from linear subspaces; those that do are said to be…
The generalized Lax conjecture asserts that each hyperbolicity cone is a linear slice of the cone of positive semidefinite matrices. Hyperbolic polynomials give rise to a class of (hyperbolic) matroids which properly contains the class of…
The number of homomorphisms from a finite graph $F$ to the complete graph $K_n$ is the evaluation of the chromatic polynomial of $F$ at $n$. Suitably scaled, this is the Tutte polynomial evaluation $T(F;1-n,0)$ and an invariant of the cycle…
We discuss a conjecture of Ingleton on excluded minors for base-orderability, and, extending a result he stated, we prove that infinitely many of the matroids that he identified are excluded minors for base-orderability, as well as for the…
Lattice path matroids and bicircular matroids are two well-known classes of transversal matroids. In the seminal work of Bonin and de Mier about structural properties of lattice path matroids, the authors claimed that lattice path matroids…
We show that an adjoint of a loopless matroid is connected if and only if it itself is connected. Our first goal is to study the adjoint of modular matroids. We prove that a modular matroid has only one adjoint (up to isomorphism) which can…
In this paper we investigate the number of integer points lying in dilations of lattice path matroid polytopes. We give a characterization of such points as polygonal paths in the diagram of the lattice path matroid. Furthermore, we prove…
A polynomial f is said to have the half-plane property if there is an open half-plane H, whose boundary contains the origin, such that f is non-zero whenever all the variables are in H. This paper answers several open questions regarding…
Solving a problem of Diestel and Pott, we construct a large class of infinite matroids. These can be used to provide counterexamples against the natural extension of the Well-quasi-ordering-Conjecture to infinite matroids and to show that…
In contrast to matroids, vf-safe delta-matroids have three kinds of minors and are closed under the operations of twist and loop complementation. We show that the delta-matroids representable over GF(4) with respect to the nontrivial…
We primarily investigate the properties of characteristic polynomials of semimatroids. In particular, we provide a combinatorial interpretation of their coefficients, generalizing the Whitney's Broken Circuit Theorem. We also prove that the…
We initiate the study of a type $C_n$ generalization of the lattice path matroids defined by Bonin, de Mier, and Noy. These are delta matroids whose feasible sets are in bijection with lattice paths which are symmetric along the main…
Recently, it was proved by Anari-Oveis Gharan-Vinzant, Anari-Liu-Oveis Gharan-Vinzant and Br\"{a}nd\'{e}n-Huh that, for any matroid $M$, its basis generating polynomial and its independent set generating polynomial are log-concave on the…
The Tate conjecture has two parts: i) Tate classes are linear combination of algebraic classes, ii) semisimplicity of Galois representations (for smooth projective varieties). B. Moonen proved that i) implies ii) in characteristic 0, using…
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…
In 1977, Yu. V. Matiyasevich proposed a formula expressing the chromatic polynomial of an arbitrary graph as a linear combination of flow polynomials of subgraphs of the original graph. In this paper, we prove that this representation is a…