English
Related papers

Related papers: Matroid base polytope decomposition II : sequence …

200 papers

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

We study the number of hamiltonian circuits, containing a fixed basis, and the number of hyperplanes, which do not contain a fixed basis in perfect matroid designs. Projective and affine finite geometries are considered as examples of such…

Combinatorics · Mathematics 2013-05-15 Wojciech Kordecki

A notion of branch-width, which generalizes the one known for graphs, can be defined for matroids. We first give a proof of the polynomial time model-checking of monadic second-order formulas on representable matroids of bounded…

Discrete Mathematics · Computer Science 2015-03-13 Yann Strozecki

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

In this paper we highlight some enumerative results concerning matroids of low rank and prove the tail-ends of various sequences involving the number of matroids on a finite set to be log-convex. We give a recursion for a new, slightly…

Combinatorics · Mathematics 2007-05-23 W. M. B. Dukes

This is the second in a series of papers on rank decompositions of the matrix multiplication tensor. We present new rank $23$ decompositions for the $3\times 3$ matrix multiplication tensor $M_{\langle 3\rangle}$. All our decompositions…

Computational Complexity · Computer Science 2018-01-04 Grey Ballard , Christian Ikenmeyer , J. M. Landsberg , Nick Ryder

The problem of covering the ground set of two matroids by a minimum number of common independent sets is notoriously hard even in very restricted settings, i.e.\ when the goal is to decide if two common independent sets suffice or not.…

Combinatorics · Mathematics 2023-02-06 Kristóf Bérczi , Tamás Schwarcz

In this article, we prove that there are at most two meromorphic mappings of $\mathbb C^m$ into $\mathbb P^n(\mathbb C)\ (n\geqslant 2)$ sharing $2n+2$ hyperplanes in general position regardless of multiplicity, where all zeros with…

Complex Variables · Mathematics 2019-02-27 Si Duc Quang

We study the fan structure of Dressians $\Dr(d,n)$ and local Dressians $\Dr(\cM)$ for a given matroid $\cM$. In particular we show that the fan structure on $\Dr(\cM)$ given by the three term Pl\"ucker relations coincides with the structure…

Combinatorics · Mathematics 2018-09-25 Jorge Alberto Olarte , Marta Panizzut , Benjamin Schröter

A new connection between two different necessary conditions for a polymatroid to be linearly representable is presented. Specifically, we prove that the existence of a tensor product with the uniform matroid of rank two on three elements…

Combinatorics · Mathematics 2025-02-20 Carles Padró

Consider a linear realization of a matroid over a field. One associates with it a configuration polynomial and a symmetric bilinear form with linear homogeneous coefficients. The corresponding configuration hypersurface and its non-smooth…

Algebraic Geometry · Mathematics 2021-07-06 Graham Denham , Mathias Schulze , Uli Walther

Based on the ranks of reduced density matrices, we derive necessary conditions for the separability of multiparticle arbitrary-dimensional mixed states, which are equivalent to sufficient conditions for entanglement. In a similar way we…

Quantum Physics · Physics 2007-05-23 Bo Chong , Hellmut Keiter , Joachim Stolze

We provide a formula for the Ehrhart polynomial of the connected matroid of size $n$ and rank $k$ with the least number of bases, also known as a minimal matroid. We prove that their polytopes are Ehrhart positive and $h^*$-real-rooted (and…

Combinatorics · Mathematics 2021-06-17 Luis Ferroni

We show that the number of linear spaces on a set of $n$ points and the number of rank-3 matroids on a ground set of size $n$ are both of the form $(cn+o(n))^{n^2/6}$, where $c=e^{\sqrt 3/2-3}(1+\sqrt 3)/2$. This is the final piece of the…

Combinatorics · Mathematics 2024-05-31 Matthew Kwan , Ashwin Sah , Mehtaab Sawhney

We present some new results about the resonance varieties of matroids and hyperplane arrangements. Though these have been the objects of ongoing study, most work so far has focussed on cohomological degree 1. We show that certain phenomena…

Combinatorics · Mathematics 2015-05-25 Graham Denham

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

In this paper we investigate the number of integer points lying in dilations of lattice path matroid polytopes. We give a characterization of such points as polygonal paths in the diagram of the lattice path matroid. Furthermore, we prove…

Combinatorics · Mathematics 2017-10-26 Kolja Knauer , Leonardo Martínez-Sandoval , Jorge Luis Ramírez Alfonsín

We study hyperplane sections of smooth polarized $K3$-surfaces that split into unions of lines. We describe the dual adjacency graphs of such sections and find sharp upper bounds on their number. In most cases (starting from degree $6$), we…

Algebraic Geometry · Mathematics 2025-09-30 Alex Degtyarev

As part of the recent developments in infinite matroid theory, there have been a number of conjectures about how standard theorems of finite matroid theory might extend to the infinite setting. These include base packing, base covering, and…

Combinatorics · Mathematics 2012-03-06 Nathan Bowler , Johannes Carmesin

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