English
Related papers

Related papers: $M$-Shellability of Discrete Polymatroids

200 papers

We prove the hard Lefschetz theorem and the Hodge-Riemann relations for a commutative ring associated to an arbitrary matroid M. We use the Hodge-Riemann relations to resolve a conjecture of Heron, Rota, and Welsh that postulates the…

Combinatorics · Mathematics 2018-05-02 Karim Adiprasito , June Huh , Eric Katz

We give a simple proof that some iterated derived subdivision of every PL sphere is combinatorially equivalent to the boundary of a simplicial polytope, thereby resolving a problem of Billera (personal communication).

Combinatorics · Mathematics 2014-03-21 Karim A. Adiprasito , Ivan Izmestiev

Let $\mathbb{K}$ be a field and $S=\mathbb{K}[x_1,\dots,x_n]$ be the polynomial ring in $n$ variables over the field $\mathbb{K}$. Suppose that $\mathcal{C}$ is a chordal clutter with $n$ vertices and assume that the minimum edge…

Commutative Algebra · Mathematics 2014-09-19 S. A. Seyed Fakhari

We show that the base polytope $P_M$ of any paving matroid $M$ can be systematically obtained from a hypersimplex by slicing off certain subpolytopes, namely base polytopes of lattice path matroids corresponding to panhandle-shaped Ferrers…

Let $K$ be an algebraically closed field of characteristic zero, $\delta$ a nonzero $\mathcal{E}$-derivation of $K[x]$. We first prove that $\operatorname{Im}\delta$ is a Mathieu-Zhao space of $K[x]$ in some cases. Then we prove that LFED…

Algebraic Geometry · Mathematics 2023-11-27 Lintong Lv , Dan Yan

We introduce a version of discrete Morse theory specific for manifolds with boundary. The idea is to consider Morse functions for which all boundary cells are critical. We obtain "Relative Morse Inequalities" relating the homology of the…

Algebraic Topology · Mathematics 2010-10-05 Bruno Benedetti

A discrete d-manifold is a finite simple graph G=(V,E) where all unit spheres are (d-1)-spheres. A d-sphere is a d-manifold for which one can remove a vertex to make it contractible. A graph is contractible if one can remove a vertex with…

Combinatorics · Mathematics 2023-12-25 Oliver Knill

We provide a short proof of the theorem that every real multivariate polynomial has a symmetric determinantal representation, which was first proved in J. W. Helton, S. A. McCullough, and V. Vinnikov, Noncommutative convexity arises from…

Complex Variables · Mathematics 2021-01-12 Anthony Stefan , Aaron Welters

We show that f-vectors of matroid complexes of realisable matroids are log-concave. This was conjectured by Mason in 1972. Our proof uses the recent result by Huh and Katz who showed that the coefficients of the characteristic polynomial of…

Combinatorics · Mathematics 2013-06-11 Matthias Lenz

Given a simple graph $G$, a poset of its even subgraphs was firstly considered by S. Choi and H. Park to study the topology of a real toric manifold associated with $G$. S. Choi and the authors extended this to a graph allowing multiple…

Combinatorics · Mathematics 2018-02-09 Boram Park , Seonjeong Park

In this paper we consider monomial localizations of monomial ideals and conjecture that a monomial ideal is polymatroidal if and only if all its monomial localizations have a linear resolution. The conjecture is proved for squarefree…

Commutative Algebra · Mathematics 2012-06-15 Somayeh Bandari , Jürgen Herzog

We prove that double Schubert polynomials have the Saturated Newton Polytope property. This settles a conjecture by Monical, Tokcan and Yong. Our ideas are motivated by the theory of multidegrees. We introduce a notion of standardization of…

Commutative Algebra · Mathematics 2023-10-10 Federico Castillo , Yairon Cid-Ruiz , Fatemeh Mohammadi , Jonathan Montaño

Let $M$ be a matroid without loops or coloops and let $T(M;x,y)$ be its Tutte polynomial. In 1999 Merino and Welsh conjectured that $$\max(T(M;2,0), T(M;0,2))\geq T(M;1,1)$$ holds for graphic matroids. Ten years later, Conde and Merino…

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

Let $M$ be a strictly convex smooth connected hypersurface in $\mathbb R^n$ and $\widehat{M}$ its convex hull. We say that $M$ is locally polynomially integrable if the $(n-1)-$ dimensional volumes of the sections of $\widehat M$ by…

Metric Geometry · Mathematics 2021-03-03 Mark Agranovsky

The concepts of differentiation and integration for matrices are known. As far as each matrix is differentiable, it is not clear a priori whether a given matrix is integrable or not. Recently some progress was obtained for diagonalizable…

Combinatorics · Mathematics 2023-09-08 Suren Danielyan , Alexander Guterman , Elena Kreines , Fedor Pakovich

We show that for proving the Stanley conjecture, it is sufficient to consider a very special class of monomial ideals. These ideals (or rather their lcm lattices) are in bijection with the simplicial spanning trees of skeletons of a…

Commutative Algebra · Mathematics 2015-03-10 Lukas Katthän

The multigraded Hilbert scheme parametrizes all homogeneous ideals in a polynomial ring graded by an abelian group with a fixed Hilbert function. We prove that any multigraded Hilbert scheme is smooth and irreducible when the polynomial…

Algebraic Geometry · Mathematics 2010-03-15 Diane Maclagan , Gregory G. Smith

Let M be a closed embedded minimal hypersurface in a Euclidean sphere of dimension n+1, we prove that it is strongly rigid. As applications we confirm the conjecture proposed by Choi and Schoen in [3] and the Chern conjecture for n less…

Differential Geometry · Mathematics 2023-12-06 Xu Han

Ghomi proved that every convex polyhedron could be stretched via an affine transformation so that it has an edge-unfolding to a net [Gho14]. A net is a simple planar polygon; in particular, it does not self-overlap. One can view his result…

Computational Geometry · Computer Science 2023-02-17 Joseph O'Rourke

A classical question in PL topology, asked among others by Hudson, Lickorish, and Kirby, is whether every linear subdivision of the d-simplex is simplicially collapsible. The answer is known to be positive for d<4. We solve the problem up…

Combinatorics · Mathematics 2017-09-26 Karim Adiprasito , Bruno Benedetti