RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor
Journal history

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Fundam. Prikl. Mat.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Fundam. Prikl. Mat., 2019, Volume 22, Issue 4, Pages 253–262 (Mi fpm1828)  

Randomness and complexity in matrix groups

V. Shpilrain

The City College of New York

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.

Funding Agency Grant Number
National Science Foundation CNS-1117675
Office of Naval Research N000141512164


Full text: PDF file (132 kB)
References: PDF file   HTML file
UDC: 512.52+512.544.6+512.643.8

Citation: V. Shpilrain, “Randomness and complexity in matrix groups”, Fundam. Prikl. Mat., 22:4 (2019), 253–262

Citation in format AMSBIB
\Bibitem{Shp19}
\by V.~Shpilrain
\paper Randomness and complexity in matrix groups
\jour Fundam. Prikl. Mat.
\yr 2019
\vol 22
\issue 4
\pages 253--262
\mathnet{http://mi.mathnet.ru/fpm1828}


Linking options:
  • http://mi.mathnet.ru/eng/fpm1828
  • http://mi.mathnet.ru/eng/fpm/v22/i4/p253

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles
  • Фундаментальная и прикладная математика
    Number of views:
    This page:26
    Full text:8
    References:4

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020