相关论文: Nearly Gorenstein rings arising from finite graphs

We prove two characterisations of accessibility of locally finite quasi-transitive connected graphs. First, we prove that any such graph $G$ is accessible if and only if its set of separations of finite order is an ${\rm Aut}(G)$-finitely…

In this paper we investigate the question of when the determinantal ring $R$ over a field $k$ is an almost Gorenstein local/graded ring in the sense of Goto, Takahashi, and the author. As a consequence of the main result, we see that if $R$…

An integral convex polytope ${\mathcal P}$ is said to be Gorenstein if its toric ring $K[{\mathcal P}]$ is normal and Gorenstein. In this paper, Gorenstein cut polytopes of graphs are characterized explicitly. First, we prove that…

Reflexive polytopes which have the integer decomposition property are of interest. Recently, some large classes of reflexive polytopes with integer decomposition property coming from the order polytopes and the chain polytopes of finite…

Let $G$ be a simple graph on $n$ vertices and $\mathcal{I}_G$ denotes parity binomial edge ideal of $G$ in the polynomial ring $S = \mathbb{K}[x_1,\ldots, x_n, y_1, \ldots, y_n].$ We obtain a lower bound for the regularity of parity…

For an Ulrich ideal in a Gorenstein local ring, the quotient ring is again Gorenstein. Aiming to further develop the theory of Ulrich ideals, this paper investigates a naive question of how many non-principal ideals whose quotient rings are…

In this note, we mainly extend some Gorenstein homological properties from special rings (Noetherian or coherent rings ) to arbitrary rings by introducing the notions of Gorenstein weak injective and weak projective modules respectively.

In this paper we continue the study of prime graphs of finite solvable groups. The prime graph, or Gruenberg-Kegel graph, of a finite group G has vertices consisting of the prime divisors of the order of G and an edge from primes p to q if…

Let $H$ be a simple undirected graph. The family of all matchings of $H$ forms a simplicial complex called the matching complex of $H$. Here , we give a classification of all graphs with a Gorenstein matching complex. Also we study when the…

We prove that the invariably generating graph of a finite group can have an arbitrarily large number of connected components with at least two vertices.

Let $G$ and $G'$ be two right-angled Artin groups (RAAG). We show they are quasi-isometric iff they are isomorphic, under the assumption that $Out(G)$ and $Out(G')$ are finite. If only $Out(G)$ is finite, then $G'$ is quasi-isometric $G$…

We study properties of the resolution of almost Gorenstein artinian algebras $R/I,$ i.e. algebras defined by ideals $I$ such that $I=J+(f),$ with $J$ Gorenstein ideal and $f\in R.$ Such algebras generalize the well known almost complete…

Christos Athanasiadis studies an effective technique to show that Gorenstein sequences coming from compressed polytopes are unimodal. In the present paper we will use such the technique to find a rich class of Gorenstein toric rings with…

New homotopy invariant finiteness conditions on modules over commutative rings are introduced, and their properties are studied systematically. A number of finiteness results for classical homological invariants like flat dimension,…

We introduce new sufficient conditions for intrinsic knotting and linking. A graph on n vertices with at least 4n-9 edges is intrinsically linked. A graph on n vertices with at least 5n-14 edges is intrinsically knotted. We also classify…

Bounds on the minimum degree and on the number of vertices at- taining it have been much studied for finite edge-/vertex-minimally k- connected/k-edge-connected graphs. We give an overview of the results known for finite graphs, and show…

A graph is called $d$-rigid if there exists a generic embedding of its vertex set into $\mathbb{R}^d$ such that every continuous motion of the vertices that preserves the lengths of all edges actually preserves the distances between all…

We characterise the quintic (i.e. 5-regular) multigraphs with the property that every edge lies in a triangle. Such a graph is either from a set of small graphs or is formed by adding a perfect matching to a line graph of a cubic graph as…

Mixed graphs can be seen as digraphs with arcs and edges (or digons, that is, two opposite arcs). In this paper, we consider the case where such graphs are bipartite and in which the undirected and directed degrees are one. The best graphs,…

It is known that splittings of finitely presented groups over 2-ended groups can be characterized geometrically. We show that this characterization does not extend to all finitely generated groups. Answering a question of Kleiner we show…