Related papers: Logarithmic concavity of bimatroids
We construct a logarithmic version of the Hilbert scheme, and more generally the Quot scheme, of a simple normal crossings pair. The logarithmic Quot space admits a natural tropicalisation called the space of tropical supports, which is a…
We express the matroid polytope $P_M$ of a matroid $M$ as a signed Minkowski sum of simplices, and obtain a formula for the volume of $P_M$. This gives a combinatorial expression for the degree of an arbitrary torus orbit closure in the…
Lorentzian polynomials serve as a bridge between continuous and discrete convexity, connecting analysis and combinatorics. In this article, we study the topology of the space $\mathbb{P}\textrm{L}_J$ of Lorentzian polynomials on $J$ modulo…
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…
We introduce a new matroid width parameter based on the operation of matroid amalgamation, which we call amalgam-width. The parameter is linearly related to branch-width on finitely representable matroids (which is not possible for…
Theorem 1 is a formula expressing the mean number of real roots of a random multihomogeneous system of polynomial equations as a multiple of the mean absolute value of the determinant of a random matrix. Theorem 2 derives closed form…
We show that saturated base change of a dominant toroidal morphism is also toroidal. For completeness, we give full details on equivalence between definitions regarding toroidal embeddings and toroidal morphisms in literature. Moreover, we…
We study a graded vector space of polynomials associated to a square matrix, defined by a finite difference condition along the rows. We show this space coincides with one defined by directional derivatives, and prove it is…
A flat cover is a collection of flats identifying the non-bases of a matroid. We introduce the notion of cover complexity, the minimal size of such a flat cover, as a measure for the complexity of a matroid, and present bounds on the number…
In this paper we consider a special class of polymorphisms with invariant measure, - (cf.[1])- the algebraic polymorphisms of compact groups. A general polymorphism is -- by definition -- a many-valued map with invariant measure, and the…
A natural construction of the logarithmic extension of the M(2,p) minimal models is presented, which generalises our previous model [0708.0802] of percolation (p=3). Its key aspect is the replacement of the minimal model irreducible modules…
It is possible to write the indicator function of any matroid polytope as an integer combination of indicator functions of Schubert matroid polytopes. In this way, every matroid on $n$ elements of rank $r$ can be thought of as a lattice…
We introduce ideas that complement the many known connections between polymatroids and graph coloring. Given a hypergraph that satisfies certain conditions, we construct polymatroids, given as rank functions, that can be written as sums of…
Positive geometries are semialgebraic sets equipped with a canonical differential form whose residues mirror the boundary structure of the geometry. Every full-dimensional projective polytope is a positive geometry. Motivated by the…
Ouroboros functions have shown some interesting properties when subjected to conventional operations. The aim of this paper is to continue our investigation and prove some additional properties of these functions. Using algebraic methods,…
Let $M$ be a matroid defined on a finite set $E$ and $L\subset E$. $L$ is locked in $M$ if $M|L$ and $M^*|(E\backslash L)$ are 2-connected, and $min\{r(L), r^*(E\backslash L)\} \geq 2$. Locked subsets characterize nontrivial facets of the…
We show that the convolution of a compactly supported measure on $\mathbb{R}$ with a Gaussian measure satisfies a logarithmic Sobolev inequality (LSI). We use this result to give a new proof of a classical result in random matrix theory…
This paper introduces combinatorial representations, which generalise the notion of linear representations of matroids. We show that any family of subsets of the same cardinality has a combinatorial representation via matrices. We then…
The theory of rough sets is concerned with the lower and upper approximations of objects through a binary relation on a universe. It has been applied to machine learning, knowledge discovery and data mining. The theory of matroids is a…
We decompose the indicator function of each $(a, b)$-Catalan matroid polytope as a weighted sum of indicator function of matroid polytopes that correspond to direct sums of uniform matroids. Catalan matroids lie in the interior of the…