English
Related papers

Related papers: Diameter of classical groups generated by transvec…

200 papers

If $G$ is a group of permutations of a set $\Omega$, then the suborbits of $G$ are the orbits of point-stabilisers $G_\alpha$ acting on $\Omega$. The cardinalities of these suborbits are the subdegrees of $G$. Every infinite primitive…

Group Theory · Mathematics 2013-02-19 Simon M Smith

Let $G$ be a finite group. For each $m>1$ we define the symmetric canonical subset $S=S(m)$ of the Cartesian power $G^m$ and we consider the family of Cayley graphs $\mathscr{G}_m(G)=Cay(G^m,S)$. We describe properties of these graphs and…

Combinatorics · Mathematics 2019-11-14 Czesław Bagiński , Piotr Grzeszczuk

Let $G$ be a finite group and $N$ a normal subgroup of $G$. We determine the structure of $N$ when the diameter of the graph associated to the $G$-conjugacy classes contained in $N$ is as large as possible, that is, is equal to three.

Group Theory · Mathematics 2024-02-13 Antonio Beltrán , María José Felipe , Carmen Melchor

A base for a finite permutation group $G \le \mathrm{Sym}(\Omega)$ is a subset of $\Omega$ with trivial pointwise stabiliser in $G$, and the base size of $G$ is the smallest size of a base for $G$. Motivated by the interest in groups of…

Group Theory · Mathematics 2026-01-30 Saul D. Freedman , Hong Yi Huang , Melissa Lee , Kamilla Rekvényi

We show that the Cayley graph of the symmetric group $Sym_n$ generated by the cycle $(123...n)$ and the transposition $(12)$ embeds into $L_1$ with bi-Lipschitz distortion $O(1)$. This answers a question of Ostrovskii, and along with…

Metric Geometry · Mathematics 2025-12-11 Cosmas Kravaris

Let $G$ be a finite group and $G_p$ be a Sylow $p$-subgroup of $G$ for a prime $p$ in $\pi(G)$, the set of all prime divisors of the order of $G$. The automiser $A_p(G)$ is defined to be the group $N_G(G_p)/G_pC_G(G_p)$. We define the Sylow…

Group Theory · Mathematics 2009-12-16 L. S. Kazarin , A. Martínez-Pastor , M. D. Pérez-Ramos

For a group $G,$ let $\Gamma(G)$ denote the graph defined on the elements of $G$ in such a way that two distinct vertices are connected by an edge if and only if they generate $G$. Moreover let $\Gamma^*(G)$ be the subgraph of $\Gamma(G)$…

Group Theory · Mathematics 2018-10-09 Cristina Acciarri , Andrea Lucchini

We prove that Chevalley groups over polynomial rings $\mathbb F_q[t]$ and over Laurent polynomial $\mathbb F_q[t,t^{-1}]$ rings, where $\mathbb F_q$ is a finite field, are boundedly elementarily generated. Using this we produce explicit…

Group Theory · Mathematics 2022-05-11 Boris Kunyavskii , Eugene Plotkin , Nikolai Vavilov

We prove that a distance-regular graph with a dominant distance is a spectral expander. The key ingredient of the proof is a new inequality on the intersection numbers. We use the spectral gap bound to study the structure of the…

Combinatorics · Mathematics 2021-07-28 Bohdan Kivva

Let $G$ be a finite group and $S$ be a subset of $G.$ A bi-Cayley graph $\BCay(G,S)$ is a simple and an undirected graph with vertex-set $G\times\{1,2\}$ and edge-set $\{\{(g,1),(sg,2)\}\mid g\in G, s\in S\}$. A bi-Cayley graph $\BCay(G,S)$…

Group Theory · Mathematics 2020-03-17 Asieh Sattari , Majid Arezoomand , Mohammad A. Iranmanesh

Let $G$ be a finite insoluble group with soluble radical $R(G)$. In this paper we investigate the soluble graph of $G$, which is a natural generalisation of the widely studied commuting graph. Here the vertices are the elements in $G…

Group Theory · Mathematics 2022-11-07 Timothy C. Burness , Andrea Lucchini , Daniele Nemmi

A recent result of Chepoi, Estellon and Vaxes [DCG '07] states that any planar graph of diameter at most 2R can be covered by a constant number of balls of size R; put another way, there are a constant-sized subset of vertices within which…

Computational Geometry · Computer Science 2014-04-01 Glencora Borradaile , Erin Wolf Chambers

Let $G\leqslant {\rm Sym}(\Omega)$ be a finite transitive permutation group with point stabiliser $H$. A base for $G$ is a subset of $\Omega$ whose pointwise stabiliser is trivial, and the minimal cardinality of a base is called the base…

Group Theory · Mathematics 2026-01-23 Marina Anagnostopoulou-Merkouri

The normal covering number $\gamma(G)$ of a finite, non-cyclic group $G$ is the least number of proper subgroups such that each element of $G$ lies in some conjugate of one of these subgroups. We prove that there is a positive constant $c$…

Group Theory · Mathematics 2013-01-30 Daniela Bubboloni , Cheryl E. Praeger , Pablo Spiga

Given an increasing odd homeomorphism $\sigma$ : R $\rightarrow$ R, the two bijective maps h $\sigma$ , v $\sigma$ : R 2 $\rightarrow$ R 2 dened by h $\sigma$ (x, y) = (x + $\sigma$ --1 (y), y) and v $\sigma$ (x, y) = (x, $\sigma$(x) + y).…

Dynamical Systems · Mathematics 2019-06-19 Guido Ahumada , Nicolas Chevallier

A Cayley graph $\Ga=\Cay(G,S)$ is said to be normal if $G$ is normal in $\Aut\Ga$. The concept of normal Cayley graphs was first proposed by M.Y.Xu in [Discrete Math. 182, 309-319, 1998] and it plays an important role in determining the…

Combinatorics · Mathematics 2017-02-21 Bo Ling , Ben Gong Lou

We consider the fundamental group $\pi$ of a surface of finite type equipped with the infinite generating set consisting of all simple closed curves. We show that every nilpotent quotient of $\pi$ has finite diameter with respect to the…

Geometric Topology · Mathematics 2012-11-21 Khalid Bou Rabee , Asaf Hadari

For a non-cyclic finite group $G$, let $\gamma(G)$ denote the smallest number of conjugacy classes of proper subgroups of $G$ needed to cover $G$. Bubboloni, Praeger and Spiga, motivated by questions in number theory, have recently…

Group Theory · Mathematics 2012-06-20 John R. Britnell , Attila Maroti

In this article we study percolation on the Cayley graph of a free product of groups. The critical probability $p_c$ of a free product $G_1*G_2*...*G_n$ of groups is found as a solution of an equation involving only the expected subcritical…

Probability · Mathematics 2008-09-26 Iva Kozakova

A generating set for a finite group $G$ is said to be minimal if no proper subset generates $G$, and $m(G)$ denotes the maximal size of a minimal generating set for $G$. We prove a conjecture of Lucchini, Moscatiello and Spiga by showing…

Group Theory · Mathematics 2023-07-20 Scott Harper