نتایج جستجو برای: castelnuovo mumford regularity

تعداد نتایج: 23714  

2001
LÊ TUÂN HOA NGÔ VIÊT TRUNG

We prove asymptotic linear bounds for the Castelnuovo-Mumford regularity of certain filtrations of homogeneous ideals whose Rees algebras need not be Noetherian.

Journal: :bulletin of the iranian mathematical society 0
m. r. fander ‎‎science and research branch‎, ‎islamic azad university‎ ‎(iau)‎, ‎tehran‎, ‎iran.

it is shown that when a special vertex stretching is applied to a graph, the cochordal cover number of the graph increases exactly by one, as it happens to its induced matching number and (castelnuovo-mumford) regularity. as a consequence, it is shown that the induced matching number and cochordal cover number of a special vertex stretching of a graph g are equal provided g is well-covered bipa...

Journal: :journal of algebra and related topics 2015
s. yang l. chu y. qian

let $r=k[x_1,x_2,cdots, x_n]$ be a polynomial ring over a field $k$. we prove that for any positive integers $m, n$, $text{reg}(i^mj^nk)leq mtext{reg}(i)+ntext{reg}(j)+text{reg}(k)$ if $i, j, ksubseteq r$ are three monomial complete intersections ($i$, $j$, $k$ are not necessarily proper ideals of the polynomial ring $r$), and $i, j$ are of the form $(x_{i_1}^{a_1}, x_{i_2}^{a_2}, cdots, x_{i_l...

‎A recent result due to Ha and Van Tuyl proved that the Castelnuovo-Mumford regularity of the quotient ring $R/I(G)$ is at most matching number of $G$‎, ‎denoted by match$(G)$‎. ‎In this paper‎, ‎we provide a generalization of this result for powers of edge ideals‎. ‎More precisely‎, ‎we show that for every graph $G$ and every $sgeq 1$‎, ‎$${rm reg}( R‎/ ‎I(G)^{s})leq (2s-1) |E(G)|^{s-1} {rm ma...

It is shown that when a special vertex stretching is applied to a graph, the cochordal cover number of the graph increases exactly by one, as it happens to its induced matching number and (Castelnuovo-Mumford) regularity. As a consequence, it is shown that the induced matching number and cochordal cover number of a special vertex stretching of a graph G are equal provided G is well-covered bipa...

Journal: :Proceedings of the American Mathematical Society 1999

2008
Kristina Crona

We give a new short proof of the fact that the CastelnuovoMumford regularity of a strongly stable ideal is the highest degree of a minimal monomial generator. Our proof depends on results due to D. Maclagan and G. Smith on multigraded regularity. More precisely, we construct a Stanley filtration for strongly stable ideals which provides a bound for the Castelnuovo-Mumford regularity.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید