# Fibers of word maps and the multiplicities of nonabelian composition factors

## TL;DR

This paper introduces methods to identify certain words in group theory that restrict the multiplicities of nonabelian simple groups as composition factors in finite groups, with applications to specific word forms like powers.

## Contribution

It develops techniques to determine when a word is multiplicity-bounding and provides new examples, expanding understanding of word maps in finite groups.

## Key findings

- Established criteria for multiplicity-bounding words
- Identified classes of words, including odd powers, that are multiplicity-bounding
- Enhanced understanding of the structure of fibers in word maps

## Abstract

Call a reduced word $w$ multiplicity-bounding if and only if a finite group on which the word map of $w$ has a fiber of positive proportion $\rho$ can only contain each nonabelian finite simple group $S$ as a composition factor with multiplicity bounded in terms of $\rho$ and $S$. In this paper, based on recent work of Nikolov, we present methods to show that a given reduced word is multiplicity-bounding and apply them to give some nontrivial examples of multiplicity-bounding words, such as words of the form $x^e$, where $x$ is a single variable and $e$ an odd integer.