Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1807.07111

The Probability Distribution of Word Maps on Finite Groups

William Cocke·Meng-Che "Turbo" Ho
View original source ↗Read source document ↗Export metadata ↓

Abstract

Word maps provide a wealth of information about finite groups. We examine the connection between the probability distribution induced by a word map and the underlying structure of a finite group. We show that a finite group is nilpotent if and only if every surjective word map has fibers of uniform size. Moreover, we show that probability distributions themselves are sufficient to identify nilpotent groups, and these same distributions can be used to determine abelian groups up to isomorphism. In addition we answer a question of Amit and Vishne.

Explore related subjects

math.GR

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

William Cocke, Meng-Che "Turbo" Ho. 2018-07-18. The Probability Distribution of Word Maps on Finite Groups. https://arxiv.org/abs/1807.07111

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

KEEP EXPLORING

Related papers

arXiv2026

Margulis-Soifer theorem for one-relator groups

We establish the Margulis-Soifer dichotomy for one-relator groups: every one-relator group is either virtually solvable or has a maximal subgroup of infinite index. We also present examples of one-relator groups with and without free maximal subgroups of infinite index, as well as examples that possess both free and non-free infinite index maximal subgroups. Triviality of the Frattini subgroup is also shown for all non-solvable one-relator groups. We close the paper with a short list of questions.

math.GR↗
arXiv2026

Finite quotients of spherical Artin groups

We show the smallest non-abelian quotients of spherical and affine Artin groups are isomorphic to the smallest non-abelian quotients of the corresponding Coxeter groups. We deduce irreducible spherical Artin groups are determined by their finite quotient groups.

math.GR↗
arXiv2026

Cosets with constant characteristic polynomial

Let H be a linear group. We show that if there is an invertible matrix x such that all the elements of xH share the same characteristic polynomial then H is virtually solvable. There are plenty of applications that will be presented in future paper. Here, we discuss some applications to the generalized Weigold conjecture and present an alternative straightforward proof of the Formanek--Procesi nonlinearity theorem for Aut(F_n), n>2, over every field. When n>5 our non-linearity proof gives a stronger result than the original Formanek--Procesi theorem.

math.GR↗