相关论文: Finite Groups of Uniform Logarithmic Diameter

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…

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…

In the first, mostly expository, part of this paper, a graded Lie algebra is associated to every group G given with an N-series of subgroups. The asymptotics of the Poincare series of this algebra give estimates on the growth of the group…

It is shown that there are groups $\Gamma$ with finite generating sets $S$ such that the adjacency operator of the Cayley graph ${\rm Cay}(\Gamma,S)$ is a disjoint union of $N$ intervals, for arbitrarily large integers $N$.

In this article, we study connections between components of the Cayley graph $\mathrm{Cay}(G,A)$, where $A$ is an arbitrary subset of a group $G$, and cosets of the subgroup of $G$ generated by $A$. In particular, we show how to construct…

Let $n \ge 3$. We positively answer a question of Lubotzky and prove that every finite index subgroup of SL(n, Z) contains a finite index subgroup which is generated by two elements.

Motivated by expansion in Cayley graphs, we show that there exist infinitely many groups $G$ with a nontrivial irreducible unitary representation whose average over every set of $o(\log\log|G|)$ elements of $G$ has operator norm $1 - o(1)$.…

Let G be a finite group with a generating set A. By the (symmetric) diameter of G with respect to A we mean the maximum over g in G of the length of the shortest word in (A union A inverse)A expressing g.By the (symmetric) diameter of G we…

We give new upper bounds for the diameters of finite groups which do not depend on a choice of generating set. Our method exploits the commutator structure of certain profinite groups, in a fashion analogous to the Solovay-Kitaev procedure…

A group $G$ is complete group if it satisfies $Z(G)=e$ and $Aut(G)=Inn(G)$. In this paper, on the one hand, we study the basic properties of generalized Cayley graphs and characterize two classes isomorphic generalized generalized Cayley…

In this note we prove that all connected Cayley graphs of every finite group $Q \times H$ are 1-factorizable, where $Q$ is any non-trivial group of 2-power order and $H$ is any group of odd order.

A self-similar group of finite type is the profinite group of all automorphisms of a regular rooted tree that locally around every vertex act as elements of a given finite group of allowed actions. We provide criteria for determining when a…

Let $d \geq 2$ be an integer. We conjecture that there is a finitely generated perfect group whose homomorphic images include all finite $d$-generated perfect groups. We prove a special case of this conjecture for the finite perfect groups…

We improve upper bounds of F. R. K. Chung and of M. Lu, D. Wan, L.-P. Wang, X.-D. Zhang on the diameter of some Cayley graphs constructed from polynomials over finite fields.

The existence of $1$-factorizations of an infinite complete equipartite graph $K_m[n]$ (with $m$ parts of size $n$) admitting a vertex-regular automorphism group $G$ is known only when $n=1$ and $m$ is countable (that is, for countable…

We prove strong and explicit diameter bounds for finite simple Lie algebras, which parallel Babai's conjecture for finite simple groups. Specifically, we show that any nonabelian finite simple Lie algebra $\mathfrak{g}$ over $\mathbf{F}_p$…

A finite group $G$ is called *uniformly generated*, if whenever there is a (strictly ascending) chain of subgroups $1<\langle x_1\rangle<\langle x_1,x_2\rangle <\cdots<\langle x_1,x_2,\dots,x_d\rangle=G$, then $d$ is the minimal number of…

We use differential forms on loop spaces to prove that the fundamental group of certain geometric transformation groups is infinite. Examples include both finite and infinite dimensional Lie groups. The finite dimensional examples are the…

We give a non-deterministic algorithm that expresses elements of SL_N(Z), for N > 2, as words in a finite set of generators, with the length of these words at most a constant times the word metric. We show that the non-deterministic…

This note constructs a finitely generated group $W$ whose word-growth is exponential, but for which the infimum of the growth rates over all finite generating sets is 1 -- in other words, of non-uniformly exponential growth. This answers a…