Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userLefschetz properties of monomial ideals with almost linear resolution
143
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We study the WLP and SLP of artinian monomial ideals in $S=mathbb{K}[x_1,dots ,x_n]$ via studying their minimal free resolutions. We study the Lefschetz properties of such ideals where the minimal free resolution of $S/I$ is linear for at least $n-2$ steps. We give an affirmative answer to a conjecture of Eisenbud, Huneke and Ulrich for artinian monomial ideals with almost linear resolutions.
rate research
Read More
We determine a sharp lower bound for the Hilbert function in degree $d$ of a monomial algebra failing the weak Lefschetz property over a polynomial ring with $n$ variables and generated in degree $d$, for any $dgeq 2$ and $ngeq 3$. We consider artinian ideals in the polynomial ring with $n$ variables generated by homogeneous polynomials of degree $d$ invariant under an action of the cyclic group $mathbb{Z}/dmathbb{Z}$, for any $ngeq 3$ and any $dgeq 2$. We give a complete classification of such ideals in terms of the weak Lefschetz property depending on the action.
In this paper, we study the strong Lefschetz property of artinian complete intersection ideals generated by products of linear forms. We prove the strong Lefschetz property for a class of such ideals with binomial generators.
Given an ideal $I=(f_1,ldots,f_r)$ in $mathbb C[x_1,ldots,x_n]$ generated by forms of degree $d$, and an integer $k>1$, how large can the ideal $I^k$ be, i.e., how small can the Hilbert function of $mathbb C[x_1,ldots,x_n]/I^k$ be? If $rle n$ the smallest Hilbert function is achieved by any complete intersection, but for $r>n$, the question is in general very hard to answer. We study the problem for $r=n+1$, where the result is known for $k=1$. We also study a closely related problem, the Weak Lefschetz property, for $S/I^k$, where $I$ is the ideal generated by the $d$th powers of the variables.
Let $A = K[X_1,ldots, X_d]$ and let $I$, $J$ be monomial ideals in $A$. Let $I_n(J) = (I^n colon J^infty)$ be the $n^{th}$ symbolic power of $I$ wrt $J$. It is easy to see that the function $f^I_J(n) = e_0(I_n(J)/I^n)$ is of quasi-polynomial type, say of period $g$ and degree $c$. For $n gg 0$ say [ f^I_J(n) = a_c(n)n^c + a_{c-1}(n)n^{c-1} + text{lower terms}, ] where for $i = 0, ldots, c$, $a_i colon mathbb{N} rt mathbb{Z}$ are periodic functions of period $g$ and $a_c eq 0$. In an earlier paper we (together with Herzog and Verma) proved that $dim I_n(J)/I^n$ is constant for $n gg 0$ and $a_c(-)$ is a constant. In this paper we prove that if $I$ is generated by some elements of the same degree and height $I geq 2$ then $a_{c-1}(-)$ is also a constant.
An explicit combinatorial minimal free resolution of an arbitrary monomial ideal $I$ in a polynomial ring in $n$ variables over a field of characteristic $0$ is defined canonically, without any choices, using higher-dimensional generalizations of combined spanning trees for cycles and cocycles (hedges) in the upper Koszul simplicial complexes of $I$ at lattice points in $mathbb{Z}^n$. The differentials in these sylvan resolutions are expressed as matrices whose entries are sums over lattice paths of weights determined combinatorially by sequences of hedges (hedgerows) along each lattice path. This combinatorics enters via an explicit matroidal expression for the Moore-Penrose pseudoinverses of the differentials in any CW complex as weighted averages of splittings defined by hedges. This Hedge Formula also yields a projection formula from CW chains to boundaries. The translation from Moore-Penrose combinatorics to free resolutions relies on Wall complexes, which construct minimal free resolutions of graded ideals from vertical splittings of Koszul bicomplexes. The algebra of Wall complexes applied to individual hedgerows yields explicit but noncanonical combinatorial minimal free resolutions of arbitrary monomial ideals in any characteristic.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
