اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدLevelness versus almost Gorensteinness of edge rings of complete multipartite graphs
186
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Levelness and almost Gorensteinness are well-studied properties on graded rings as a generalized notion of Gorensteinness. In the present paper, we study those properties for the edge rings of the complete multipartite graphs, denoted by $Bbbk[K_{r_1,ldots,r_n}]$ with $1 leq r_1 leq cdots leq r_n$. We give the complete characterization of which $Bbbk[K_{r_1,ldots,r_n}]$ is level in terms of $n$ and $r_1,ldots,r_n$. Similarly, we also give the complete characterization of which $Bbbk[K_{r_1,ldots,r_n}]$ is almost Gorenstein in terms of $n$ and $r_1,ldots,r_n$.
قيم البحث
اقرأ أيضاً
The first goal of the present paper is to study the class groups of the edge rings of complete multipartite graphs, denoted by $Bbbk[K_{r_1,ldots,r_n}]$, where $1 leq r_1 leq cdots leq r_n$. More concretely, we prove that the class group of $Bbbk[K_{
r_1,ldots,r_n}]$ is isomorphic to $mathbb{Z}^n$ if $n =3$ with $r_1 geq 2$ or $n geq 4$, while it turns out that the excluded cases can be deduced into Hibi rings. The second goal is to investigate the special class of divisorial ideals of $Bbbk[K_{r_1,ldots,r_n}]$, called conic divisorial ideals. We describe conic divisorial ideals for certain $K_{r_1,ldots,r_n}$ including all cases where $Bbbk[K_{r_1,ldots,r_n}]$ is Gorenstein. Finally, we give a non-commutative crepant resolution (NCCR) of $Bbbk[K_{r_1,ldots,r_n}]$ in the case where it is Gorenstein.
The second Veronese ideal $I_n$ contains a natural complete intersection $J_n$ generated by the principal $2$-minors of a symmetric $(ntimes n)$-matrix. We determine subintersections of the primary decomposition of $J_n$ where one intersectand is omi
tted. If $I_n$ is omitted, the result is the other end of a complete intersection link as in liaison theory. These subintersections also yield interesting insights into binomial ideals and multigraded algebra. For example, if $n$ is even, $I_n$ is a Gorenstein ideal and the intersection of the remaining primary components of $J_n$ equals $J_n+langle f rangle$ for an explicit polynomial $f$ constructed from the fibers of the Veronese grading map.
We study properties of the Stanley-Reisner rings of simplicial complexes with isolated singularities modulo two generic linear forms. Miller, Novik, and Swartz proved that if a complex has homologically isolated singularities, then its Stanley-Reisne
r ring modulo one generic linear form is Buchsbaum. Here we examine the case of non-homologically isolated singularities, providing many examples in which the Stanley-Reisner ring modulo two generic linear forms is a quasi-Buchsbaum but not Buchsbaum ring.
An edge-coloring of a graph $G$ with colors $1,2,ldots,t$ is an interval $t$-coloring if all colors are used, and the colors of edges incident to each vertex of $G$ are distinct and form an interval of integers. A graph $G$ is interval colorable if i
t has an interval $t$-coloring for some positive integer $t$. For an interval colorable graph $G$, $W(G)$ denotes the greatest value of $t$ for which $G$ has an interval $t$-coloring. It is known that the complete graph is interval colorable if and only if the number of its vertices is even. However, the exact value of $W(K_{2n})$ is known only for $n leq 4$. The second author showed that if $n = p2^q$, where $p$ is odd and $q$ is nonnegative, then $W(K_{2n}) geq 4n-2-p-q$. Later, he conjectured that if $n in mathbb{N}$, then $W(K_{2n}) = 4n - 2 - leftlfloorlog_2{n}rightrfloor - left | n_2 right |$, where $left | n_2 right |$ is the number of $1$s in the binary representation of $n$. In this paper we introduce a new technique to construct interval colorings of complete graphs based on their 1-factorizations, which is used to disprove the conjecture, improve lower and upper bounds on $W(K_{2n})$ and determine its exact values for $n leq 12$.
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).
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
