Related papers: Enumerating neighborly polytopes and oriented matr…
We apply combinatorial methods to a geometric problem: the classification of polytopes, in terms of Minkowski decomposability. Various properties of skeletons of polytopes are exhibited, each sufficient to guarantee indecomposability of a…
We prove that the extension complexity of the independence polytope of every regular matroid on $n$ elements is $O(n^6)$. Past results of Wong and Martin on extended formulations of the spanning tree polytope of a graph imply a $O(n^2)$…
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…
We construct bivariate orthogonal polynomials (OPs) on algebraic curves of the form $y^m = \phi(x)$ in $\mathbb{R}^2$ where $m = 1, 2$ and $\phi$ is a polynomial of arbitrary degree $d$, in terms of univariate semiclassical OPs. We compute…
A well known result by Lagarias and Ziegler states that there are finitely many equivalence classes of d-dimensional lattice polytopes having volume at most K, for fixed constants d and K. We describe an algorithm for the complete…
It has been shown that the edge structure of the characteristic imset polytope is closely connected to the question of causal discovery. The diameter of a polytope is an indicator of how connected the polytope is and moreover gives us a…
We study nested complexes of building sets on the Las Vergnas face lattices of oriented matroids. Such a nested complex is the face lattice of an oriented matroid, obtained by iterated stellar subdivisions of the positive tope. If the…
We classify all matroids with at most 8 elements that have the half-plane property, and we provide a list of some matroids on 9 elements that have, and that do not have the half-plane property. Furthermore, we prove that several classes of…
We extend the algorithms of Robinson, Smyth, and McKee--Smyth to enumerate all real-rooted integer polynomials of a fixed degree, where the first few (at least three) leading coefficients are specified. Additionally, we introduce new linear…
For a $d$-dimensional polytope with $v$ vertices, $d+1\le v\le2d$, we calculate precisely the minimum possible number of $m$-dimensional faces, when $m=1$ or $m\ge0.62d$. This confirms a conjecture of Gr\"unbaum, for these values of $m$.…
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…
While the parameters of atomic nuclei, Z and A, indicate a general structural pattern for the nuclei, their exact masses in their fine differences seem not to exhibit the orderly kind of logical system that systematic and orderly nature…
For a family of polytopes of even dimension $2p$, known as \textit{dual-neighborly}, it has been shown for $p\ne 2$ that the associated intersection of quadrics is a connected sum of sphere products $S^p\times S^p$. In this article we give…
Many (if not most) of convex polytopes, important for combinatorial and algebraic geometry, are closely related to secondary polytopes of point configurations, or base polytopes of submodular functions, or their numerous variations and…
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…
In this article, we study polymatroids that are representable by means of linear restricted rank-metric codes, namely, by subspaces of the space of alternating, symmetric, or Hermitian square matrices endowed with the rank metric. More…
The weak-map order on the matroid base polytopes is the partial order defined by inclusion. Lucas proved that the base polytope of no binary matroid includes the base polytope of a connected matroid. A matroid base polytope is said to be…
We consider the problem of determining whether the union of two infinite matroids is a matroid. We introduce a superclass of the finitary matroids, the nearly finitary matroids, and prove that the union of two nearly finitary matroids is a…
We show algorithms for computing representative families for matroid intersections and use them in fixed-parameter algorithms for set packing, set covering, and facility location problems with multiple matroid constraints. We complement our…
Zonotopal algebra is the study of a family of pairs of dual vector spaces of multivariate polynomials that can be associated with a list of vectors X. It connects objects from combinatorics, geometry, and approximation theory. The origin of…