English
Related papers

Related papers: Matroid polytopes and their volumes

200 papers

Partial permutohedra are lattice polytopes which were recently introduced and studied by Heuer and Striker. For positive integers $m$ and $n$, the partial permutohedron $\mathcal{P}(m,n)$ is the convex hull of all vectors in…

Luis Ferroni and Alex Fink recently introduced a polytope of all unlabeled matroids of rank $r$ on $n$ elements, and they showed that the vertices of this polytope come from matroids that can be characterized by maximizing a sequence of…

Combinatorics · Mathematics 2025-12-23 Joseph E. Bonin

It is possible to write the indicator function of any matroid polytope as an integer combination of indicator functions of Schubert matroid polytopes. In this way, every matroid on $n$ elements of rank $r$ can be thought of as a lattice…

Combinatorics · Mathematics 2025-08-14 Luis Ferroni , Alex Fink

Matroid varieties are the closures in the Grassmannian of sets of points defined by specifying which Pl\"ucker coordinates vanish and which don't --- the set of nonvanishing Pl\"ucker coordinates forms a well-studied object called a…

Algebraic Geometry · Mathematics 2015-08-11 Nicolas Ford

We give explicit recursive constructions for the polytope of all matroids $\Omega_{r,n}$ in ranks 2 and 3 for all ground set sizes. This polytope was introduced in recent work by Ferroni and Fink as a tool for checking positivity…

Combinatorics · Mathematics 2026-05-13 Narayan Collins , Victoria Schleis

We give new characterizations for the class of uniformly dense matroids and study applications of these characterizations to graphic and real representable matroids. We show that a matroid is uniformly dense if and only if its base polytope…

Combinatorics · Mathematics 2026-02-03 Karel Devriendt , Raffaella Mulas

Matroids give rise to several natural constructions of polytopes. Inspired by this, we examine polytopes that arise from the signed circuits of an oriented matroid. We give the dimensions of these polytopes arising from graphical oriented…

Combinatorics · Mathematics 2025-01-03 Laura Escobar , Jodi McWhirter

We derive tight expressions for the maximum number of $k$-faces, $0\le{}k\le{}d-1$, of the Minkowski sum, $P_1+...+P_r$, of $r$ convex $d$-polytopes $P_1,...,P_r$ in $\mathbb{R}^d$, where $d\ge{}2$ and $r<d$, as a (recursively defined)…

Computational Geometry · Computer Science 2015-03-03 Menelaos I. Karavelas , Eleni Tzanaki

The degree of a lattice polytope is a notion in Ehrhart theory that was studied quite intensively over the previous years. It is well-known that a lattice polytope has normalized volume one if and only if its degree is zero. Recently,…

Combinatorics · Mathematics 2017-08-11 Benjamin Nill

Vertigan has shown that if $M$ is a binary matroid, then $|T_M(-\iota,\iota)|$, the modulus of the Tutte polynomial of $M$ as evaluated in $(-\iota, \iota)$, can be expressed in terms of the bicycle dimension of $M$. In this paper, we…

Combinatorics · Mathematics 2013-03-28 Rudi Pendavingh

In this paper, we consider the cohomology rings of some multiple weight varieties of type A, that is, symplectic torus quotients for a direct product of several coadjoint orbits of the special unitary group. Under some specific assumptions,…

Symplectic Geometry · Mathematics 2025-11-26 Tatsuru Takakura , Yuichiro Yamazaki

Let $P$ be a polytope. The hitting number of $P$ is the smallest size of a hitting set of the facets of $P$, i.e., a subset of vertices of $P$ such that every facet of $P$ has a vertex in the subset. An extended formulation of $P$ is the…

Combinatorics · Mathematics 2021-06-24 Manuel Aprile

We decompose the indicator function of each $(a, b)$-Catalan matroid polytope as a weighted sum of indicator function of matroid polytopes that correspond to direct sums of uniform matroids. Catalan matroids lie in the interior of the…

Combinatorics · Mathematics 2025-10-10 Yiming Chen , Yao Li , Ming Yao

It has been shown by Soprunov that the normalized mixed volume (minus one) of an $n$-tuple of $n$-dimensional lattice polytopes is a lower bound for the number of interior lattice points in the Minkowski sum of the polytopes. He defined…

Combinatorics · Mathematics 2020-02-27 Gabriele Balletti , Christopher Borger

For a convex lattice polytope $P\subset \mathbb R^d$ of dimension $d$ with vertices in $\mathbb Z^d$, denote by $L(P)$ its discrete volume which is defined as the number of integer points inside $P$. The classical result due to Ehrhart says…

Metric Geometry · Mathematics 2021-07-15 Mariia Dospolova

Let G be a torus of dimension n > 1 and M a compact Hamiltonian G-manifold with $M^G$ finite. A circle, $S^1$, in G is generic if $M^G = M^{S^1}$. For such a circle the moment map associated with its action on M is a perfect Morse function.…

Symplectic Geometry · Mathematics 2007-05-23 Victor Guillemin , Catalin Zara

We apply a theorem of Gel'fand, Goresky, MacPherson, and Serganova about matroid polytopes to study semistability of partial flags relative to a T-linearized ample line bundle of a flag space F = SL(n)/P where T is a maximal torus in SL(n)…

Algebraic Geometry · Mathematics 2007-05-23 Benjamin J. Howard

Let $f = (f_1,\ldots,f_m) : \R^n \longrightarrow \R^m$ be a polynomial map; $G^f(r) = \{x\in\R^n : |f_i(x)| \leq r,\ i =1,\ldots, m\}$. We show that if $f$ satisfies the Mikhailov - Gindikin condition then \begin{itemize} \item[(i)]…

Algebraic Geometry · Mathematics 2015-02-24 Ha Huy Vui , Tran Gia Loc

We give a cohomological and geometrical interpretation for the weighted Ehrhart theory of a full-dimensional lattice polytope $P$, with Laurent polynomial weights of geometric origin. For this purpose, we calculate the motivic Chern and…

Algebraic Geometry · Mathematics 2024-05-08 Laurentiu Maxim , Jörg Schürmann

For a d-dimensional convex lattice polytope P, a formula for the boundary volume is derived in terms of the number of boundary lattice points on the first $\floor{d/2}$ dilations of P. As an application we give a necessary and sufficient…

Combinatorics · Mathematics 2012-12-21 Gábor Hegedüs , Alexander M. Kasprzyk