Randomness and complexity in matrix groups

DOI10.1007/s10958-021-05531-yOpenAlexW3201209484MaRDI QIDQ822669

N. E. Zubov

Publication date: 23 September 2021

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-021-05531-y

Mathematics Subject Classification ID

Theory of computing (68Qxx) Special aspects of infinite or finite groups (20Fxx) Structure and classification of infinite or finite groups (20Exx)

Related Items

Solving the membership problem for parabolic Möbius monoids, Solving the Conjugacy Decision Problem via Machine Learning

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On two-generator subgroups in \(\mathrm{SL}_2(\mathbb{Z})\), \(\mathrm{SL}_2(\mathbb{Q})\), and \(\mathrm{SL}_2(\mathbb{R})\)
• Average-case complexity and decision problems in group theory.
• Sublinear time algorithms in the theory of groups and semigroups.
• Generic properties of Whitehead's algorithm and isomorphism rigidity of random one-relator groups.
• Generic-case complexity, decision problems in group theory, and random walks.
• Navigating in the Cayley graph of \(\mathrm{SL}_2(\mathbb F_p)\) and applications to hashing
• Densities in free groups and \(\mathbb{Z}^k\), visible points and test elements.
• How to pick a random integer matrix? (and other questions)
• Generic properties of subgroups of free groups and finite presentations
• The word and geodesic problems in free solvable groups
• Musings on generic-case complexity