English
Related papers

Related papers: An algorithm for finding minimal generating sets o…

200 papers

A geometric method for obtaining an infinite family of Cayley digraphs of constant density on finite Abelian groups is presented. The method works for any given degree and it is based on consecutive dilates of a minimum distance diagram…

Combinatorics · Mathematics 2021-04-23 F. Aguiló , M. A. Fiol , S. Pérez

We study some properties of the Cayley graph of the R.Thompson's group F in generators $x_0$, $x_1$. We show that the density of this graph, that is, the least upper bound of the average vertex degree of its finite subgraphs is at least 3.…

Group Theory · Mathematics 2007-05-23 Victor Guba

We consider the oriented graph whose vertices are isomorphism classes of finitely generated groups, with an edge from G to H if, for some generating set T in H and some sequence of generating sets S_i in G, the marked balls of radius i in…

Group Theory · Mathematics 2015-12-14 Laurent Bartholdi , Anna Erschler

For a finite group $G$ and a finite set $A$, we study various algebraic aspects of cellular automata over the configuration space $A^G$. In this situation, the set $\text{CA}(G;A)$ of all cellular automata over $A^G$ is a finite monoid…

Group Theory · Mathematics 2019-12-24 Alonso Castillo-Ramirez , Maximilien Gadouleau

This paper deals with the Cayley graph $\Cay,$ where the generating set consists of all block transpositions. A motivation for the study of these particular Cayley graphs comes from current research in Bioinformatics. We prove that…

Combinatorics · Mathematics 2015-04-03 Annachiara Korchmaros

This paper establishes connections between the structure of a semigroup and the minimum spans of distance labellings of its Cayley graphs. We show that certain general restrictions on the minimum spans are equivalent to the semigroup being…

Combinatorics · Mathematics 2015-09-04 Andrei Kelarev , Charl Ras , Sanming Zhou

A well-known conjecture of Babai states that if $G$ is a finite simple group and $X$ is a generating set of $G$, then the diameter of the Cayley graph $Cay(G,X)$ is bounded above by $(\log |G|)^c$ for some absolute constant $c$. The goal of…

Group Theory · Mathematics 2020-02-25 Zoltán Halasi

Motivated by the Benjamini-Schramm non-unicity of percolation conjecture we study the following question. For a given finitely generated non-amenable group $\Gamma$, does there exist a generating set $S$ such that the Cayley graph…

Group Theory · Mathematics 2015-03-16 Kate Juschenko , Tatiana Nagnibeda

We show that whether loops can be shortcut in a group's Cayley graph depends on the choice of finite generating set. Our example is the direct product of two rank-2 free groups and a consequence is that this group has asymptotic cones with…

Group Theory · Mathematics 2024-10-30 Nima Hoda , Timothy Riley

Given positive integers $k$ and $n$, we present methods to construct all groups of order at most $n$ that contain a Cayley set of size $k$, and to enumerate the Cayley sets of order $k$ in a given group, up to the action of the automorphism…

Combinatorics · Mathematics 2025-12-08 Rhys J. Evans , Primož Potočnik

In this paper, we characterize the finite groups $G$ of even order with the property that for any involution $x$ and element $y$ of $G$, $\langle x, y \rangle$ is isomorphic to one of the following groups: $\mathbb{Z}_2,$ $\mathbb{Z}_2^2$,…

Group Theory · Mathematics 2021-04-02 Yan-Quan Feng , István Kovács

In this paper, we introduce the t-graphs defined on finitely-generate groups. We study some general aspects of the t-graphs on 2-generator groups, emphasising establishing necessary conditions for their connectedness. In particular, we…

Group Theory · Mathematics 2022-02-01 G. Diaz-Porto , I. S. Gutierrez , A. Torres-Grandisson

A well-known conjecture of Babai states that if $G$ is any finite simple group and $X$ is a generating set for $G$, then the diameter of the Cayley graph $Cay(G,X)$ is bounded by $\log|G|^c$ for some universal constant $c$. In this paper,…

Group Theory · Mathematics 2022-03-08 Martino Garonzi , Zoltán Halasi , Gábor Somlai

A generating set $S$ for a group $G$ is independent if the subgroup generated by $S\setminus \{s\}$ is properly contained in $G$, for all $s \in S.$ In this paper, we study a problem proposed by Peter Glasby: we investigate finite groups,…

Group Theory · Mathematics 2022-12-07 Andrea Lucchini , Pablo Spiga

Let $G$ be a finite simple group. In this paper we consider the existence of small subsets $A$ of $G$ with the property that, if $y \in G$ is chosen uniformly at random, then with high probability $y$ invariably generates $G$ together with…

Group Theory · Mathematics 2022-11-17 Daniele Garzoni , Eilidh McKemmie

We define the notion of the partial order of ends of the Cayley graph of a semigroup. We prove that the structure of the ends of a semigroup is invariant under change of finite generating set and at the same time is inherited by…

Group Theory · Mathematics 2014-09-04 S. Craik , R. Gray , V. Kilibarda , J. D. Mitchell , N. Ruskuc

We describe an algorithm that computes the index of a finitely generated subgroup in a finitely $L$-presented group provided that this index is finite. This algorithm shows that the subgroup membership problem for finite index subgroups in…

Group Theory · Mathematics 2011-06-02 René Hartung

We study the problem of finding a subgroup of a given order in a finite group, where the group is represented by its Cayley table. We analyze the complexity of the problem in the special case of abelian groups and present an optimal…

Computational Complexity · Computer Science 2026-02-26 K. Lakshmanan

In this paper we study finite groups which have Cayley isomorphism property with respect to Cayley maps, CIM-groups for a brief. We show that the structure of the CIM-groups is very restricted. It is described in Theorem~\ref{111015a} where…

Combinatorics · Mathematics 2016-02-09 Mikhail Muzychuk , Gábor Somlai

Let $G$ be a finite group and let $H$ be a proper subgroup of $G$ of minimal index. By applying an old result of Y. Berkovich, we provide a polynomial algorithm for computing $|G : H|$ for a permutation group $G$. Moreover, we find $H$…

Group Theory · Mathematics 2018-09-05 Saveliy V. Skresanov