اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدWhen does depth stabilize early on?
55
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper we study graded ideals I in a polynomial ring S such that the numerical function f(k)=depth(S/I^k) is constant. We show that, if (i) the Rees algebra of I is Cohen-Macaulay, (ii) the cohomological dimension of I is not larger than the projective dimension of S/I and (iii) the K-algebra generated by some generators of I is a direct summand of S, then f(k) is constant. When I is a square-free monomial ideal, the above criterion includes as special cases all the results of a recent paper by Herzog and Vladoiu. In this combinatorial setting there is a chance that the converse of the above fact holds true.
قيم البحث
اقرأ أيضاً
The effect of the Gauss-Bonnet term on the existence and dynamical stability of thin-shell wormholes as negative tension branes is studied in the arbitrary dimensional spherically, planar, and hyperbolically symmetric spacetimes. We consider radial p
erturbations against the shell for the solutions which have the Z${}_2$ symmetry and admit the general relativistic limit. It is shown that the Gauss-Bonnet term shrinks the parameter region admitting static wormholes. The effect of the Gauss-Bonnet term on the stability depends on the spacetime symmetry. For planar symmetric wormholes, the Gauss-Bonnet term does not affect their stability. If the coupling constant is positive but small, the Gauss-Bonnet term tends to destabilize spherically symmetric wormholes, while it stabilizes hypebolically symmetric wormholes. The Gauss-Bonnet term can destabilize hypebolically symmetric wormholes as a non-perturbative effect, however, spherically symmetric wormholes cannot be stable.
Let $K$ be a field and $S=K[x_1,...,x_n]$. In 1982, Stanley defined what is now called the Stanley depth of an $S$-module $M$, denoted $sdepth(M)$, and conjectured that $depth(M) le sdepth(M)$ for all finitely generated $S$-modules $M$. This conjectu
re remains open for most cases. However, Herzog, Vladoiu and Zheng recently proposed a method of attack in the case when $M = I / J$ with $J subset I$ being monomial $S$-ideals. Specifically, their method associates $M$ with a partially ordered set. In this paper we take advantage of this association by using combinatorial tools to analyze squarefree Veronese ideals in $S$. In particular, if $I_{n,d}$ is the squarefree Veronese ideal generated by all squarefree monomials of degree $d$, we show that if $1le dle n < 5d+4$, then $sdepth(I_{n,d})= floor{binom{n}{d+1}Big/binom{n}{d}}+d$, and if $dgeq 1$ and $nge 5d+4$, then $d+3le sdepth(I_{n,d}) le floor{binom{n}{d+1}Big/binom{n}{d}}+d$.
Let $(A,mathfrak{m})$ be an analytically unramified formally equidimensional Noetherian local ring with $ depth A geq 2$. Let $I$ be an $mathfrak{m}$-primary ideal and set $I^*$ to be the integral closure of $I$. Set $G^*(I) = bigoplus_{ngeq 0} (I^n
)^*/(I^{n+1})^*$ be the associated graded ring of the integral closure filtration of $I$. We prove that $ depth G^*(I^n) geq 2$ for all $n gg 0$. As an application we prove that if $A$ is also an excellent normal domain containing an algebraically closed field isomorphic to $A/m$ then there exists $s_0$ such that for all $s geq s_0$ and $J$ is an integrally closed ideal emph{strictly} containing $(mathfrak{m}^s)^*$ then we have a strict inequality $mu(J) < mu((mathfrak{m}^s)^*)$ (here $mu(J)$ is the number of minimal generators of $J$).
The problem of finding completely positive matrices with equal cp-rank and rank is considered. We give some easy-to-check sufficient conditions on the entries of a doubly nonnegative matrix for it to be completely positive with equal cp-rank and rank
. An algorithm is also presented to show its efficiency.
Despite the reported success of unsupervised machine translation (MT), the field has yet to examine the conditions under which these methods succeed, and where they fail. We conduct an extensive empirical evaluation of unsupervised MT using dissimila
r language pairs, dissimilar domains, diverse datasets, and authentic low-resource languages. We find that performance rapidly deteriorates when source and target corpora are from different domains, and that random word embedding initialization can dramatically affect downstream translation performance. We additionally find that unsupervised MT performance declines when source and target languages use different scripts, and observe very poor performance on authentic low-resource language pairs. We advocate for extensive empirical evaluation of unsupervised MT systems to highlight failure points and encourage continued research on the most promising paradigms.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
