اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدRegularity of powers of quadratic sequences with applications to binomial ideals
135
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this article, we obtain an upper bound for the Castelnuovo-Mumford regularity of powers of an ideal generated by a homogeneous quadratic sequence in a polynomial ring in terms of the regularity of its related ideals and degrees of its generators. As a consequence, we compute upper bounds for the regularity of powers of several binomial ideals. We generalize a result of Matsuda and Murai to show that the regularity of $J^s_G$ is bounded below by $2s+ell(G)-1$ for all $s geq 1$, where $J_G$ denotes the binomial edge ideal of a graph $G$ and $ell(G)$ is the length of a longest induced path in $G$. We compute the regularity of powers of binomial edge ideals of cycle graphs, star graphs, and balloon graphs explicitly. Also, we give sharp bounds for the regularity of powers of almost complete intersection binomial edge ideals and parity binomial edge ideals.
قيم البحث
اقرأ أيضاً
Let $J_G$ be the binomial edge ideal of a graph $G$. We characterize all graphs whose binomial edge ideals, as well as their initial ideals, have regularity $3$. Consequently we characterize all graphs $G$ such that $J_G$ is extremal Gorenstein. Inde
ed, these characterizations are consequences of an explicit formula we obtain for the regularity of the binomial edge ideal of the join product of two graphs. Finally, by using our regularity formula, we discuss some open problems in the literature. In particular we disprove a conjecture in cite{CDI} on the regularity of weakly closed graphs.
In this article, we prove that for several classes of graphs, the Castelnuovo-Mumford regularity of symbolic powers of their edge ideals coincide with that of their ordinary powers.
This paper is concerned with the question of whether geometric structures such as cell complexes can be used to simultaneously describe the minimal free resolutions of all powers of a monomial ideal. We provide a full answer in the case of square-fre
e monomial ideals of projective dimension one, by introducing a combinatorial construction of a family of (cubical) cell complexes whose 1-skeletons are powers of a graph that supports the resolution of the ideal.
In this paper we prove the conjectured upper bound for Castelnuovo-Mumford regularity of binomial edge ideals posed in [23], in the case of chordal graphs. Indeed, we show that the regularity of any chordal graph G is bounded above by the number of m
aximal cliques of G, denoted by c(G). Moreover, we classify all chordal graphs G for which L(G) = c(G), where L(G) is the sum of the lengths of longest induced paths of connected components of G. We call such graphs strongly interval graphs. Moreover, we show that the regularity of a strongly interval graph G coincides with L(G) as well as c(G).
In this article, we study the regularity of integral closure of powers of edge ideals. We obtain a lower bound for the regularity of integral closure of powers of edge ideals in terms of induced matching number of graphs. We prove that the regularity
of integral closure of powers of edge ideals of graphs with at most two odd cycles is the same as the regularity of their powers.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
