اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدThe combinatorial calculation of algebraic invariants of a monomial ideal
75
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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 i
nvariants 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.
In this thesis we are interested in describing some homological invariants of certain classes of monomial ideals. We will pay attention to the squarefree and non-squarefree lexsegment ideals.
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 descr
ibing the method, we also prove new constraints on the shape of the possible Betti tables of a monomial ideal.
Let $G$ be a simple graph and $I(G)$ be its edge ideal. In this article, we study the Castelnuovo-Mumford regularity of symbolic powers of edge ideals of join of graphs. As a consequence, we prove Minhs conjecture for wheel graphs, complete multipart
ite graphs, and a subclass of co-chordal graphs. We obtain a class of graphs whose edge ideals have regularity three. By constructing graphs, we prove that the multiplicity of edge ideals of graphs is independent from the depth, dimension, regularity, and degree of $h$-polynomial. Also, we demonstrate that the depth of edge ideals of graphs is independent from the regularity and degree of $h$-polynomial by constructing graphs.
Let C be a uniform clutter, i.e., all the edges of C have the same size, and let A be the incidence matrix of C. We denote the column vectors of A by v1,...,vq. The vertex covering number of C, denoted by g, is the smallest number of vertices in any
minimal vertex cover of C. Under certain conditions we prove that C is vertex critical. If C satisfies the max-flow min-cut property, we prove that A diagonalizes over the integers to an identity matrix and that v1,...,vq is a Hilbert basis. It is shown that if C has a perfect matching such that C has the packing property and g=2, then A diagonalizes over the integers to an identity matrix. If A is a balanced matrix we prove that any regular triangulation of the cone generated by v1,...,vq is unimodular. Some examples are presented to show that our results only hold for uniform clutters. These results are closely related to certain algebraic properties, such as the normality or torsion freeness, of blowup algebras of edge ideals and to finitely generated abelian groups. They are also related to the theory of Grobner bases of toric ideals and to Ehrhart rings.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
