On the probability of satisfying a word in a group

DOI10.1515/JGT.2006.044MaRDI QIDQ3413641zbMATH OpenOpenAlexFDO

Authors Miklós Abért

Publication date 13 December 2006

Published in Journal of Group Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0504312

zbMATH Keywords

finite groupssolvable subgroupsone relator groups

Mathematics Subject Classification ID

Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks (20D10) Generators, relations, and presentations of groups (20F05) Probabilistic methods in group theory (20P05)

Abstract: We show that for any finite group $G$ and for any $d$ there exists a word $win{F}_d$ such that a $d$-tuple in $G$ satisfies $w$ if and only if it generates a solvable subgroup. In particular, if $G$ itself is not solvable, then it cannot be obtained as a quotient of the one relator group $F_d/<w>$. As a corollary, the probability that a word is satisfied in a fixed non-solvable group can be made arbitrarily small, answering a question of Alon Amit.

Recommendations

• A characterization of finite soluble groups
• scientific article; zbMATH DE number 850199
• Equations over groups, and groups with one defining relation
• Residual properties of free groups and probabilistic methods
• A property of subgroups of infinite index in a free group
• Effective indices of subgroups in Baumslag-Pride groups with free quotients.
• A Problem on Rational Subsets of the Free Group
• The class of groups all of whose subgroups with lesser number of generators are free is generic
• Random subgroups of linear groups are free.
• scientific article; zbMATH DE number 5234386

Cites work

• Finite groups in which every two elements generate a soluble subgroup
• Groups with two More Generators Than Relators
• Nonsolvable finite groups all of whose local subgroups are solvable
• Residual properties of free groups and probabilistic methods
• The probability of generating a finite classical group

Cited in

(15)

• A characterization of finite soluble groups
• Word problems for finite nilpotent groups
• The probability distribution of word maps on finite groups
• Almost identities in groups
• Residual properties of free groups and probabilistic methods
• Alexander varieties and largeness of finitely presented groups
• Words, permutations, and the nonsolvable length of a finite group
• Effective indices of subgroups in Baumslag-Pride groups with free quotients.
• Enumerating word maps in finite groups
• On the girth of random Cayley graphs
• Word maps and spectra of random graph lifts
• Measure preserving words are primitive
• Primitive words, free factors and measure preservation.
• Equations in simple matrix groups: algebra, geometry, arithmetic, dynamics.
• Characterization of solvable groups and solvable radical.

This page was built for publication: On the probability of satisfying a word in a group

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3413641)