English
Related papers

Related papers: Matroid base polytope decomposition

200 papers

Fix two lattice paths $P$ and $Q$ from $(0,0)$ to $(m,r)$ that use East and North steps with $P $ never going above $Q$. Bonin et al. show that the lattice paths that go from $(0,0)$ to $(m,r)$ and remain bounded by $P$ and $Q$ can be…

Combinatorics · Mathematics 2012-12-27 Hoda Bidkhori

Let $M$ be a volume finite non-compact complete hyperbolic $n$-manifold with totally geodesic boundary. We show that there exists a polyhedral decomposition of $M$ such that each cell is either an ideal polyhedron or a partially truncated…

Geometric Topology · Mathematics 2024-09-16 Ge Huabin , Jia Longsong , Zhang Faze

We prove that if $M$ is a CW-complex and $*$ is a 0-cell of $M$, then the crossed module $\Pi_2(M,M^1,*)$ does not depend on the cellular decomposition of $M$ up to free products with $\Pi_2(D^2,S^1,*)$, where $M^1$ is the 1-skeleton of…

Geometric Topology · Mathematics 2016-08-16 João Faria Martins

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 tackle the problem of a combinatorial classification of finite metric spaces via their fundamental polytopes, as suggested by Vershik in 2010. In this paper we consider a hyperplane arrangement associated to every split pseudometric and,…

Combinatorics · Mathematics 2022-03-28 Emanuele Delucchi , Linard Hoessly

In this paper we present an explicit combinatorial description of a special class of facets of the secondary polytopes of hypersimplices. These facets correspond to polytopal subdivisions called multi-splits. We show a relation between the…

Combinatorics · Mathematics 2019-10-10 Benjamin Schröter

If V(R) is the vertex set of a symmetric cycle R in the tope graph of a simple oriented matroid M, then for any tope T of M there exists a unique inclusion-minimal subset Q(T,R) of V(R) such that T is the sum of the topes of Q(T,R). If for…

Combinatorics · Mathematics 2017-03-30 Andrey O. Matveev

A complete set of N+1 mutually unbiased bases (MUBs) forms a convex polytope in the N^2-1 dimensional space of NxN Hermitian matrices of unit trace. As a geometrical object such a polytope exists for all values of N, while it is unknown…

Quantum Physics · Physics 2007-05-23 Ingemar Bengtsson , Asa Ericsson

Cutting a polytope is a very natural way to produce new classes of interesting polytopes. Moreover, it has been very enlightening to explore which algebraic and combinatorial properties of the orignial polytope are hereditary to its…

Combinatorics · Mathematics 2014-02-18 Takayuki Hibi , Nan Li

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

We use the Strong Splitter Theorem to decompose the excluded minor class of binary matroids with no $E_4$-minor. Using this theorem we can get the 3-decomposers and the extremal internally 4-connected matroids as well as any other important…

Combinatorics · Mathematics 2014-08-12 S. R. Kingan

The family of 2-level matroids, that is, matroids whose base polytope is 2-level, has been recently studied and characterized by means of combinatorial properties. 2-level matroids generalize series-parallel graphs, which have been already…

Combinatorics · Mathematics 2015-10-15 Francesco Grande , Juanjo Rué

For a lattice polytope $P$, the rank of $P$ is defined by $F-(\dim P+1)$, where $F$ is the number of facets of $P$. In this paper, we study matroid polytopes with small rank. More precisely, we characterize matroid independence polytopes…

Combinatorics · Mathematics 2025-03-31 Masato Konoike , Koji Matsushita

A matroid base polytope is a polytope in which each vertex has 0,1 coordinates and each edge is parallel to a difference of two coordinate vectors. Matroid base polytopes are described combinatorially by integral submodular functions on a…

Combinatorics · Mathematics 2025-11-19 Jonah Berggren , Jeremy L. Martin , José A. Samper

Let $M$ be a 3-connected matroid, and let $N$ be a 3-connected minor of $M$. We say that a pair $\{x_1,x_2\} \subseteq E(M)$ is $N$-detachable if one of the matroids $M/x_1/x_2$ or $M \backslash x_1 \backslash x_2$ is both 3-connected and…

Combinatorics · Mathematics 2020-02-25 Nick Brettell , Geoff Whittle , Alan Williams

Generalizing a theorem of the first two authors and Geelen for planes, we show that, for a real-representable matroid $M$, either the average hyperplane-size in $M$ is at most a constant depending only on its rank, or each hyperplane of $M$…

Combinatorics · Mathematics 2025-09-03 Rutger Campbell , Matthew E. Kroeker , Ben Lund

A planar set $P$ is said to be cover-decomposable if there is a constant $k=k(P)$ such that every $k$-fold covering of the plane with translates of $P$ can be decomposed into two coverings. It is known that open convex polygons are…

Metric Geometry · Mathematics 2014-03-12 István Kovács , Géza Tóth

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

Given an $\Bbb{F}$-represented matroid $(M,\rho)$ with the ground set $[m]$, the representation $\rho$ naturally defines a hyperplane arrangement $\mathcal{A}_\rho$. We will study its parallel translates $\mathcal{A}_{\rho,{g}}$ of…

Combinatorics · Mathematics 2020-10-15 Beifang Chen , Houshan Fu , Suijie Wang

Our splitter theorem for internally 4-connected binary matroids studies pairs of the form (M,N), where N and M are internally 4-connected binary matroids, M has a proper N-minor, and if M' is an internally 4-connected matroid such that M…

Combinatorics · Mathematics 2016-07-13 Carolyn Chun , Dillon Mayhew , James Oxley