English
Related papers

Related papers: On the Ehrhart Polynomial of Minimal Matroids

200 papers

The strong spectral order induces a natural partial ordering on the manifold $H_{n}$ of monic hyperbolic polynomials of degree $n$. We prove that twisted root maps associated with linear operators acting on $H_{n}$ are G\aa rding convex on…

Classical Analysis and ODEs · Mathematics 2008-07-28 Julius Borcea

Configuration polynomials generalize the classical Kirchhoff polynomial defined by a graph. Their study sheds light on certain polynomials appearing in Feynman integrands. Contact equivalence provides a way to study the associated…

Algebraic Geometry · Mathematics 2022-11-08 Graham Denham , Delphine Pol , Mathias Schulze , Uli Walther

We define the root polytope of a regular oriented matroid, and show that the greedoid polynomial of an Eulerian branching greedoid rooted at vertex $v_0$ is equivalent to the $h^*$-polynomial of the root polytope of the dual of the graphic…

Combinatorics · Mathematics 2024-04-12 Lilla Tóthmérész

A positroid is the matroid of a matrix whose maximal minors are all nonnegative. Given a permutation $w$ in $S_n$, the matroid of a generic $n \times n$ matrix whose non-zero entries in row $i$ lie in columns $w(i)$ through $n+i$ is an…

Combinatorics · Mathematics 2018-07-25 Brendan Pawlowski

There is a well-established dictionary between zonotopes, hyperplane arrangements, and their (oriented) matroids. Arguably one of the most famous examples is the class of graphical zonotopes, also called acyclotopes, which encode…

Combinatorics · Mathematics 2024-09-24 Eleonore Bach , Matthias Beck , Sophie Rehberg

In 1963, Halin and Jung proved that every simple graph with minimum degree at least four has $K_5$ or $K_{2,2,2}$ as a minor. Mills and Turner proved an analog of this theorem by showing that every $3$-connected binary matroid in which…

Combinatorics · Mathematics 2025-07-15 Matthew Mizell , James Oxley

Neighborly polytopes are those that maximize the number of faces in each dimension among all polytopes with the same number of vertices. Despite their extremal properties they form a surprisingly rich class of polytopes, which has been…

Combinatorics · Mathematics 2015-01-30 Hiroyuki Miyata , Arnau Padrol

For a matroid $M$ having $m$ rank-one flats, the density $d(M)$ is $\tfrac{m}{r(M)}$ unless $m = 0$, in which case $d(M)= 0$. A matroid is density-critical if all of its proper minors of non-zero rank have lower density. By a 1965 theorem…

Combinatorics · Mathematics 2020-06-02 Rutger Campbell , Kevin Grace , James Oxley , Geoff Whittle

The magic positivity of Ehrhart polynomials is a useful tool for proving the real-rootedness of the $h^\ast$-polynomials. In this paper, we provide a new class of reflexive polytopes whose Ehrhart polynomials are magic positive. First, we…

Combinatorics · Mathematics 2025-07-03 Masato Konoike

For a matroid $M$ of rank $r$ on $n$ elements, let $b(M)$ denote the fraction of bases of $M$ among the subsets of the ground set with cardinality $r$. We show that $$\Omega(1/n)\leq 1-b(M)\leq O(\log(n)^3/n)\text{ as }n\rightarrow \infty$$…

Combinatorics · Mathematics 2016-10-24 Rudi Pendavingh , Jorn van der Pol

We present a formula which relates the Kazhdan-Lusztig polynomial of a matroid $M$, as defined by Elias, Proudfoot and Wakefield, to the Kazhdan--Lusztig polynomials of the matroid obtained by deleting an element, and various contractions…

Combinatorics · Mathematics 2023-06-13 Tom Braden , Artem Vysogorets

The $\mathit{growth\ rate\ function}$ for a nonempty minor-closed class of matroids $\mathcal{M}$ is the function $h_{\mathcal{M}}(n)$ whose value at an integer $n \ge 0$ is defined to be the maximum number of elements in a simple matroid…

Combinatorics · Mathematics 2014-10-29 Jim Geelen , Peter Nelson

This is a continuation of the early paper concerning matroid base polytope decomposition. Here, we will present sufficient conditions on $M$ so its base matroid polytope $P(M)$ has a {\em sequence} of hyperplane splits. The latter yields to…

Combinatorics · Mathematics 2013-11-28 Vanessa Chatelain , Jorge Ramirez Alfonsin

A set function can be extended to the unit cube in various ways; the correlation gap measures the ratio between two natural extensions. This quantity has been identified as the performance guarantee in a range of approximation algorithms…

Optimization and Control · Mathematics 2024-06-24 Edin Husić , Zhuan Khye Koh , Georg Loho , László A. Végh

We associate to every matroid M a polynomial with integer coefficients, which we call the Kazhdan-Lusztig polynomial of M, in analogy with Kazhdan-Lusztig polynomials in representation theory. We conjecture that the coefficients are always…

Combinatorics · Mathematics 2016-07-04 Ben Elias , Nicholas Proudfoot , Max Wakefield

A hyperplane arrangement is said to satisfy the ``Riemann hypothesis'' if all roots of its characteristic polynomial have the same real part. This property was conjectured by Postnikov and Stanley for certain families of arrangements which…

Combinatorics · Mathematics 2016-09-07 Christos A. Athanasiadis

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

Let G be a finite connected graph. The Kirchhoff polynomial of G is a certain homogeneous polynomial whose degree is equal to the first betti number of G. These polynomials appear in the study of electrical circuits and in the evaluation of…

Algebraic Geometry · Mathematics 2007-05-23 Prakash Belkale , Patrick Brosnan

Let $M$ be an arbitrary matroid with circuits $\mathcal{C}(M)$. We propose a definition of a derived matroid $\delta M$ that has as its ground set $\mathcal{C}(M)$. Unlike previous attempts of such a definition, our definition applies to…

Combinatorics · Mathematics 2022-12-22 Olga Kuznetsova , Ragnar Freij-Hollanti , Relinde Jurrius

Let $\mathcal B=\mathcal B_{k,n,p}$ be a random collection of $k$-subsets of $[n]$ where each possible set is present independently with probability $p$. Let $\cal E_{\mathcal B}$ be the event that $\mathcal B$ defines the set of bases of a…

Combinatorics · Mathematics 2026-05-11 Patrick Bennett , Alan Frieze