中文
相关论文

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

200 篇论文

We consider three classes of random graphs: edge random graphs, vertex random graphs, and vertex-edge random graphs. Edge random graphs are Erdos-Renyi random graphs, vertex random graphs are generalizations of geometric random graphs, and…

组合数学 · 数学 2010-10-14 Elizabeth Beer , James Allen Fill , Svante Janson , Edward R. Scheinerman

We prove that the type of nearly Gorenstein numerical semigroups minimally generated by $5$ integers is bounded. In particular, if such a semigroup is not almost symmetric, then its type is at most $40$. Finally, we make some considerations…

交换代数 · 数学 2025-01-15 Alessio Moscariello , Francesco Strazzanti

We characterize Gorenstein modules over those local rings that admit a finite contracting endomorphism.

交换代数 · 数学 2007-10-01 Hamid Rahmati

Let a finitely generated group $G$ split as a graph of groups. If edge groups are undistorted and do not contribute to the Morse boundary $\partial_MG$, we show that every connected component of $\partial_MG$ with at least two points…

群论 · 数学 2022-07-20 Elia Fioravanti , Annette Karrer

Two vertex colorings of a graph are Kempe equivalent if they can be transformed into each other by a sequence of switchings of two colors of vertices. It is PSPACE-complete to determine whether two given vertex $k$-colorings of a graph are…

组合数学 · 数学 2023-07-07 Akihiro Higashitani , Naoki Matsumoto

We investigate properties which ensure that a given finite graph is the commuting graph of a group or semigroup. We show that all graphs on at least two vertices such that no vertex is adjacent to all other vertices is the commuting graph…

群论 · 数学 2016-05-18 Michael Giudici , Bojan Kuzma

We show that one can define and effectively compute Stallings graphs for quasi-convex subgroups of automatic groups (\textit{e.g.} hyperbolic groups or right-angled Artin groups). These Stallings graphs are finite labeled graphs, which are…

群论 · 数学 2018-01-03 Olga Kharlampovich , Alexei Miasnikov , Pascal Weil

Let $f \colon X \to Y$ be a morphism of concentrated schemes. We characterize $f$-perfect complexes $\mathcal{E}$ as those such that the functor $\mathcal{E} \otimes^{\mathbf{L}}_X \mathbf{L} f^*-$ preserves bounded complexes. We prove, as…

代数几何 · 数学 2023-09-15 Leovigildo Alonso , Ana Jeremias , Fernando Sancho

The Engel graph of a finite group $G$ is a directed graph encoding the pairs of elements in $G$ satisfying some Engel word. Recent work of Lucchini and the third author shows that, except for a few well-understood cases, the Engel graphs of…

群论 · 数学 2023-04-20 F. Dalla Volta , F. Mastrogiacomo , P. Spiga

In this note, finite type epimorphisms of rings are characterized.

交换代数 · 数学 2018-03-20 Abolfazl Tarizadeh

The prime graph question asks whether the Gruenberg-Kegel graph of an integral group ring $\mathbb Z G$ , i.e. the prime graph of the normalised unit group of $\mathbb Z G$ coincides with that one of the group $G$. In this note we prove for…

环与代数 · 数学 2016-12-16 Wolfgang Kimmerle , Alexander Konovalov

We enumerate the independent sets of several classes of regular and almost regular graphs and compute the corresponding generating functions. We also note the relations between these graphs and other combinatorial objects and, in some…

组合数学 · 数学 2007-05-23 Alexander Burstein , Sergey Kitaev , Toufik Mansour

Gcd-graphs over the ring of integers modulo $n$ are a simple and elegant class of integral graphs. The study of these graphs connects multiple areas of mathematics, including graph theory, number theory, and ring theory. In a recent work,…

数论 · 数学 2024-11-05 Ján Mináč , Tung T. Nguyen , Nguyen Duy Tân

The aim of this paper is to show that any finite undirected bipartite graph can be considered as a polynomial $p \in \mathbb{N}[x]$, and any directed finite bipartite graph can be considered as a polynomial $p\in\mathbb{N}[x,y]$, and vise…

环与代数 · 数学 2019-03-26 Andrey Grinblat , Viktor Lopatkin

We classify the finite quasisimple groups whose commuting graph is perfect and we give a general structure theorem for finite groups whose commuting graph is perfect.

群论 · 数学 2015-10-26 John R. Britnell , Nick Gill

Any superrosy division ring (i.e. a division ring equipped with an abstract notion of rank) is shown to be centrally finite. Furthermore, division rings satisfying a generalized chain condition on definable subgroups are studied. In…

逻辑 · 数学 2016-05-16 Nadja Hempel , Daniel Palacín

Motivated by the concept of well-covered graphs, we define a graph to be well-bicovered if every vertex-maximal bipartite subgraph has the same order (which we call the bipartite number). We first give examples of them, compare them with…

组合数学 · 数学 2019-09-18 Wayne Goddard , Kirsti Kuenzel , Eileen Melville

For $n\in \mathbb{N}$, a group is called $n$-coherent if every subgroup of type $\mathsf{F}_n$ is of type $\mathsf{F}_{n+1}$. For $n\ge 1$, we observe that graphs of groups with $n$-coherent vertex groups and virtually poly-cyclic edge…

群论 · 数学 2025-11-26 Kevin Li , Luis Jorge Sánchez Saldaña

In this paper we prove that nearly Gorenstein Stanley-Reisner rings of dimension at least 3 are indeed Gorenstein. By previous work of the first author this yields a complete characterization of nearly Gorenstein Stanley-Reisner rings. We…

交换代数 · 数学 2024-12-18 Sora Miyashita , Matteo Varbaro

We show that finitely presented groups which admit $k$-planar Cayley graphs contain finite-index subgroups with planar Cayley graphs. More generally, we answer a question of Georgakopoulos and Papasoglu in the special case of coarsely…

群论 · 数学 2026-05-06 John M. Mackay , Joseph P. MacManus , Davide Spriano