相关论文: Mubayi's Polynomial-Ideal Conjecture and Cover-Ide…

We describe a method that we believe may be foundational for a comprehensive theory of generalised Turan problems. The cornerstone of our approach is a quasirandom counting lemma for quasirandom hypergraphs, which extends the standard…

We prove the multiplicity bounds conjectured by Herzog-Huneke-Srinivasan and Herzog-Srinivasan in the following cases: the strong conjecture for edge ideals of bipartite graphs, and the weaker Taylor bound conjecture for all quadratic…

A famous conjecture of Tuza states that the minimum number of edges needed to cover all the triangles in a graph is at most twice the maximum number of edge-disjoint triangles. This conjecture was couched in a broader setting by Aharoni and…

The Tur\'an hypergraph problem asks to find the maximum number of $r$-edges in a $r$-uniform hypergraph on $n$ vertices that does not contain a clique of size $a$. When $r=2$, i.e., for graphs, the answer is well-known and can be found in…

Macaulay's theorem and Fr\"oberg's conjecture deal with the Hilbert function of homogeneous ideals in polynomial rings $S$ over a field $K$. In this short note we present some questions related to variants of Macaulay's theorem and…

Since its formulation, Tur\'an's hypergraph problems have been among the most challenging open problems in extremal combinatorics. One of them is the following: given a $3$-uniform hypergraph $\mathcal{F}$ on $n$ vertices in which any five…

We introduce the concept of minimum edge cover for an induced subgraph in a graph. Let $G$ be a unicyclic graph with a unique odd cycle and $I=I(G)$ be its edge ideal. We compute the exact values of all symbolic defects of $I$ using the…

Motivated by the counting results for color-critical subgraphs by Mubayi [Adv. Math., 2010], we study the phenomenon behind Mubayi's theorem from a spectral perspective and start up this problem with the fundamental case of triangles. We…

In this paper we continue the study of a natural generalization of Tur\'an's forbidden subgraph problem and the Ruzsa-Szemer\'edi problem. Let $ex_F(n,G)$ denote the maximum number of edge-disjoint copies of a fixed simple graph $F$ that…

Let $R$ be a smooth affine algebra over an infinite perfect field $k$. Let $I\subset R$ be an ideal, $\omega_I:(R/I)^n\to I/I^2$ a surjective homomorphism and $Q_{2n}\subset \mathbb{A}^{2n+1}$ be the smooth quadric defined by the equation…

Each partition $\lambda = (\lambda_1, \lambda_2, ..., \lambda_n)$ determines a so-called Ferrers tableau or, equivalently, a Ferrers bipartite graph. Its edge ideal, dubbed Ferrers ideal, is a squarefree monomial ideal that is generated by…

The symbolic powers $I^{(n)}$ of a radical ideal $I$ in a polynomial ring consist of the functions that vanish up to order $n$ in the variety defined by $I$. These do not necessarily coincide with the ordinary algebraic powers $I^n$, but it…

Let $G$ be a simple graph on $n$ vertices and $J_G$ denote the corresponding binomial edge ideal in $S = K[x_1, \ldots, x_n, y_1,\ldots, y_n].$ We prove that the Castelnuovo-Mumford regularity of $J_G$ is bounded above by $c(G)+1$ when $G$…

We study the homological algebra of edge ideals of Erd\"{o}s-R\'enyi random graphs. These random graphs are generated by deleting edges of a complete graph on $n$ vertices independently of each other with probability $1-p$. We focus on some…

The Eisenbud-Green-Harris (EGH) conjecture states that a homogeneous ideal in a polynomial ring $K[x_1,\,\ldots,\,x_n]$ over a field $K$ that contains a regular sequence $f_1,\,\ldots,\, f_n$ with degrees $a_i$, $i=1,\,\ldots,\,n$ has the…

Let $I\subset S$ be a graded ideal of a standard graded polynomial ring $S$ with coefficients in a field $K$, and let $\text{v}(I)$ be the $\text{v}$-number of $I$. In previous work, we showed that for any graded ideal $I\subset S$…

Let $d_1,...,d_r$ be positive integers and let $I = (F_1,...,F_r)$ be an ideal generated by general forms of degrees $d_1,...,d_r$, respectively, in a polynomial ring $R$ with $n$ variables. When all the degrees are the same we give a…

There is a natural infinite graph whose vertices are the monomial ideals in a polynomial ring. The definition involves Gr\"obner bases or the action of an algebraic torus. We present algorithms for computing the (affine schemes…

The scissors congruence conjecture for the unimodular group is an analogue of Hilbert's third problem, for the equidecomposability of polytopes. Liu and Osserman studied the Ehrhart quasi-polynomials of polytopes naturally associated to…

Let $R = \mathbb{K}[x_1, \ldots, x_n]$ and $I \subset R$ be a homogeneous ideal. In this article, we first obtain certain sufficient conditions for the subadditivity of $R/I$. As a consequence, we prove that if $I$ is generated by…