Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userAn alternative algorithm for computing the Betti table of a monomial ideal
174
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
In this paper we develop a new technique to compute the Betti table of a monomial ideal. We present a prototype implementation of the resulting algorithm and we perform numerical experiments suggesting a very promising efficiency. On the way of describing the method, we also prove new constraints on the shape of the possible Betti tables of a monomial ideal.
rate research
Read More
Let $K$ be a field and $S = K[x_1,dots,x_n]$ be a polynomial ring over $K$. We discuss the behaviour of the extremal Betti numbers of the class of squarefree strongly stable ideals. More precisely, we give a numerical characterization of the possible extremal Betti numbers (values as well as positions) of such a class of squarefree monomial ideals.
We introduce the combinatorial Lyubeznik resolution of monomial ideals. We prove that this resolution is isomorphic to the usual Lyubezbnik resolution. As an application, we give a combinatorial method to determine if an ideal is a Lyubeznik ideal. Furthermore, the minimality of the Lyubeznik resolution is characterized and we classify all the Lyubeznik symbols using combinatorial criteria. We get a combinatorial expression for the projective dimension, the length of Lyubeznik, and the arithmetical rank of a monomial ideal. We define the Lyubeznik totally ideals as those ideals that yield a minimal free resolution under any total order. Finally, we present that for a family of graphics, that their edge ideals are Lyubeznik totally ideals.
Independent sets play a key role into the study of graphs and important problems arising in graph theory reduce to them. We define the monomial ideal of independent sets associated to a finite simple graph and describe its homological and algebraic invariants in terms of the combinatorics of the graph. We compute the minimal primary decomposition and characterize the Cohen--Macaulay ideals. Moreover, we provide a formula for computing the Betti numbers, which depends only on the coefficients of the independence polynomial of the graph.
Let $S_n$ be a polynomial ring with $n$ variables over a field and ${I_n}_{n geq 1}$ a chain of ideals such that each $I_n$ is a monomial ideal of $S_n$ fixed by permutations of the variables. In this paper, we present a way to determine all nonzero positions of Betti tables of $I_n$ for all large intergers $n$ from the $mathbb Z^m$-graded Betti table of $I_m$ for some integer $m$. Our main result shows that the projective dimension and the regularity of $I_n$ eventually become linear functions on $n$, confirming a special case of conjectures posed by Le, Nagel, Nguyen and Romer.
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 homogeneous complete intersection, then subadditivity holds for $R/I$. We then study a conjecture of Avramov, Conca and Iyengar on subadditivity, when $I$ is a monomial ideal with $R/I$ Koszul. We identify several classes of edge ideals of graphs $G$ such that the subadditivity holds for $R/I(G)$. We then study the strand connectivity of edge ideals and obtain several classes of graphs whose edge ideals are strand connected. Finally, we compute upper bounds for multigraded Betti numbers of several classes of edge ideals.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
