RUS  ENG
Full version
JOURNALS // Fundamentalnaya i Prikladnaya Matematika // Archive
Fundam. Prikl. Mat., 2019 Volume 22, Issue 4, Pages 253–262 (Mi fpm1828)
Randomness and complexity in matrix groups

V. Shpilrain

Department of Mathematics, The City College of New York, New York, NY 10031

Abstract: We reflect on how to define the complexity of a matrix and how to sample a random invertible matrix. We also discuss a related issue of complexity of algorithms in matrix groups.

UDC: 512.52+512.544.6+512.643.8


 English version: Journal of Mathematical Sciences (New York), 2021, 257:6, 919–925

© Steklov Math. Inst. of RAS, 2025