اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدLefschetz properties for complete intersection ideals generated by products of linear forms
367
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper, we study the strong Lefschetz property of artinian complete intersection ideals generated by products of linear forms. We prove the strong Lefschetz property for a class of such ideals with binomial generators.
قيم البحث
اقرأ أيضاً
We prove the strong Lefschetz property for certain complete intersections defined by products of linear forms, using a characterization of the strong Lefschetz property in terms of central simple modules.
We settle a conjecture by Migliore, Miro-Roig, and Nagel which gives a classification of the Weak Lefschetz property for almost complete intersections generated by uniform powers of general linear forms.
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 study the WLP and SLP of artinian monomial ideals in $S=mathbb{K}[x_1,dots ,x_n]$ via studying their minimal free resolutions. We study the Lefschetz properties of such ideals where the minimal free resolution of $S/I$ is linear for at least $n-2$
steps. We give an affirmative answer to a conjecture of Eisenbud, Huneke and Ulrich for artinian monomial ideals with almost linear resolutions.
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.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
