اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدMinimal systems of binomial generators and the indispensable complex of a toric ideal
103
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Let $A={{bf a}_1,...,{bf a}_m} subset mathbb{Z}^n$ be a vector configuration and $I_A subset K[x_1,...,x_m]$ its corresponding toric ideal. The paper consists of two parts. In the first part we completely determine the number of different minimal systems of binomial generators of $I_A$. We also prove that generic toric ideals are generated by indispensable binomials. In the second part we associate to $A$ a simplicial complex $Delta _{ind(A)}$. We show that the vertices of $Delta_{ind(A)}$ correspond to the indispensable monomials of the toric ideal $I_A$, while one dimensional facets of $Delta_{ind(A)}$ with minimal binomial $A$-degree correspond to the indispensable binomials of $I_{A}$.
قيم البحث
اقرأ أيضاً
Let $I_G$ be the toric ideal of a graph $G$. We characterize in graph theoretical terms the primitive, the minimal, the indispensable and the fundamental binomials of the toric ideal $I_G$.
Let $I$ be an arbitrary ideal generated by binomials. We show that certain equivalence classes of fibers are associated to any minimal binomial generating set of $I$. We provide a simple and efficient algorithm to compute the indispensable binomials
of a binomial ideal from a given generating set of binomials and an algorithm to detect whether a binomial ideal is generated by indispensable binomials.
We study the equality of the extremal Betti numbers of the binomial edge ideal $J_G$ and those of its initial ideal ${rm in}(J_G)$ of a closed graph $G$. We prove that in some cases there is an unique extremal Betti number for ${rm in}(J_G)$ and as a
consequence there is an unique extremal Betti number for $J_G$ and these extremal Betti numbers are equal
In this paper we introduce the concept of clique disjoint edge sets in graphs. Then, for a graph $G$, we define the invariant $eta(G)$ as the maximum size of a clique disjoint edge set in $G$. We show that the regularity of the binomial edge ideal of
$G$ is bounded above by $eta(G)$. This, in particular, settles a conjecture on the regularity of binomial edge ideals in full generality.
An explicit lattice point realization is provided for the primary components of an arbitrary binomial ideal in characteristic zero. This decomposition is derived from a characteristic-free combinatorial description of certain primary components of bi
nomial ideals in affine semigroup rings, namely those that are associated to faces of the semigroup. These results are intimately connected to hypergeometric differential equations in several variables.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
