اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدBouquet algebra of toric ideals
278
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
To any toric ideal $I_A$, encoded by an integer matrix $A$, we associate a matroid structure called {em the bouquet graph} of $A$ and introduce another toric ideal called {em the bouquet ideal} of $A$. We show how these objects capture the essential combinatorial and algebraic information about $I_A$. Passing from the toric ideal to its bouquet ideal reveals a structure that allows us to classify several cases. For example, on the one end of the spectrum, there are ideals that we call {em stable}, for which bouquets capture the complexity of various generating sets as well as the minimal free resolution. On the other end of the spectrum lie toric ideals whose various bases (e.g., minimal generating sets, Grobner, Graver bases) coincide. Apart from allowing for classification-type results, bouquets provide a new way to construct families of examples of toric ideals with various interesting properties, such as robustness, genericity, and unimodularity. The new bouquet framework can be used to provide a characterization of toric ideals whose Graver basis, the universal Grobner basis, any reduced Grobner basis and any minimal generating set coincide.
قيم البحث
اقرأ أيضاً
Relying on the combinatorial classification of toric ideals using their bouquet structure, we focus on toric ideals of hypergraphs and study how they relate to general toric ideals. We show that hypergraphs exhibit a surprisingly general behavior: th
e toric ideal associated to any general matrix can be encoded by that of a $0/1$ matrix, while preserving the essential combinatorics of the original ideal. We provide two universality results about the unboundedness of degrees of various generating sets: minimal, Graver, universal Grobner bases, and indispensable binomials. Finally, we provide a polarization-type operation for arbitrary positively graded toric ideals, which preserves all the combinatorial signatures and the homological properties of the original toric ideal.
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$.
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.
In this paper we study monomial ideals attached to posets, introduce generalized Hibi rings and investigate their algebraic and homological properties. The main tools to study these objects are Groebner basis theory, the concept of sortability due to
Sturmfels and the theory of weakly polymatroidal ideals.
In the present paper, we prove that the toric ideals of certain $s$-block diagonal matching fields have quadratic Grobner bases. Thus, in particular, those are quadratically generated. By using this result, we provide a new family of toric degenerations of Grassmannians.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
