Loading [MathJax]/jax/output/SVG/config.js
Funktsional'nyi Analiz i ego Prilozheniya
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Forthcoming papers
Archive
Impact factor
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Funktsional. Anal. i Prilozhen.:
Year:
Volume:
Issue:
Page:
Find






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


Funktsional'nyi Analiz i ego Prilozheniya, 2020, Volume 54, Issue 2, Pages 3–24
DOI: https://doi.org/10.4213/faa3740
(Mi faa3740)
 

This article is cited in 5 scientific papers (total in 5 papers)

Combinatorial coding of Bernoulli schemes and asymptotics of Young tables

A. M. Vershikabc

a St. Petersburg Department of Steklov Mathematical Institute of Russian Academy of Sciences
b Saint Petersburg State University
c Institute for Information Transmission Problems of the Russian Academy of Sciences (Kharkevich Institute), Moscow
Full-text PDF (767 kB) Citations (5)
References:
Funding agency Grant number
Russian Science Foundation 17-71-20153
Received: 27.10.2019
Revised: 05.03.2020
Accepted: 06.03.2020
Bibliographic databases:
Document Type: Article
UDC: 519.728
Language: Russian
Citation: A. M. Vershik, “Combinatorial coding of Bernoulli schemes and asymptotics of Young tables”, Funktsional. Anal. i Prilozhen., 54:2 (2020), 3–24
Citation in format AMSBIB
\Bibitem{Ver20}
\by A.~M.~Vershik
\paper Combinatorial coding of Bernoulli schemes and asymptotics of Young tables
\jour Funktsional. Anal. i Prilozhen.
\yr 2020
\vol 54
\issue 2
\pages 3--24
\mathnet{http://mi.mathnet.ru/faa3740}
\crossref{https://doi.org/10.4213/faa3740}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=4099113}
Linking options:
  • https://www.mathnet.ru/eng/faa3740
  • https://doi.org/10.4213/faa3740
  • https://www.mathnet.ru/eng/faa/v54/i2/p3
  • This publication is cited in the following 5 articles:
    1. A. A. Kislitsyn, “Kharakteristiki i analiz grafov blizhaishikh sosedei, porozhdennykh sluchainymi matritsami”, Matem. modelirovanie, 36:6 (2024), 3–20  mathnet  crossref
    2. A. M. Vershik, N. V. Tsilevich, “The Schur–Weyl graph and Thoma's theorem.”, Funct. Anal. Appl., 55:3 (2021), 198–209  mathnet  crossref  crossref  isi
    3. Mikołaj Marciniak, Łukasz Maślanka, Piotr Śniady, “Poisson limit of bumping routes in the Robinson–Schensted correspondence”, Probab. Theory Relat. Fields, 181:4 (2021), 1053  crossref  mathscinet
    4. I. F. Azangulov, G. V. Ovechkin, “Otsenka vremeni popadaniya koordinaty skhemy Bernulli v pervyi stolbets tablitsy Yunga”, Funkts. analiz i ego pril., 54:2 (2020), 78–84  mathnet  crossref  mathscinet
    5. I. F. Azangulov, G. V. Ovechkin, “Estimate of Time Needed for a Coordinate of a Bernoulli Scheme to Fall into the First Column of a Young Tableau”, Funct Anal Its Appl, 54:2 (2020), 135  crossref
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Функциональный анализ и его приложения Functional Analysis and Its Applications
    Statistics & downloads:
    Abstract page:505
    Full-text PDF :98
    References:55
    First page:32
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025