English
Related papers

Related papers: Flag enumerations of matroid base polytopes

200 papers

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

The full root polytope of type $A$ is the convex hull of all pairwise differences of the standard basis vectors which we represent by forward and backward arrows. We completely classify all flag triangulations of this polytope that are…

Combinatorics · Mathematics 2020-03-17 Richard Ehrenborg , Gábor Hetyei , Margaret Readdy

In this article, we investigate the multi-parametric matroid problem. The weights of the elements of the matroid's ground set depend linearly on an arbitrary but fixed number of parameters, each of which is taken from a real interval. The…

Combinatorics · Mathematics 2025-03-13 Nils Hausbrandt , Stefan Ruzika

Gr\"unbaum, Barnette, and Reay in 1974 completed the characterization of the pairs $(f_i,f_j)$ of face numbers of $4$-dimensional polytopes. Here we obtain a complete characterization of the pairs of flag numbers $(f_0,f_{03})$ for…

Metric Geometry · Mathematics 2020-01-28 Hannah Sjöberg , Günter M. Ziegler

We are interested in expanding our understanding of symplectic matroids by exploring the properties of a class of symplectic matroids with a "lattice of flats". Taking a well-behaved family of subdivisions of the cross polytope we obtain a…

Combinatorics · Mathematics 2026-01-08 Or Raz

We study the behavior of $h$-vectors associated to matroid complexes under weak maps, or inclusions of matroid polytopes. Specifically, we show that the $h$-vector of the order complex of the lattice of flats of a matroid is component-wise…

Combinatorics · Mathematics 2023-05-26 Gaku Liu , Alexander Mason

A subset $S$ of $\mathbb R^d$ has the Borsuk property if it can be decomposed into at most $d+1$ parts of diameter smaller than $S$. This is an important geometric property, inspired by a conjecture of Borsuk from the 1930s, which has…

Combinatorics · Mathematics 2025-06-23 Gyivan López-Campos , Frédéric Meunier , Jorge L. Ramírez Alfonsín

Unlike the situation in the classical theory of convex polytopes, there is a wealth of semi-regular abstract polytopes, including interesting examples exhibiting some unexpected phenomena. We prove that even an equifacetted semi-regular…

Combinatorics · Mathematics 2011-09-13 Tomaz Pisanski , Egon Schulte , Asia Ivic Weiss

Starting from any finite simple graph, one can build a reflexive polytope known as a symmetric edge polytope. The first goal of this paper is to show that symmetric edge polytopes are intrinsically matroidal objects: more precisely, we…

Combinatorics · Mathematics 2023-07-12 Alessio D'Alì , Martina Juhnke-Kubitzke , Melissa Koch

We discuss several extension properties of matroids and polymatroids and their application as necessary conditions for the existence of different matroid representations, namely linear, folded linear, algebraic, and entropic…

Combinatorics · Mathematics 2025-02-24 Michael Bamiloshin , Oriol Farràs , Carles Padró

We give two graph theoretical characterizations of tope graphs of (complexes of) oriented matroids. The first is in terms of excluded partial cube minors, the second is that all antipodal subgraphs are gated. A direct consequence is a third…

Combinatorics · Mathematics 2019-05-29 Kolja Knauer , Tilen Marc

Let $G$ be a finite connected simple graph with $d$ vertices and let $\Pc_G \subset \RR^d$ be the edge polytope of $G$. We call $\Pc_G$ \emph{decomposable} if $\Pc_G$ decomposes into integral polytopes $\Pc_{G^+}$ and $\Pc_{G^-}$ via a…

Combinatorics · Mathematics 2012-08-10 Takayuki Hibi , Nan Li , Yan X. Zhang

It is known that there exist hyperplane arrangements with same underlying matroid that admit non-homotopy equivalent complement manifolds. In this work we show that, in any rank, complex central hyperplane arrangements with up to 7…

Combinatorics · Mathematics 2017-01-31 Matteo Gallet , Elia Saini

Characterization of entropy functions is of fundamental importance in information theory. By imposing constraints on their Shannon outer bound, i.e., the polymatroidal region, one obtains the faces of the region and entropy functions on…

Information Theory · Computer Science 2026-02-04 Kaizhe He , Qi Chen

We present an algebraic framework which simultaneously generalizes the notion of linear subspaces, matroids, valuated matroids, oriented matroids, and regular matroids. To do this, we first introduce algebraic objects called tracts which…

Combinatorics · Mathematics 2018-12-13 Matthew Baker , Nathan Bowler

This article gives a new upper bound for the resurgence number of symbolic powers of matroidal configuration in the following situations: the height of the matroidal configuration is big, or the height is small, and the corresponding…

Commutative Algebra · Mathematics 2025-11-18 Haoxi Hu

We characterize the edges of two classes of $0/1$-polytopes. The first class corresponds to the stable set polytope of a graph $G$ and includes chain polytopes of posets, some instances of matroid independence polytopes, as well as…

Combinatorics · Mathematics 2021-10-27 Farid Aliniaeifard , Carolina Benedetti , Nantel Bergeron , Shu Xiao Li , Franco Saliola

An analytical formulation for the band structure and Bloch modes in elliptically birefringent magnetophotonic crystals is presented. The model incorporates both the effects of gyrotropy and linear birefringence generally present in…

Optics · Physics 2009-11-13 Miguel Levy , Amir A Jalali

In this paper, we discuss f- and flag-vectors of 4-dimensional convex polytopes and cellular 3-spheres. We put forward two crucial parameters of fatness and complexity: Fatness F(P) := (f_1+f_2-20)/(f_0+f_3-10) is large if there are many…

Metric Geometry · Mathematics 2007-05-23 Günter M. Ziegler

We design an FPRAS to count the number of bases of any matroid given by an independent set oracle, and to estimate the partition function of the random cluster model of any matroid in the regime where $0<q<1$. Consequently, we can sample…

Data Structures and Algorithms · Computer Science 2019-01-23 Nima Anari , Kuikui Liu , Shayan Oveis Gharan , Cynthia Vinzant
‹ Prev 1 4 5 6 7 8 10 Next ›