Related papers: Remarks on one combinatorial application of the Al…
A Rayleigh matroid is one which satisfies a set of inequalities analogous to the Rayleigh monotonicity property of linear resistive electrical networks. We show that every matroid of rank three satisfies these inequalities.
Motivated by applications to perverse sheaves, we study combinatorics of two cell decompositions of the symmetric product of the complex line, refining the complex stratification by multiplicities. Contingency matrices, appearing in…
We establish necessary and sufficient conditions for an arbitrary polynomial of degree $n$, especially with only real roots, to be trivial, i.e. to have the form a(x-b)^n. To do this, we derive new properties of polynomials and their roots.…
In this paper we consider images of (ordinary) noncommutative polynomials on matrix algebras endowed with a graded structure. We give necessary and sufficient conditions to verify that some multilinear polynomial is a central polynomial, or…
We explore some inequalities in convex geometry restricted to the class of zonoids. We show the equivalence, in the class of zonoids, between a local Alexandrov-Fenchel inequality, a local Loomis-Whitney inequality, the log-submodularity of…
Kolmogorov's exponential inequalities are basic tools for studying the strong limit theorems such as the classical laws of the iterated logarithm for both independent and dependent random variables. This paper establishes the Kolmogorov…
We introduce a general notion of transport cost that encompasses many costs used in the literature (including the classical one and weak transport costs introduced by Talagrand and Marton in the 90's), and prove a Kantorovich type duality…
Stanley's non-negativity theorem is at the heart of many of the results in Ehrhart theory. In this paper, we analyze the root behavior of general polynomials satisfying the conditions of Stanley's theorem and compare this to the known root…
We give new necessary and sufficient conditions for higher order convex ordering. These results generalize the Levin-Ste\v{c}kin theorem (1960) on convex ordering. The obtained results can be useful in the study of the Hermite-Hadamard type…
A net in $\mathbb{P}^2$ is a configuration of lines $\mathcal A$ and points $X$ satisfying certain incidence properties. Nets appear in a variety of settings, ranging from quasigroups to combinatorial design to classification of Kac-Moody…
Gao and Xie (2021) conjectured that the inverse Kazhdan-Lusztig polynomial of any matroid is log-concave. Although the inverse Kazhdan-Lusztig polynomial may not always have only real roots, we conjecture that the Hadamard product of an…
We use the 2-loop term of the Kontsevich integral to show that there are (many) knots with trivial Alexander polynomial which don't have a Seifert surface whose genus equals the rank of the Seifert form. This is one of the first…
We discuss a matrix of periodic holomorphic functions in the upper and lower half-plane which can be obtained from a factorization of an Andersen-Kashaev state integral of a knot complement with remarkable analytic and asymptotic properties…
An artinian graded algebra, $A$, is said to have the Weak Lefschetz property (WLP) if multiplication by a general linear form has maximal rank in every degree. A vast quantity of work has been done studying and applying this property,…
Let $\mathbb{K}$ be a field and $S=\mathbb{K}[x_1,\dots,x_n]$ be the polynomial ring in $n$ variables over the field $\mathbb{K}$. In this paper, it is shown that Stanley's conjecture holds for $S/I$, if $I$ is a weakly polymatroidal ideal.
A theorem of Kaplansky asserts that a semigroup of matrices with entries from a field whose members all have singleton spectra is triangularizable. Indeed, Kaplansky's Theorem unifies well-known theorems of Kolchin and Levitzki on…
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…
We introduce a powerful connection between Ehrhart theory and additive number theory, and use it to produce infinitely many new classes of inequalities between the coefficients of the $h^*$-polynomial of a lattice polytope. This greatly…
Matrix representations are a powerful tool for designing efficient algorithms for combinatorial optimization problems such as matching, and linear matroid intersection and parity. In this paper, we initiate the study of matrix…
This talk is a report on joint work with A. Vaintrob [arXiv:math.CO/0109104 and math.GT/0111102]. It is organised as follows. We begin by recalling how the classical Matrix-Tree Theorem relates two different expressions for the lowest…