اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدCombinatorics of binomial primary decomposition
213
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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 binomial 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.
قيم البحث
اقرأ أيضاً
Building on coprincipal mesoprimary decomposition [Kahle and Miller, 2014], we combinatorially construct an irreducible decomposition of any given binomial ideal. In a parallel manner, for congruences in commutative monoids we construct decomposition
s that are direct combinatorial analogues of binomial irreducible decompositions, and for binomial ideals we construct decompositions into ideals that are as irreducible as possible while remaining binomial. We provide an example of a binomial ideal that is not an intersection of binomial irreducible ideals, thus answering a question of Eisenbud and Sturmfels [1996].
We determine the Castelnuovo-Mumford regularity of binomial edge ideals of complement reducible graphs (cographs). For cographs with $n$ vertices the maximum regularity grows as $2n/3$. We also bound the regularity by graph theoretic invariants and c
onstruct a family of counterexamples to a conjecture of Hibi and Matsuda.
Let $J_G$ be the binomial edge ideal of a graph $G$. We characterize all graphs whose binomial edge ideals, as well as their initial ideals, have regularity $3$. Consequently we characterize all graphs $G$ such that $J_G$ is extremal Gorenstein. Inde
ed, these characterizations are consequences of an explicit formula we obtain for the regularity of the binomial edge ideal of the join product of two graphs. Finally, by using our regularity formula, we discuss some open problems in the literature. In particular we disprove a conjecture in cite{CDI} on the regularity of weakly closed graphs.
We introduce differential primary decompositions for ideals in a commutative ring. Ideal membership is characterized by differential conditions. The minimal number of conditions needed is the arithmetic multiplicity. Minimal differential primary deco
mpositions are unique up to change of bases. Our results generalize the construction of Noetherian operators for primary ideals in the analytic theory of Ehrenpreis-Palamodov, and they offer a concise method for representing affine schemes. The case of modules is also addressed. We implemented an algorithm in Macaulay2 that computes the minimal decomposition for an ideal in a polynomial ring.
In this paper we prove the conjectured upper bound for Castelnuovo-Mumford regularity of binomial edge ideals posed in [23], in the case of chordal graphs. Indeed, we show that the regularity of any chordal graph G is bounded above by the number of m
aximal cliques of G, denoted by c(G). Moreover, we classify all chordal graphs G for which L(G) = c(G), where L(G) is the sum of the lengths of longest induced paths of connected components of G. We call such graphs strongly interval graphs. Moreover, we show that the regularity of a strongly interval graph G coincides with L(G) as well as c(G).
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
