Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2002.10443

Diameter of Cayley graphs of $SL(n,p)$ with generating sets containing a transvection

Zoltán Halasi
View original source ↗Read source document ↗Export metadata ↓

Abstract

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 this paper is to prove such a bound for the diameter of $Cay(G,X)$ whenever $G=SL(n,p)$ and $X$ is a generating set of $G$ which contains a transvection. A natural analogue of this result is also proved for $G=SL(n,K)$, where $K$ can be any field.

Explore related subjects

math.GR

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zoltán Halasi. 2020-02-24. Diameter of Cayley graphs of $SL(n,p)$ with generating sets containing a transvection. https://arxiv.org/abs/2002.10443

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

A local approach to a programme of Meierfrankenfeld: initial setting and the symmetric case

A large $p$-subgroup of a group $G$ is a self-centralizing $p$-subgroup $Q \le G$ whose normalizer controls the normalizers of all the non-trivial, central subgroups of $Q$. In 2016 Meierfrankenfeld, Stellmacher and Stroth produced a result describing the $p$-local structure of a finite group having a large $p$-subgroup (the main examples arising from finite groups of Lie type in defining characteristic $p$). This result is a major success within the wider framework of studying groups of local characteristic $p$. We attempt to produce a result analogous to that of Meierfrankenfeld, Stellmacher and Stroth, but for fusion systems and localities. Previous work of Ellen Henke and the author shows that reasonable generalizations can be formulated and solved equivalently either within the realm of fusion systems or in the world of localities. In particular, in the present paper we set the stage for our analysis, showing how working within a locality grants a clear advantage: it allows to follow the same lines of reasoning as for a group. We therefore produce analogous reduction results and case subdivision as those in the 2016 result of Meierfrankenfeld et al. and, proceeding according to the analogy, we deal with occurrences of certain natural orthogonal modules and with the first of the cases that are to be studied, the so-called symmetric case. The remaining cases will appear in future publications.

math.GR↗
arXiv2026

Synchronizing groups and weakly perfect graphs: a survey

The concept of synchronization has been transferred from finite automata, via transformation semigroups, to permutation groups: a permutation group $G$ on a finite set $Ω$ is said to be synchronizing if, for any non-permutation $t$ on $Ω$, the transformation monoid $\langle G,t\rangle$ contains an element of rank~$1$. Synchronizing permutation groups are primitive and basic, and so are affine, diagonal, or almost simple (in the O'Nan--Scott classification). In an earlier paper, the author, with João Araújo and Ben Steinberg, surveyed what was known at the time about synchronizing permutation groups. Since then, several new classes of groups have been tested for the synchronizing property, using the fact that a group is non-synchronizing if and only if it preserves a nontrivial weakly perfect graph. Cases studied include diagonal groups with more than two socle factors, two natural actions of symmetric groups, and some actions of classical groups; the proofs are scattered in the literature. My primary purpose is to collect these results with their proofs. As a second objective, I will explain the background, and comment on some related topics. (Reading this paper does not require knowledge of the earlier paper.)

math.GR↗