go-v.orgdoi

Words, permutations, and the nonsolvable length of a finite group

Alexander Bors, Aner Shalev · Journal of Combinatorial Algebra · 2021

  • DOI 10.4171/jca/51
  • Publisher EMS Press
  • Type article
  • Issued 2021

Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.

Journal of Combinatorial Algebra · EMS Press · article · 2021

Abstract

We study the impact of certain identities and probabilistic identities on the structure of finite groups. More specifically, let w be a nontrivial word in d distinct variables and let G be a finite group for which the word map w_G\colon G^d\rightarrow G has a fiber of size at least \rho|G|^d for some fixed \rho > 0 . We show that, for certain words w , this implies that G has a normal solvable subgroup of index bounded above in terms of w and \rho . We also show that, for a larger family of words w , this implies that the nonsolvable length of G is bounded above in terms of w and \rho , thus providing evidence in favor of a conjecture of Larsen.

Along the way we obtain results of independent interest on permutation groups; e.g. we show, roughly, that most elements of large finite permutation groups have large support.

Open the resolved locator · 10.4171/jca/51

Metadata licence: OpenAlex metadata (CC0)

Registry
OpenAlex DOI index + API
Fetched
2026-11-20 03:21 UTC
Cache state
not cached yet (bulk-index+openalex)
Locator
https://ems.press/journals/jca/articles/1294837
Metadata licence
OpenAlex metadata (CC0)
Scope
Metadata as returned by the resolver; abstracts are never generated here.