Abstract
We call a reduced word [Formula: see text] multiplicity-bounding if and only if a finite group on which the word map of [Formula: see text] has a fiber of positive proportion [Formula: see text] can only contain each non-abelian finite simple group [Formula: see text] as a composition factor with multiplicity bounded in terms of [Formula: see text] and [Formula: see text]. 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 [Formula: see text], where [Formula: see text] is a single variable and [Formula: see text] an odd integer.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
