English
Related papers

Related papers: Matroids and log-concavity

200 papers

We give a general multiplication-convolution identity for the multivariate and bivariate rank generating polynomial of a matroid. The bivariate rank generating polynomial is transformable to and from the Tutte polynomial by simple algebraic…

Combinatorics · Mathematics 2009-09-15 Joseph P. S. Kung

A combinatorial neural code $\mathscr C\subseteq 2^{[n]}$ is convex if it arises as the intersection pattern of convex open subsets of $\mathbb R^d$. We relate the emerging theory of convex neural codes to the established theory of oriented…

Combinatorics · Mathematics 2026-03-12 Alexander Kunin , Caitlin Lienkaemper , Zvi Rosen

We study semigroup algebras associated to lattice polytopes. We begin by generalizing and refining work of Hochster, and describe the volume maps of these algebras, that is, their fundamental classes, in terms of Parseval-Rayleigh…

Combinatorics · Mathematics 2025-09-18 Karim Alexander Adiprasito , Stavros Argyrios Papadakis , Vasiliki Petrotou

We consider the set $\mathcal{M}_n(\mathbb Z; H)$ of $n\times n$-matrices with integer elements of size at most $H$ and obtain a new upper bound on the number of matrices from $\mathcal{M}_n(\mathbb Z; H)$ with a given characteristic…

Number Theory · Mathematics 2024-09-05 Philipp Habegger , Alina Ostafe , Igor E. Shparlinski

It is proved that the roots of combinations of matrix polynomials with real roots can be recast as eigenvalues of combinations of real symmetric matrices, under certain hypotheses. The proof is based on recent solution of the Lax…

Optimization and Control · Mathematics 2007-05-23 Leonid Gurvits , Leiba Rodman

Inspired by the theory of hyperbolic polynomials and Hodge theory, we develop the theory of Lorentzian polynomials on cones. This notion captures the Hodge-Riemann relations of degree zero and one. Motivated by fundamental properties of…

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

A proof for a conjecture by Shadrin and Zvonkine, relating the entries of a matrix arising in the study of Hurwitz numbers to a certain sequence of rational numbers, is given. The main tools used are iteration matrices of formal power…

Combinatorics · Mathematics 2011-11-10 Matthias Aschenbrenner

We give a criterion for modular extension of rank-4 hypermodular matroids, and prove a weakening of Kantor's conjecture for rank-4 realizable matroids. This proves the sticky matroid conjecture and Kantor's conjecture for realizable…

Combinatorics · Mathematics 2021-01-20 Jaeho Shin

We formulate conditions on a set of log-concave sequences, under which any linear combination of those sequences is log-concave, and further, of conditions under which linear combinations of log-concave sequences that have been transformed…

Combinatorics · Mathematics 2014-07-24 Jonathan L. Gross , Toufik Mansour , Thomas W. Tucker , David G. L. Wang

We introduce the antipodal pairs property for probability measures on finite Boolean algebras and prove that conditional versions imply strong forms of log-concavity. We give several applications of this fact, including improvements of some…

Combinatorics · Mathematics 2009-07-03 Jeff Kahn , Michael Neiman

In the present paper, we provide a cohomology group as a categorification of the characteristic polynomial of matroids. The construction depends on the ``quasi-representation'' of a matroid. For a certain choice of the quasi-representation,…

Combinatorics · Mathematics 2024-09-05 Takuya Saito , So Yamagata

We show that the coefficients of the characteristic polynomial of a central hyperplane arrangement $\mathcal A$, coincide with the multidegrees of the Gauss map of a pencil of hypersurfaces naturally associated to $\mathcal A$. As a…

Algebraic Geometry · Mathematics 2025-06-05 Thiago Fassarella , Nivaldo Medeiros

We introduce the notion of interlacing log-concavity of a polynomial sequence $\{P_m(x)\}_{m\geq 0}$, where $P_m(x)$ is a polynomial of degree m with positive coefficients $a_{i}(m)$. This sequence of polynomials is said to be interlacing…

Combinatorics · Mathematics 2010-08-03 William Y. C. Chen , Larry X. W. Wang , Ernest X. W. Xia

In this paper, we use the analytic method of Odlyzko and Richmond to study the log-concavity of power series. If $f(z) = \sum_n a_nz^n$ is an infinite series with $a_n \geq 1$ and $a_0 + \cdots + a_n = O(n + 1)$ for all $n$, we prove that a…

Combinatorics · Mathematics 2022-08-23 Shengtong Zhang

We formulate and prove a log-algebraicity theorem for arbitrary rank Drinfeld modules defined over the polynomial ring F_q[theta]. This generalizes results of Anderson for the rank one case. As an application we show that certain special…

Number Theory · Mathematics 2020-07-09 Chieh-Yu Chang , Ahmad El-Guindy , Matthew A. Papanikolas

For any graph, we show that the graded permutation representation of the graph automorphism group given by matchings is strongly equivariantly log-concave. The proof gives a family of equivariant injections inspired by a combinatorial map…

Combinatorics · Mathematics 2026-04-08 Shiyue Li

In 1977 Stanley proved that the $h$-vector of a matroid is an $\mathcal{O}$-sequence and conjectured that it is a pure $\mathcal{O}$-sequence. In the subsequent years the validity of this conjecture has been shown for a variety of classes…

Combinatorics · Mathematics 2017-06-20 Aaron Dall

We prove the positivity of Kazhdan-Lusztig polynomials for sparse paving matroids, which are known to be logarithmically almost all matroids, but are conjectured to be almost all matroids. The positivity follows from a remarkably simple…

Combinatorics · Mathematics 2020-06-19 Kyungyong Lee , George D. Nasr , Jamie Radcliffe

The set of f-vectors of pure simplicial complexes is an important but little understood object in combinatorics and combinatorial commutative algebra. Unfortunately, its explicit characterization appears to be a virtually intractable…

Combinatorics · Mathematics 2015-01-06 Adrian Pastine , Fabrizio Zanello

We prove that if a pure simplicial complex of dimension d with n facets has the least possible number of (d-1)-dimensional faces among all complexes with n faces of dimension d, then it is vertex decomposable. This answers a question of J.…

Combinatorics · Mathematics 2013-02-19 Michał Lasoń