Related papers: A combinatorial proof of Gotzmann's persistence th…
We study the coherence and conservativity of extensions of dependent type theories by additional strict equalities. By considering notions of congruences and quotients of models of type theory, we reconstruct Hofmann's proof of the…
This paper establishes the theoretical foundations for the asymptotic separability of Gaussian Mixture Models (GMMs) in high dimensions by extending the classical Feldman-H\'ajek theorem. We first prove that a countable mixture of Gaussian…
The Goldberg-Ostrovskii problem asks whether finite-order solutions of a linear differential equation inherit the property of completely regular growth (c.r.g.) from its coefficients. While Bergweiler's counterexample demonstrated that the…
We describe an algorithm which finds binomials in a given ideal $I\subset\mathbb{Q}[x_1,\dots,x_n]$ and in particular decides whether binomials exist in $I$ at all. Binomials in polynomial ideals can be well hidden. For example, the lowest…
Given two polynomials $P(\underline x)$, $Q(\underline x)$ in one or more variables and with integer coefficients, how does the property that they are coprime relate to their values $P(\underline n), Q(\underline n)$ at integer points…
In this paper, we first show that any square-free monomial ideal in $K[x_1, x_2, x_3, x_4, x_5]$ has the strong persistence property. Next we will provide a criterion for a minimal counterexample to the Conforti-Cornuejols conjecture.…
Harvey Friedman's gap condition on embeddings of finite labelled trees plays an important role in combinatorics (proof of the graph minor theorem) and mathematical logic (strong independence results). In the present paper we show that the…
The associated prime ideals of powers of polymatroidal ideals are studied, including the stable set of associated prime ideals of this class of ideals. It is shown that polymatroidal ideals have the persistence property and for transversal…
Group cohomology of polynomial growth is defined for any finitely generated discrete group, using cochains that have polynomial growth with respect to the word length function. We give a geometric condition that guarantees that it agrees…
In this paper we prove the Gromov--Milman conjecture (the Dvoretzky type theorem) for homogeneous polynomials on $\mathbb R^n$, and improve bounds on the number $n(d,k)$ in the analogous conjecture for odd degrees $d$ (this case is known as…
In this paper, we study a combinatorial problem originating in the following conjecture of Erdos and Lemke: given any sequence of n divisors of n, repetitions being allowed, there exists a subsequence the elements of which are summing to n.…
Radical binomial ideals associated with finite lattices are studied. Gr\"obner basis theory turns out to be an efficient tool in this investigation.
A recent nice result due to I. Pak and G. Panova is the strict unimodality of the $q$-binomial coefficients $\binom{a+b}{b}_q$ (see \cite{PP} and also \cite{PP2} for a slightly revised version of their theorem). Since their proof used…
In 2017, Cooper et al. proposed a conjecture providing a lower bound for the Waldschmidt constant of monomial ideals. We confirm this conjecture for some classes of monomial ideals. Recently, M\'endez, Pinto, and Villarreal formulated a…
We extend the close interplay between continued fractions, orthogonal polynomials, and Gaussian quadrature rules to several variables in a special but natural setting which we characterize in terms of moment sequences. The crucial condition…
We propose a generalization of Halls marriage theorem. The generalization given here provides a necessary sufficient condition for arranging a successful friendship among n number of k sets. We define multimatrix, multideterminant,…
We present a logical framework for formalizing connections between finitary combinatorics and measure theory or ergodic theory that have appeared various places throughout the literature. We develop the basic syntax and semantics of this…
We classify connected graphs $G$ whose binomial edge ideal is Gorenstein. The proof uses methods in prime characteristic.
We present a generalization of the induced matching theorem and use it to prove a generalization of the algebraic stability theorem for $\mathbb{R}$-indexed pointwise finite-dimensional persistence modules. Via numerous examples, we show…
This paper investigates the independence polynomials arising from iterated strong products of cycle graphs, examining their algebraic symmetries and combinatorial structures. Leveraging modular arithmetic and Galois theory, we establish…