Related papers: Nearly Gorenstein rings arising from finite graphs
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…
One of the main results of this paper is the characterization of the rings over which all modules are strongly Gorenstein projective. We show that these kinds of rings are very particular cases of the well-known quasi-Frobenius rings. We…
The non-Gorenstein locus of stable set rings of finite simple perfect graphs is studied. We describe combinatorially those perfect graphs whose stable set rings are Gorenstein on the punctured spectrum. In addition, we show that, in…
We extend the notion of type sequence to rings that are not necessarily residually rational. Using this invariant we characterize different types of rings as almost Gorenstein rings and rings of maximal length.
In this paper, we give a criterion of the Gorenstein property of the Ehrhart ring of the stable set polytope of an h-perfect graph: the Ehrhart ring of the stable set polytope of an h-perfect graph $G$ is Gorenstein if and only if (1) sizes…
A $k$-regular graph of girth $g$ is called edge-girth-regular graph, shortly egr-graph, if each of its edges is contained in exactly $\lambda$ distinct $g-$cycles. An egr-graph is called extremal for the triple $(k, g, \lambda)$ if has the…
We classify the finite connected simple graphs whose edge rings are strongly Koszul. From the classification, it follows that if the edge ring is strongly Koszul, then its toric ideal possesses a quadratic Gr\"obner basis.
Let $A$ be an excellent two-dimensional normal local ring containing an algebraically closed field. Then $A$ is called an elliptic singularity if $p_f(A)=1$, where $p_f$ denotes the fundamental genus. On the other hand, the concept of…
Semi-standard graded rings are a generalized notion of standard graded rings. In this paper, we compare generalized notions of the Gorenstein property in semi-standard graded rings. We discuss the commonalities between standard graded rings…
Due to their elegant and simple nature, unitary Cayley graphs have been an active research topic in the literature. These graphs are naturally connected to several branches of mathematics, including number theory, finite algebra,…
This paper considers graded near-rings over a monoid G as a generalizations of the graded rings over groups, introduce certain innovative graded weakly prime ideals and graded almost prime ideals as a generalizations of graded prime ideals…
A near-factor of a finite simple graph $G$ is a matching that saturates all vertices except one. A graph $G$ is said to be near-factor-critical if the deletion of any vertex from $G$ results in a subgraph that has a near-factor. We prove…
Let $(R,\mathfrak{m})$ be a two-dimensional regular local ring with infinite residue class field. Then the Rees algebra $\mathcal{R} (I)= \bigoplus_{n \ge 0}I^n$ of $I$ is an almost Gorenstein graded ring in the sense of…
A countable, bounded degree graph is almost finite if it has a tiling with isomorphic copies of finitely many F\o lner sets, and we call it strongly almost finite, if the tiling can be randomized so that the probability that a vertex is on…
We investigate the nearly Gorenstein property among $d$-dimensional cyclic quotient singularities $\Bbbk[[x_1,\dots,x_d]]^G$, where $\Bbbk$ is an algebraically closed field and $G\subseteq{\rm GL}(d,\Bbbk)$ is a finite small cyclic group…
We study the graphs formed from instances of the stable matching problem by connecting pairs of elements with an edge when there exists a stable matching in which they are matched. Our results include the NP-completeness of recognizing…
Several polytopes arise from finite graphs. For edge and symmetric edge polytopes, in particular, exhaustive computation of the Ehrhart polynomials not merely supports the conjecture of Beck {\it et al.}\ that all roots $\alpha$ of Ehrhart…
This article provides structural characterization of simple graphs whose edge-set can be partitioned into maximum matchings. We use Vizing's classification of simple graphs based on edge chromatic index.
We characterize the Gorensteinness of endomorphism rings of a fractional ideal on a curve singularity by stability of the ideal and a condition on its value semigroup ideal. Moreover, the Gorenstein algebroid curves with only Gorenstein…
In this paper, we prove that if Cohen-Macaulay local/graded rings $R_1$, $R_2$ and $R$ satisfy certain conditions regarding multiplicity and Cohen-Macaulay type, then almost Gorenstein property of $R$ implies Gorenstein properties for all…