اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدThe derived category of a locally complete intersection ring
98
0
0.0
(
0
)
تأليف
Josh Pollitz
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper, we answer a question of Dwyer, Greenlees, and Iyengar by proving a local ring $R$ is a complete intersection if and only if every complex of $R$-modules with finitely generated homology is proxy small. Moreover, we establish that a commutative noetherian ring $R$ is locally a complete intersection if and only if every complex of $R$-modules with finitely generated homology is virtually small.
قيم البحث
اقرأ أيضاً
We give an exposition and generalization of Orlovs theorem on graded Gorenstein rings. We show the theorem holds for non-negatively graded rings which are Gorenstein in an appropriate sense and whose degree zero component is an arbitrary non-commutat
ive right noetherian ring of finite global dimension. A short treatment of some foundations for local cohomology and Grothendieck duality at this level of generality is given in order to prove the theorem. As an application we give an equivalence of the derived category of a commutative complete intersection with the homotopy category of graded matrix factorizations over a related ring.
Let $(A,mathfrak{m})$ be a complete intersection with $k = A/mathfrak{m}$ algebraically closed. Let CMS(A) be the stable category of maximal CM $A$-modules. For a large class of thick subcategories $mathcal{S}$ of CMS(A) we show that there is a theor
y of support varieties for the Verdier quotient $mathcal{T} = $ CMS(A)$/mathcal{S}$. As an application we show that the analogous version of Auslander-Reiten conjecture, Murthys result, Avramov-Buchweitz result on symmetry of vanishing of cohomology holds for $mathcal{T}$.
In this paper we completely characterize lattice ideals that are complete intersections or equivalently complete intersections finitely generated semigroups of $bz^noplus T$ with no invertible elements, where $T$ is a finite abelian group. We also ch
aracterize the lattice ideals that are set-theoretic complete intersections on binomials.
We characterize the graphs $G$ for which their toric ideals $I_G$ are complete intersections. In particular we prove that for a connected graph $G$ such that $I_G$ is complete intersection all of its blocks are bipartite except of at most two. We pro
ve that toric ideals of graphs which are complete intersections are circuit ideals. The generators of the toric ideal correspond to even cycles of $G$ except of at most one generator, which corresponds to two edge disjoint odd cycles joint at a vertex or with a path. We prove that the blocks of the graph satisfy the odd cycle condition. Finally we characterize all complete intersection toric ideals of graphs which are normal.
Our purpose is to study the family of simple undirected graphs whose toric ideal is a complete intersection from both an algorithmic and a combinatorial point of view. We obtain a polynomial time algorithm that, given a graph $G$, checks whether its
toric ideal $P_G$ is a complete intersection or not. Whenever $P_G$ is a complete intersection, the algorithm also returns a minimal set of generators of $P_G$. Moreover, we prove that if $G$ is a connected graph and $P_G$ is a complete intersection, then there exist two induced subgraphs $R$ and $C$ of $G$ such that the vertex set $V(G)$ of $G$ is the disjoint union of $V(R)$ and $V(C)$, where $R$ is a bipartite ring graph and $C$ is either the empty graph, an odd primitive cycle, or consists of two odd primitive cycles properly connected. Finally, if $R$ is $2$-connected and $C$ is connected, we list the families of graphs whose toric ideals are complete intersection.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
