Related papers: One-adhesive polymatroids
We present an algorithm that enumerates and classifies all edge-to-edge gluings of unit squares that correspond to convex polyhedra. We show that the number of such gluings of $n$ squares is polynomial in $n$, and the algorithm runs in time…
Originally introduced by Fine and Reid in the study of plurigenera of toric hypersurfaces, the Fine interior of a lattice polytope got recently into the focus of research. It is has been used for constructing canonical models in the sense…
Motivated by a search for Lie group structures on groups of Poisson diffeomorphisms [24], we investigate linearizability of Poisson structures of Poisson groupoids around the unit section. After extending the Lagrangian neighbourhood…
We introduce the cave polynomial of a polymatroid and show that it yields a valuative function on polymatroids. The support of this polynomial after homogenization is again a polymatroid. The cave polynomial gives a $K$-theoretic…
Nested matroids were introduced by Crapo in 1965 and have appeared frequently in the literature since then. A flat of a matroid $M$ is Hamiltonian if it has a spanning circuit. A matroid $M$ is nested if and only if its Hamiltonian flats…
The use of double groupoids and their associated double Lie algebroids and characteristic distributions is proposed for the description and analysis of continuous media that carry two different constitutive or geometric structures. Various…
We prove that any unicritical polynomial $f_c:z\mapsto z^d+c$ which is at most finitely renormalizable and has only repelling periodic points is combinatorially rigid. It implies that the connectedness locus (the ``Multibrot set'') is…
In this paper we investigate the Ehrhart Theory of the independence matroid polytope of uniform matroids. It is proved that these polytopes have an Ehrhart polynomial with positive coefficients. To do that, we prove that indeed all…
The width of a delta-matroid is the difference in size between a maximal and minimal feasible set. We give a Rough Structure Theorem for delta-matroids that admit a twist of width one. We apply this theorem to give an excluded minor…
We prove gluing theorems for tight contact structures. In particular, we rederive (as special cases) gluing theorems due to Colin and Makar-Limanov, and present an algorithm for determining whether a given contact structure on a handlebody…
Relations between components of the effective tensors of composites that hold regardless of composite's microstructure are called exact relations. Relations between components of the effective tensors of all laminates are called lamination…
This is a continuation of the series of notes on the dynamics of quadratic polynomials. We show the following Rigidity Theorem: Any combinatorial class contains at most one quadratic polynomial satisfying the secondary limbs condition with…
We define a family of convex polytopes called constrainahedra, which index collisions of horizontal and vertical lines. Our construction proceeds by first defining a poset $C(m,n)$ of good rectangular preorders, then proving that $C(m,n)$…
There has been wide interest in understanding which properties of base graphs of matroids extend to base-cobase graphs of matroids. A significant result of Naddef and Pulleyblank (1984) shows that the $1$-skeleton of any $(0,1)$-polytope is…
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 multivariate polynomial is stable if it is non-vanishing whenever all variables have positive imaginary parts. A matroid has the weak half-plane property (WHPP) if there exists a stable polynomial with support equal to the set of bases of…
We consider unimodality and related properties of f-vectors of polytopes in various dimensions. By a result of Kalai (1988), f-vectors of 5-polytopes are unimodal. In higher dimensions much less can be said; we give an overview on current…
In this work we develop the first theory to model self assembling mixtures of single patch colloids and colloids with spherically symmetric attractions. In the development of the theory we restrict the interactions such that there are short…
At present, practical application and theoretical discussion of rough sets are two hot problems in computer science. The core concepts of rough set theory are upper and lower approximation operators based on equivalence relations. Matroid,…
Following the work of Gao and Xie in [2], we state some properties of the inverse Kazhdan-Lusztig polynomial of a matroid. We also give partial answers to a conjecture that states that regular connected matroids are non-degenerate. We link…