English
Related papers

Related papers: Using Schur Rings to Produce GRRs for Dihedral Gro…

200 papers

The classification of complete multipartite graphs whose edge rings are nearly Gorenstein as well as that of finite perfect graphs whose stable set rings are nearly Gorenstein is achieved.

Commutative Algebra · Mathematics 2021-08-24 Takayuki Hibi , Dumitru I. Stamate

Highly-regular graphs can be regarded as a combinatorial generalization of distance-regular graphs. From this standpoint, we study combinatorial aspects of highly-regular graphs. As a result, we give the following three main results in this…

Combinatorics · Mathematics 2017-10-06 Taichi Kousaka

For a group $G$, the generating graph $\Gamma(G)$ is defined as the graph with the vertex set $G$, and any two distinct vertices of $\Gamma(G)$ are adjacent if they generate $G$. In this paper, we study the generating graph of $D_n,$ where…

Combinatorics · Mathematics 2025-01-22 A. Satyanarayana Reddy , Kavita Samant

A Schur ring over a finite group is said to be decomposable if it is the generalized wreath product of Schur rings over smaller groups. In this paper we establish a sufficient condition for a decomposable Schur ring over the direct product…

Combinatorics · Mathematics 2018-10-24 István Kovács , Grigory Ryabov

A \textit{diameter graph in $\mathbb R^d$} is a graph, whose set of vertices is a finite subset of $\mathbb R^d$ and whose set of edges is formed by pairs of vertices that are at diameter apart. This paper is devoted to the study of…

Combinatorics · Mathematics 2017-12-01 Andrey Kupavskii

The families of graphs defined by a certain type of system of equations over commutative rings have been studied and used since 1990s. This survey presents these families and their applications related to graphs, digraphs, and hypergraphs.…

Combinatorics · Mathematics 2025-04-09 Felix Lazebnik , Ye Wang

We establish conditions under which the fundamental group of a graph of finite $p$-groups is necessarily residually $p$-finite. The technique of proof is independent of previously established results of this type, and the result is also…

Group Theory · Mathematics 2018-11-01 Gareth Wilkes

The characterization of distance-regular Cayley graphs originated from the problem of identifying strongly regular Cayley graphs, or equivalently, regular partial difference sets. In this paper, a classification of distance-regular Cayley…

Combinatorics · Mathematics 2022-03-25 Xueyi Huang , Kinkar Chandra Das , Lu Lu

A finite group $G$ is called a Schur group, if any Schur ring over $G$ is associated in a natural way with a subgroup of $Sym(G)$ that contains all right translations. Recently, the authors have completely identified the cyclic Schur…

Group Theory · Mathematics 2016-02-24 Sergei Evdokimov , István Kovács , Ilya Ponomarenko

We give a characterization of limits of dihedral groups in the space of finitely generated marked groups. We also describe the topological closure of dihedral groups in the space of marked groups on a fixed number of generators.

Group Theory · Mathematics 2007-10-09 Luc Guyot

Regular colored graphs are dual representations of pure colored D-dimensional complexes. These graphs can be classified with respect to an integer, their degree, much like maps are characterized by the genus. We analyse the structure of…

Combinatorics · Mathematics 2016-02-02 Razvan Gurau , Gilles Schaeffer

Infinitely many large Schur sigma-groups G with non-elementary bicyclic commutator quotient G/G' = C(3^e) x C(3), e >= 2, are constructed as periodic sequences of vertices in descendant trees of finite 3-groups. A single root gives rise to…

Group Theory · Mathematics 2021-10-27 Daniel C. Mayer

Generalising an example by Girondo and Wolfart, we use finite group theory to construct Riemann surfaces admitting two or more regular dessins (i.e. orientably regular hypermaps) with automorphism groups of the same order, and in many cases…

Combinatorics · Mathematics 2011-04-06 Gareth A. Jones

An isomorphism between the group ring of a finite group and a ring of certain block diagonal matrices is established. The group ring $RG$ of a finite group $G$ is isomorphic to the set of {\em group ring matrices} over $R$. It is shown that…

Representation Theory · Mathematics 2015-06-18 Ted Hurley

In this article we generalize the theory of subgroup graphs of subgroups of free groups to finite index subgroups $H$ of finitely generated groups $G$. We study and prove various properties of $H$ in relation to its subgroup graph…

Group Theory · Mathematics 2016-03-23 Cora Welsch

We explicitly determine all CI-groups with respect to ternary relational structures that have the form $C \times D$, where $C$ is cyclic and $D$ is either a dicyclic group whose order is not divisible by $3$ or a dihedral group. Such groups…

Combinatorics · Mathematics 2026-02-10 Ted Dobson , Joy Morris , Mikhail Muzychuk , Pablo Spiga

Let $G$ be a finite group. If $\Gamma$ is a permutation group with $G_{right}\leq\Gamma\leq Sym(G)$ and $\mathcal{S}$ is the set of orbits of the stabilizer of the identity $e=e_{G}$ in $\Gamma$, then the $\mathbb{Z}$-submodule…

Group Theory · Mathematics 2017-09-15 Grigory Ryabov

In a recent paper Cameron, Lakshmanan and Ajith began an exploration of hypergraphs defined on algebraic structures, especially groups, to investigate whether this can add a new perspective. Following their suggestions, we consider suitable…

Group Theory · Mathematics 2024-04-18 Andrea Lucchini

Let $G= (V,E)$ be a finite graph. For $d_0>0$ we say that $G$ is $d_0$-regular, if every $v\in V$ has degree $d_0$. We say that $G$ is $(d_0, d_1)$-regular, for $0<d_1<d_0$, if $G$ is $d_0$ regular and for every $v\in V$, the subgraph…

Combinatorics · Mathematics 2023-08-28 Ehud Friedgut , Yonatan Iluz

Given a finite graph G there is a corresponding group given by the presentation with generators the vertices of G and a relation [x,y]=1 for generators x and y precisely when (x,y) is an edge of G. Such groups are known as partially…

Group Theory · Mathematics 2007-07-03 Andrew J Duncan , Ilya V Kazachkov , Vladimir N Remeslennikov