Randomness and complexity in matrix groups
type: Item
instance of: scholarly article
title: Randomness and complexity in matrix groups
author: N. E. Zubov
published in: Journal of Mathematical Sciences (New York)
publication date: 2021-09-23T00:00:00Z
Mathematics Subject Classification ID: 20Fxx
Mathematics Subject Classification ID: 20Exx
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7399182
MaRDI profile type: Publication
full work available at URL: s10958-021-05531-y
OpenAlex ID: W3201209484
cites work: Q2945362
cites work: Generic properties of subgroups of free groups and finite presentations
cites work: Navigating in the Cayley graph of \(\mathrm{SL}_2(\mathbb F_p)\) and applications to hashing
cites work: On two-generator subgroups in \(\mathrm{SL}_2(\mathbb{Z})\), \(\mathrm{SL}_2(\mathbb{Q})\), and \(\mathrm{SL}_2(\mathbb{R})\)
cites work: Q4003861
cites work: Musings on generic-case complexity
cites work: Average-case complexity and decision problems in group theory.
cites work: Generic-case complexity, decision problems in group theory, and random walks.
cites work: Densities in free groups and \(\mathbb{Z}^k\), visible points and test elements.
cites work: Generic properties of Whitehead's algorithm and isomorphism rigidity of random one-relator groups.
cites work: Q4145882
cites work: The word and geodesic problems in free solvable groups
cites work: Q3101433
cites work: How to pick a random integer matrix? (and other questions)
cites work: Q5783322
cites work: Sublinear time algorithms in the theory of groups and semigroups.
cites work: Q5388761
DOI: 10.1007/S10958-021-05531-Y
description: scientific article; zbMATH DE number 7399182