z-logo
open-access-imgOpen Access
Words, permutations, and the nonsolvable length of a finite group
Author(s) -
Alexander Bors,
Aner Shalev
Publication year - 2021
Publication title -
journal of combinatorial algebra
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.272
H-Index - 3
eISSN - 2415-6310
pISSN - 2415-6302
DOI - 10.4171/jca/51
Subject(s) - mathematics , combinatorics , bounded function , conjecture , word (group theory) , group (periodic table) , word length , finite group , discrete mathematics , geometry , physics , mathematical analysis , linguistics , quantum mechanics , philosophy

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom