Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userOn the diameter of an ideal
54
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We begin the study of the notion of diameter of an ideal I of a polynomial ring S over a field, an invariant measuring the distance between the minimal primes of I. We provide large classes of Hirsch ideals, i.e. ideals with diameter not larger than the codimension, such as: quadratic radical ideals of codimension at most 4 and such that S/I is Gorenstein, or ideals admitting a square-free complete intersection initial ideal.
rate research
Read More
We study the equality of the extremal Betti numbers of the binomial edge ideal $J_G$ and those of its initial ideal ${rm in}(J_G)$ of a closed graph $G$. We prove that in some cases there is an unique extremal Betti number for ${rm in}(J_G)$ and as a consequence there is an unique extremal Betti number for $J_G$ and these extremal Betti numbers are equal
We study the number of generators of ideals in regular rings and ask the question whether $mu(I)<mu(I^2)$ if $I$ is not a principal ideal, where $mu(J)$ denotes the number of generators of an ideal $J$. We provide lower bounds for the number of generators for the powers of an ideal and also show that the CM-type of $I^2$ is $geq 3$ if $I$ is a monomial ideal of height $n$ in $K[x_1,ldots,x_n]$ and $ngeq 3$.
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 $A={{bf a}_1,...,{bf a}_m} subset mathbb{Z}^n$ be a vector configuration and $I_A subset K[x_1,...,x_m]$ its corresponding toric ideal. The paper consists of two parts. In the first part we completely determine the number of different minimal systems of binomial generators of $I_A$. We also prove that generic toric ideals are generated by indispensable binomials. In the second part we associate to $A$ a simplicial complex $Delta _{ind(A)}$. We show that the vertices of $Delta_{ind(A)}$ correspond to the indispensable monomials of the toric ideal $I_A$, while one dimensional facets of $Delta_{ind(A)}$ with minimal binomial $A$-degree correspond to the indispensable binomials of $I_{A}$.
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.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
