Related papers: The Eisenbud-Green-Harris conjecture for fast-grow…

We address the Uniform Boundedness Conjecture of Morton and Silverman in the case of unicritical polynomials, assuming a generalization of the $abc$-conjecture. For unicritical polynomials of degree at least five, we require only the…

We discuss sufficiently fast-growing sequences of Turing degrees. The key result is that, assuming sufficient determinacy, if $\phi$ is a formula with one free variable, and S and T are sufficiently fast-growing sequences of Turing degrees…

Let $M$ be an ideal in $K[x_1,...,x_n]$ ($K$ is a field) generated by products of linear forms and containing a homogeneous regular sequence of some length. We prove that ideals containing $M$ satisfy the Eisenbud-Green-Harris conjecture…

Degree sequence (DS) problems are around for at least hundred twenty years, and with the advent of network science, more and more complicated, structured DS problems were invented. Interestingly enough all those problems so far are…

Consider a pseudo-$H$-space $E$ endowed with a separately continuous biadditive associative multiplication which induces a grading on $E$ with respect to an abelian group $G$. We call such a space a graded pseudo-$H$-ring and we show that…

Let $G$ be a simple graph on $n$ vertices and $\mathcal{I}_G$ denotes parity binomial edge ideal of $G$ in the polynomial ring $S = \mathbb{K}[x_1,\ldots, x_n, y_1, \ldots, y_n].$ We obtain a lower bound for the regularity of parity…

In this note by using elementary considerations, we settle Fr\"oberg's conjecture for a large number of cases, when all generators of ideals have the same degree.

This note gives necessary and sufficient conditions for a sequence of non-negative integers to be the degree sequence of a connected simple graph. This result is implicit in a paper of Hakimi. A new alternative characterisation of these…

Motivated by the scaling limits of the connected components of the configuration model, we study uniform connected multigraphs with fixed degree sequence $\mathcal{D}$ and with surplus $k$. We call those random graphs…

For all integers $4 \leq r \leq d$, we show that there exists a finite simple graph $G= G_{r,d}$ with toric ideal $I_G \subset R$ such that $R/I_G$ has (Castelnuovo-Mumford) regularity $r$ and $h$-polynomial of degree $d$. To achieve this…

We introduce a new class of commutative noetherian DG-rings which generalizes the class of regular local rings. These are defined to be local DG-rings $(A,\bar{\mathfrak{m}})$ such that the maximal ideal $\bar{\mathfrak{m}} \subseteq…

The Erd\H{o}s--Gallai criteria for recognizing degree sequences of simple graphs involve a system of inequalities. Given a fixed degree sequence, we consider the list of differences of the two sides of these inequalities. These differences…

We prove a uniform bound on the growth of symbolic powers of arbitrary (not necessarily radical) ideals in arbitrary (not necessarily excellent) regular rings of all characteristics. This gives a complete answer to a question of Hochster…

In this paper we relate a fundamental parameter of a random graph, its degree sequence, to a simple model of nearly independent binomial random variables. This confirms a conjecture made in 1997. As a result, many interesting functions of…

In hypergraph theory, determining a characterization of the degree sequence $d=(d_1,d_2,\ldots,d_n)$ where $d_1\ge d_2\ge\ldots,d_n$ are positive integers, of an $h$-uniform simple hypergraph $\cal H$, and deciding the complexity status of…

We combine two of Igusa's conjectures with recent semi-continuity results by Musta\c{t}\u{a} and Popa to form a new, natural conjecture about bounds for exponential sums. These bounds have a deceivingly simple and general formulation in…

In this paper we study conditions which guarantee the existence of perfect matchings and perfect fractional matchings in uniform hypergraphs. We reduce this problem to an old conjecture by Erd\H{o}s on estimating the maximum number of edges…

Generalizing the well-known Green Conjecture on syzygies of canonical curves, Green and Lazarsfeld formulated in 1986 the Secant Conjecture predicting that a line bundle L of sufficiently high degree on a curve has a non-linear p-syzygy if…

We prove an asymptotic formula for the number of $k$-uniform hypergraphs with a given degree sequence, for a wide range of parameters. In particular, we find a formula that is asymptotically equal to the number of $d$-regular $k$-uniform…

We prove the Geometric Syzygy Conjecture for generic canonical curves of even genus. This result extends Green's classical result on the generation of the ideal of a canonical curve by rank four quadrics to the highest linear syzygy group.