Related papers: A combinatorial proof of Gotzmann's persistence th…
In this paper we investigate the consequences and consistency of the downward L\"owenheim-Skolem theorem for extension of the first order logic by the Magidor-Malitz quantifier. We derive some combinatorial results and improve the known…
In this paper we provide a short new proof for the integrality of Rothblum's linear description of the convex hull of incidence vectors of stable matchings in bipartite graphs. In the spirit of iterative rounding proofs, the key feature of…
We prove that the minimum of the modulus of a random trigonometric polynomial with Gaussian coefficients, properly normalized, has limiting exponential distribution.
We prove several cases of Zimmer's conjecture for actions of higher-rank cocompact lattices on low dimensional manifolds. For example, if $\Gamma$ is a cocompact lattice in $\mathrm{Sl}(n, \mathbb R)$, $M$ is a compact manifold, and…
Among other results, we prove the following theorem about Steiner minimal trees in $d$-dimensional Euclidean space: if two finite sets in $\mathbb{R}^d$ have unique and combinatorially equivalent Steiner minimal trees, then there is a…
The algebraic stability theorem for $\mathbb{R}$-persistence modules is a fundamental result in topological data analysis. We present a stability theorem for $n$-dimensional rectangle decomposable persistence modules up to a constant…
We introduce balanced polyominoes and show that their ideal of inner minors is a prime ideal and has a quadratic Gr\"obner basis with respect to any monomial order, and we show that any row or column convex and any tree-like polyomino is…
This article aims to study some $n$-tuples of elements belonging to a ring $\mathbb{Z}/N\mathbb{Z}$ related to the combinatorics of congruence subgroups of the modular group. More precisely, we will focus here on the notion of minimal…
The Collatz conjecture is explored using polynomials based on a binary numeral system. It is shown that the degree of the polynomials, on average, decreases after a finite number of steps of the Collatz operation, which provides a weak…
A polynomial $p\in\mathbb{R}[z_1,\dots,z_n]$ is real stable if it has no roots in the upper-half complex plane. Gurvits's permanent inequality gives a lower bound on the coefficient of the $z_1z_2\dots z_n$ monomial of a real stable…
We state a conjecture on the stability of Betti diagrams of powers of monomial ideals.
Let $R_n=K[x_1,\dots,x_n]$ be the $n$-variable polynomial ring over a field $K$. Let $S_n$ denote the set of monomials in $R_n$. A monomial $u \in S_n$ is a \textit{Gotzmann monomial} if the Borel-stable monomial ideal $\langle u \rangle$…
Demailly, Ein and Lazarsfeld \cite{DEL} proved the subadditivity theorem for multiplier ideals, which states the multiplier ideal of the product of ideals is contained in the product of the individual multiplier ideals, on non-singular…
Foreman proved the Duality Theorem, which gives an algebraic characterization of certain ideal quotients in generic extensions. As an application he proved that generic supercompactness of $\omega_1$ is preserved by any proper forcing. We…
In parallel to the classical theory of central extensions of groups, we develop a version for extensions that preserve commutativity. It is shown that the Bogomolov multiplier is a universal object parametrising such extensions of a given…
A minimal monomial ideal is the combinatorially simplest monomial ideal whose lcm-lattice equals a given finite atomic lattice $\hat{L}$. The minimal ideal inherits many nice properties of any ideal $I$ whose lcm-lattice also equals…
In this work, we provide a necessary and sufficient condition on a polyomino ideal for having the set of inner 2-minors as degree reverse lexicographic Gr\"obner basis, due to combinatorial properties of the polyomino itself. Moreover, we…
For an ideal $I$ in a polynomial ring over a field, a monomial support of $I$ is the set of monomials that appear as terms in a set of minimal generators of $I$. Craig Huneke asked whether the size of a monomial support is a bound for the…
A combinatorial identity that was needed in Ahlgren and Ono's proof of a certain congruence conjecture of Frits Beukers is stated, and a pointer to its WZ proof is given.
We use the combinatorial properties of central sets to prove a result about the existence of exponential monochromatic patterns, in the style of Hindman's Finite Sums Theorem. More precisely, we prove that for every finite coloring of the…