English
Related papers

Related papers: Expansion in perfect groups

200 papers

It is observed that the conjugacy growth series of the infinite finitary symmetric group with respect to the generating set of transpositions is the generating series of the partition function. Other conjugacy growth series are computed,…

Combinatorics · Mathematics 2016-03-18 Roland Bacher

As a vital link between group theory and graph theory, Cayley graphs provide a geometric framework for encoding algebraic structures. This study explores the properties of Cayley graphs derived from cyclic groups whose order is the square…

Combinatorics · Mathematics 2026-04-28 Iqbal Atmaja , Ahmad Erfanian , Yeni Susanti , Muhammad Nurul Huda , Ari Suparwanto

We construct an infinite family of connected, 2-generated Cayley digraphs Cay(G;a,b) that do not have hamiltonian paths, such that the orders of the generators a and b are arbitrarily large. We also prove that if G is any finite group with…

Combinatorics · Mathematics 2013-06-25 Dave Witte Morris

A perfect code in a graph $\Gamma$ is a subset $C$ of the vertex set of $\Gamma$ such that every vertex of $\Gamma$ outside $C$ has exactly one neighbour in $C$. A perfect code in a directed graph can be defined similarly by requiring that…

Combinatorics · Mathematics 2025-08-18 Yusuf Hafidh , Binzhou Xia , Sanming Zhou

A group $G$ splits over a subgroup $C$ if $G$ is either a free product with amalgamation $A \underset{C}{\ast} B$ or an HNN-extension $G=A \underset{C}{\ast} (t)$. We invoke Bass-Serre theory and classify all infinite groups which admit…

Combinatorics · Mathematics 2022-03-22 Babak Miraftab , Konstantinos Stavropoulos

A subset $C$ of the vertex set of a graph $\Gamma$ is called a perfect code in $\Gamma$ if every vertex of $\Gamma$ is at distance no more than $1$ to exactly one vertex of $C$. A subset $C$ of a group $G$ is called a perfect code of $G$ if…

Combinatorics · Mathematics 2019-11-19 Jiyong Chen , Yanpeng Wang , Binzhou Xia

We consider box spaces of finitely generated, residually finite groups $G$, and try to distinguish them up to coarse equivalence. We show that, for $n\geq 2$, the group $SL_n(\mathbb{Z})$ has a continuum of box spaces which are pairwise…

Group Theory · Mathematics 2015-09-07 Ana Khukhro , Alain Valette

We study a class of finite groups $G$ which behave similarly to elementary abelian $p$-groups with $p$ prime, that is, there exists a subgroup $N$ such that all elements of $G\setminus N$ are conjugate or inverse-conjugate under $\Aut(G)$.…

Group Theory · Mathematics 2018-01-30 Lei Wang , Yin Liu

We prove that any non-amenable Cayley graph admits a factor of IID perfect matching. We also show that any connected d-regular vertex tran- sitive graph admits a perfect matching. The two results together imply that every Cayley graph…

Combinatorics · Mathematics 2012-11-13 Endre Csoka , Gabor Lippner

This document is an expanded version of a lecture presented at a conference on "Thin Groups and Superstrong Approximation" held at the Mathematical Sciences Research Institute in February 2012. Superstrong approximation is a criterion on a…

Number Theory · Mathematics 2013-03-12 Jordan S. Ellenberg

Let $G$ be a finite group and let $S$ be an inverse-closed subset of $G$ not containing the identity. The Cayley graph $\mathrm{Cay}(G,S)$ has vertex set $G$, where two vertices $x$ and $y$ are adjacent if and only if $x^{-1}y \in S$.…

Combinatorics · Mathematics 2026-01-06 Amitayu Banerjee

Let $\Ga = (V, E)$ be a graph and $a, b$ nonnegative integers. An $(a, b)$-regular set in $\Ga$ is a nonempty proper subset $D$ of $V$ such that every vertex in $D$ has exactly $a$ neighbours in $D$ and every vertex in $V \setminus D$ has…

Combinatorics · Mathematics 2024-04-15 Xiaomeng Wang , Shou-Jun Xu , Sanming Zhou

Groups defined by presentations for which the components of the corresponding star graph are the incidence graphs of generalized polygons are of interest as they are small cancellation groups that - via results of Edjvet and Vdovina - are…

Group Theory · Mathematics 2021-05-14 Ihechukwu Chinyere , Gerald Williams

For a finite group $G$, the vertices of the prime graph $\Gamma(G)$ are the primes that divide $|G|$, and two vertices $p$ and $q$ are connected by an edge if and only if there is an element of order $pq$ in $G$. Prime graphs of solvable…

Group Theory · Mathematics 2024-07-10 Thomas Michael Keller , Gavin Pettigrew , Saskia Solotko , Lixin Zheng

Let $K/\mathbb{Q}$ be a finitely generated field of characteristic zero and $X/K$ a smooth projective variety. Fix $q\in\mathbb{N}$. For every prime number $\ell$ let $\rho_\ell$ be the representation of $\mathrm{Gal}(K)$ on the \'etale…

Algebraic Geometry · Mathematics 2017-01-18 Sebastian Petersen

The unitary Cayley graph of $\mathbb{Z}/n\mathbb{Z}$, denoted $X_n$, is the graph on $\{0,\dots,n-1\}$ where vertices $a$ and $b$ are adjacent if and only if $\gcd(a-b,n) = 1$. We answer a question of Defant and Iyer by constructing a…

Combinatorics · Mathematics 2018-12-27 Amanda Burcroff

If q : P -> M is a principal K-bundle over the compact manifold M, then any invariant symmetric V-valued bilinear form on the Lie algebra k of K defines a Lie algebra extension of the gauge algebra by a space of bundle-valued 1-forms modulo…

Differential Geometry · Mathematics 2016-09-08 Karl-Hermann Neeb , Christoph Wockel

We prove that for a finitely generated linear group G over a field of positive characteristic the family of quotients by finite subgroups has finite asymptotic dimension. We use this to show that the K-theoretic assembly map for the family…

Algebraic Topology · Mathematics 2021-05-28 Daniel Kasprowski

In this paper, the first of a series of two, we continue the study of higher index theory for expanders. We prove that if a sequence of graphs is an expander and the girth of the graphs tends to infinity, then the coarse Baum-Connes…

K-Theory and Homology · Mathematics 2010-12-21 Rufus Willett , Guoliang Yu

A perfect code in a graph $\Gamma = (V, E)$ is a subset $C$ of $V$ such that no two vertices in $C$ are adjacent and every vertex in $V \setminus C$ is adjacent to exactly one vertex in $C$. A total perfect code in $\Gamma$ is a subset $C$…

Combinatorics · Mathematics 2026-05-19 Peter J. Cameron , Roro Sihui Yap , Sanming Zhou