20 research outputs found

    Shedding vertices and Ass-decomposable monomial ideals

    Full text link
    The shedding vertices of simplicial complexes are studied from an algebraic point of view. Based on this perspective, we introduce the class of ass-decomposable monomial ideals which is a generalization of the class of Stanley-Reisner ideals of vertex decomposable simplicial complexes. The recursive structure of ass-decomposable monomial ideals allows us to find a simple formula for the depth, and in squarefree case, an upper bound for the regularity of such ideals.Comment: 13 page

    The saturation number of monomial ideals

    Full text link
    Let S=K[x1,,xn]S=\mathbb{K}[x_1,\ldots, x_n] be the polynomial ring over a field K\mathbb{K} and m=(x1,,xn)\mathfrak{m}= (x_1, \ldots, x_n) be the irredundant maximal ideal of SS. For an ideal ISI \subset S, let sat(I)\mathrm{sat}(I) be the minimum number kk for which I ⁣:mk=I ⁣:mk+1I \colon \mathfrak{m}^k = I \colon \mathfrak{m}^{k+1}. In this paper, we compute the saturation number of irreducible monomial ideals and their powers. We apply this result to find the saturation number of the ordinary powers and symbolic powers of some families of monomial ideals in terms of the saturation number of irreducible components appearing in an irreducible decomposition of these ideals. Moreover, we give an explicit formula for the saturation number of monomial ideals in two variables

    Gr\"obner basis and Krull dimension of Lov\'asz-Saks-Sherijver ideal associated to a tree

    Full text link
    Let K\mathbb{K} be a field and nn be a positive integer. Let Γ=([n],E)\Gamma =([n], E) be a simple graph, where [n]={1,,n}[n]=\{1,\ldots, n\}. If S=K[x1,,xn,y1,,yn]S=\mathbb{K}[x_1, \ldots, x_n, y_1, \ldots, y_n] is a polynomial ring, then the graded ideal LΓK(2)=(xixj+yiyj ⁣:{i,j}E(Γ))S, L_\Gamma^\mathbb{K}(2) = \left( x_{i}x_{j} + y_{i}y_{j} \colon \quad \{i, j\} \in E(\Gamma)\right) \subset S, is called the Lov\'{a}sz-Saks-Schrijver ideal, LSS-ideal for short, of Γ\Gamma with respect to K\mathbb{K}. In the present paper, we compute a Gr\"obner basis of this ideal with respect to lexicographic ordering induced by x1>>xn>y1>>ynx_1>\cdots>x_n>y_1>\cdots>y_n when Γ=T\Gamma=T is a tree. As a result, we show that it is independent of the choice of the ground field K\mathbb{K} and compute the Hilbert series of LTK(2)L_T^\mathbb{K}(2). Finally, we present concrete combinatorial formulas to obtain the Krull dimension of S/LTK(2)S/L_T^\mathbb{K}(2) as well as lower and upper bounds for Krull dimension.Comment: 23 pages, 1 figur

    Monomial ideals with 3-linear resolutions

    Get PDF
    In this paper, we study Cstelnuovo-Mumford regularity of square-free monomial ideals generated in degree 3. We define some operations on the clutters associated to such ideals and prove that the regularity is conserved under these operations. We apply the operations to introduce some classes of ideals with linear resolutions and also show that any clutter corresponding to a triangulation of the sphere does not have linear resolution while any proper sub-clutter of it has a linear resolution.Comment: 11 page
    corecore