Related papers: Nearly Gorenstein rings arising from finite graphs
A classification is given of all the countable homogeneous ordered bipartite graphs.
Graphs derived from groups are a widely studied class of graphs, motivated by their highly symmetric structure. In particular, G-graphs offer an easy and interesting alternative construction of semi-symmetric graphs. After recalling the…
The notion of almost Gorenstein local ring introduced by V. Barucci and R. Fr\"oberg for one-dimensional Noetherian local rings which are analytically unramified has been generalized by S. Goto, N. Matsuoka and T. T. Phuong to…
We introduce a new class of algebras arising from graphs, called binomial edge rings. Given a graph $G$ on $d$ vertices with $n$ edges, the binomial edge ring of $G$ is defined to be the subalgebra of the polynomial ring with $2d$ variables…
We prove that any quasirandom uniform hypergraph $H$ can be approximately decomposed into any collection of bounded degree hypergraphs with almost as many edges. In fact, our results also apply to multipartite hypergraphs and even to the…
The perfectly matchable subgraph polytope of a graph is a (0,1)-polytope associated with the vertex sets of matchings in the graph. In this paper, we study algebraic properties (compressedness, Gorensteinness) of the toric rings of…
Levelness and nearly Gorensteinness are well-studied properties of graded rings as a generalized notion of Gorensteinness. In this paper, we compare the strength of these properties. For any Cohen-Macaulay homogeneous affine semigroup ring…
Gorenstein Fano polytopes arising from finite partially ordered sets will be introduced. Then we study the problem which partially ordered sets yield smooth Fano polytopes.
Given a finite connected bipartite graph, finite-dimensional indecomposable semisimple Leibniz algebras are constructed. Furthermore, any finite-dimensional indecomposable semisimple Leibniz algebra admits a similar construction.
We study the family of graphs whose number of primitive cycles equals its cycle rank. It is shown that this family is precisely the family of ring graphs. Then we study the complete intersection property of toric ideals of bipartite graphs…
It is not hard to find many complete bipartite graphs which are not determined by their spectra. We show that the graph obtained by deleting an edge from a complete bipartite graph is determined by its spectrum. We provide some graphs, each…
In finite graphs, finite-order tangles offer an abstract description of highly connected substructures. In infinite graphs, infinite-order tangles compactify the graphs in the same way the ends compactify connected locally finite graphs.…
We define, via Gorenstein homomorphisms, a class of local rings over which there exist non-trivial totally reflexive modules. We also provide a general construction of such rings, which indicates their abundance.
We classify which complete multipartite graphs are intrinsically chiral.
We define a notion of Gorenstein flat dimension for unbounded complexes over left GF-closed rings. Over Gorenstein rings we introduce a notion of Gorenstein cohomology for complexes; we also define a generalized Tate cohomology for…
Working in any model theoretic structure, we single out a class of definable bipartite graphs that admit definable, close to perfect matchings. We use this result to prove a strengthening of Tarski's theorem for the definable setting.
Let G and F be finitely generated groups with infinitely many ends and let A and B be graph of groups decompositions of F and G such that all edge groups are finite and all vertex groups have at most one end. We show that G and F are…
In this article, we give a complete characterization of semigroup graded rings which are graded von Neumann regular. We also demonstrate our results by applying them to several classes of examples, including matrix rings and groupoid graded…
In this paper, we introduce generalized Gorenstein local (GGL) rings. The notion of GGL rings is a natural generalization of the notion of almost Gorenstein rings, which can thus be treated as part of the theory of GGL rings. For a…
We introduce several commutative rings, the snake rings, that have strong connections to cluster algebras. The elements of these rings are residue classes of unions of certain labeled graphs that were used to construct canonical bases in…