Related papers: The Eisenbud-Green-Harris conjecture for fast-grow…
We use an algebraic method to prove a degree version of the celebrated Erd\H os-Ko-Rado theorem: given $n>2k$, every intersecting $k$-uniform hypergraph $H$ on $n$ vertices contains a vertex that lies on at most $\binom{n-2}{k-2}$ edges.…
A long standing conjecture, known to us as the Eisenbud Goto conjecture, states that an n-dimensional variety embedded with degree $d$ in the $N$- dimensional projective space is $(d-(N-n)+1)$-regular in the sense of Castelnuovo-Mumford. In…
We prove that if $T_1,\dots, T_n$ is a sequence of bounded degree trees so that $T_i$ has $i$ vertices, then $K_n$ has a decomposition into $T_1,\dots, T_n$. This shows that the tree packing conjecture of Gy\'arf\'as and Lehel from 1976…
We provide the necessary and sufficient conditions for the edge-binomials of the tree forming a $d$-sequence in terms of the degree sequence notion of a graph. We study the regularity of powers of the binomial edge ideals of trees generated…
In CI-Liaison, significant effort has been made to study ideals that are in the linkage class of a complete intersection, which are called licci ideals. In a polynomial ring, recently E. Chong defined a "sequentially bounded" condition on…
Let C be a locally Cohen-Macaulay curve in complex projective 3-space. The maximum genus problem predicts the largest possible arithmetic genus g(d,s) that C can achieve assuming that it has degree d and does not lie on surfaces of degree…
We focus on the structure of a homogeneous Gorenstein ideal $I$ of codimension three in a standard polynomial ring $R=\kk[x_1,\ldots,x_n]$ over a field $\kk$, assuming that $I$ is generated in a fixed degree $d$. For such an ideal $I$ this…
Let $S$ be a polynomial ring in $n$ variables over a field. Let $I$ be a homogeneous ideal in $S$ generated by forms of degree at most $d$ with $\text{dim}(S/I)=r$. In the first part of this paper, we show how to derive from a result of Hoa…
We study the linear syzygies of a homogeneous ideal I in a polynomial ring S, focusing on the graded betti numbers b_(i,i+1) = dim_k Tor_i(S/I, k)_(i+1). For a variety X and divisor D with S = Sym(H^0(D)*), what conditions on D ensure that…
An ideal $I$ of a commutative ring $R$ is said to be of linear type when its Rees algebra and symmetric algebra exhibit isomorphism. In this paper, we investigate the conjecture put forth by Jayanthan, Kumar, and Sarkar (2021) that if $G$…
We show, under natural conditions, that uniform rooted trees with fixed degree sequence converge after renormalization toward inhomogeneous continuum random trees (ICRT). We also provide a sharp upper-bound for the tail of their heights. We…
A famous conjecture of Erd\H{o}s and S\'os states that every graph with average degree more than $k - 1$ contains all trees with $k$ edges as subgraphs. We prove that the Erd\H{o}s-S\'os conjecture holds approximately, if the size of the…
Nowadays, the notion of semi-regular sequences, originally proposed by Fr\"oberg, becomes very important not only in Mathematics, but also in Information Science, in particular Cryptology. For example, it is highly expected that randomly…
For a positive integer \( k \), let \( [k] = \{1, 2, \ldots, k\} \). Let \( h \) be a non-negative integer, and let \( n \) be a multiple of \( h + 1 \). Define \( H \) as the disjoint union of \( n/(h+1) \) cliques (each of size \( h + 1…
We prove the well-known Brown-Erd\H{o}s-S\'os Conjecture for hypergraphs of large uniformity in the following form: any dense linear $r$-graph $G$ has $k$ edges spanning at most $(r-2)k+3$ vertices, provided the uniformity $r$ of $G$ is…
We establish the first previously unknown case of the Eisenbud-Harris conjecture in Castelnuovo theory concerning algebraic curves of high genus in ${\bf P}^n$. The problem is reduced to a question about zero-dimensional schemes $\Gamma…
In this paper, we introduce a new concept namely degree polynomial for vertices of a simple graph. This notion leads to a concept namely degree polynomial sequence which is stronger than the concept of degree sequence. After obtaining the…
We give an explicit formula for the degree of the Grothendieck polynomial of a Grassmannian permutation and a closely related formula for the Castelnuovo-Mumford regularity of the Schubert determinantal ideal of a Grassmannian permutation.…
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$…
A finite non-increasing sequence of positive integers $d = (d_1\geq \cdots\geq d_n)$ is called a degree sequence if there is a graph $G = (V,E)$ with $V = \{v_1,\ldots,v_n\}$ and $deg(v_i)=d_i$ for $i=1,\ldots,n$. In that case we say that…