English
Related papers

Related papers: Extended Formulations for Polytopes of Regular Mat…

200 papers

De Loera et al. 2009, showed that when the rank is fixed the Ehrhart polynomial of a matroid polytope can be computed in polynomial time when the number of elements varies. A key to proving this is the fact that the number of simplicial…

Combinatorics · Mathematics 2011-09-22 David C. Haws

A phased matroid is a matroid with additional structure which plays the same role for complex vector arrangements that oriented matroids play for real vector arrangements. The realization space of an oriented (resp., phased) matroid is the…

Combinatorics · Mathematics 2018-07-20 Amanda Ruiz

We call a class $\mathcal{M}$ of matroids hereditary if it is closed under flats. We denote by $\mathcal{M}^{ext}$ the class of matroids $M$ that is in $\mathcal{M}$, or has an element $e$ such that $M \backslash e$ is in $\mathcal{M}$. We…

Combinatorics · Mathematics 2024-11-21 Jagdeep Singh , Vaidy Sivaraman

Polymatroids can be considered as "fractional matroid" where the rank function is not required to be integer valued. Many, but not every notion in matroid terminology translates naturally to polymatroids. Defining cyclic flats of a…

Combinatorics · Mathematics 2019-10-15 Laszlo Csirmaz

We consider three forms of composition of matroids, each of which extends the category of bimatroids to a rigid monoidal category. Many well-known constructions are functorial or defined by morphisms in these categories. Motivating examples…

Combinatorics · Mathematics 2024-03-07 Kevin Purbhoo

We define a generic rigidity matroid for $k$-volumes of a simplicial complex in $\mathbb{R}^d$, and prove that for $2\leq k \leq d-1$ it has the same rank as the classical generic $d$-rigidity matroid on the same vertex set (namely, the…

Combinatorics · Mathematics 2025-03-04 Alan Lew , Eran Nevo , Yuval Peled , Orit E. Raz

We prove a complex polynomial plank covering theorem for not necessarily homogeneous polynomials. As the consequence of this result, we extend the complex plank theorem of Ball to the case of planks that are not necessarily centrally…

Metric Geometry · Mathematics 2024-05-28 Alexey Glazyrin , Roman Karasev , Alexandr Polyanskii

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…

Combinatorics · Mathematics 2024-08-07 Joseph E. Bonin , Thomas J. Savitsky

We study a generalization of tropical oriented matroids by Ardila and Develin, and show that they are in bijection with subdivisions of root polytopes, which are sub-polytopes of a product of two simplices.

Combinatorics · Mathematics 2026-03-10 Yuan Yao , Chenyi Zhang

We show that there are simple 4-dimensional polytopes with n vertices such that all separators of the graph have size at least $\Omega(n/\log n)$. This establishes a strong form of a claim by Thurston, for which the construction and proof…

Metric Geometry · Mathematics 2017-08-23 Lauri Loiskekoski , Günter M. Ziegler

Let a sequence $(P_n)$ of polynomials in one complex variable satisfy a recurre ce relation with length growing slowlier than linearly. It is shown that $(P_n) $ is an orthonormal basis in $L^2_{\mu}$ for some measure $\mu$ on $\C$, if and…

Functional Analysis · Mathematics 2007-05-23 D. P. L. Castrigiano , W. Klopfer

The $OS$ algebra $A$ of a matroid $M$ is a graded algebra related to the Whitney homology of the lattice of flats of $M$. In case $M$ is the underlying matroid of a hyperplane arrangement \A in $\C^r$, $A$ is isomorphic to the cohomology…

Combinatorics · Mathematics 2007-05-23 Carrie Eschenbrenner , Michael Falk

We conduct a systematic study of the Ehrhart theory of certain slices of rectangular prisms. Our polytopes are generalizations of the hypersimplex and are contained in the larger class of polypositroids introduced by Lam and Postnikov;…

Combinatorics · Mathematics 2025-04-30 Luis Ferroni , Daniel McGinnis

This article studies a large, general class of orthogonal polytopes which we may call "generic orthotopes". These objects emerged from a desire to represent a Coxeter complex by an orthogonal polytope that is particularly nice with respect…

Combinatorics · Mathematics 2022-10-24 David Richter

The determinantal complexity of a polynomial $P \in \mathbb{F}[x_1, \ldots, x_n]$ over a field $\mathbb{F}$ is the dimension of the smallest matrix $M$ whose entries are affine functions in $\mathbb{F}[x_1, \ldots, x_n]$ such that $P =…

Computational Complexity · Computer Science 2021-12-03 Mrinal Kumar , Ben Lee Volk

A matrix $C$ has the Monge property if $c_{ij} + c_{IJ} \leq c_{Ij} + c_{iJ}$ for all $i < I$ and $j < J$. Monge matrices play an important role in combinatorial optimization; for example, when the transportation problem (resp., the…

Combinatorics · Mathematics 2023-11-15 William Q. Erickson , Jan Kretschmann

A simple binary matroid is called claw-free if none of its rank-3 flats are independent sets. These objects can be equivalently defined as the sets $E$ of points in $\mathrm{PG}(n-1,2)$ for which $|E \cap P|$ is not a basis of $P$ for any…

Combinatorics · Mathematics 2018-08-01 Peter Nelson , Kazuhiro Nomoto

For a set of matroids $\mathcal{M}$, let $ex_\mathcal{M}(n)$ be the maximum size of a simple rank-$n$ matroid in $\mathcal{M}$. We prove that, for any finite field $\mathbb{F}$, if $\mathcal{M}$ is a minor-closed class of…

Combinatorics · Mathematics 2016-01-26 Rohan Kapadia

We show that the amoeba of a complex algebraic variety defined as the solutions to a generic system of $n$ polynomials in $n$ variables has a finite basis. In other words, it is the intersection of finitely many hypersurface amoebas.…

Algebraic Geometry · Mathematics 2014-04-15 Mounir Nisse

We generalize the (signed) Varchenko matrix of a hyperplane arrangement to complexes of oriented matroids and show that its determinant has a nice factorization. This extends previous results on hyperplane arrangements and oriented…

Combinatorics · Mathematics 2025-01-17 Winfried Hochstättler , Sophia Keip , Kolja Knauer