Loading [MathJax]/jax/output/SVG/config.js
Modelirovanie i Analiz Informatsionnykh Sistem
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Model. Anal. Inform. Sist.:
Year:
Volume:
Issue:
Page:
Find






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


Modelirovanie i Analiz Informatsionnykh Sistem, 2007, Volume 14, Number 4, Pages 53–56 (Mi mais158)  

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

On the lower estimate for $k+1$-nondecomposible permutations

G. R. Chelnokov

Yaroslavl State University
Full-text PDF (227 kB) Citations (2)
References:
Abstract: A permutation $\tau$ is called $k+1$-nondecomposible if the following condition holds: if $\{a_1,\dots,a_in\}$ is a set of natural numbers such that $1\le a_1,<\dots,<a_i\le n$ and $\tau(a_1)<\tau(a_2)<\dots<\tau(a_i)$, then $i\le k$. By $f(n,k)$ denote the number of all not $k+1$-nondecomposible permutations. The following statement was proved in this paper: suppose $K(n)=o(\root3\of{n}/\ln n)$; then $f(n,k)=k^{2n-o(n)}$ for every $k \le K(n)$.
Received: 29.09.2007
Bibliographic databases:
UDC: 512.552.4+519.115.1
Language: Russian
Citation: G. R. Chelnokov, “On the lower estimate for $k+1$-nondecomposible permutations”, Model. Anal. Inform. Sist., 14:4 (2007), 53–56
Citation in format AMSBIB
\Bibitem{Che07}
\by G.~R.~Chelnokov
\paper On the lower estimate for $k+1$-nondecomposible permutations
\jour Model. Anal. Inform. Sist.
\yr 2007
\vol 14
\issue 4
\pages 53--56
\mathnet{http://mi.mathnet.ru/mais158}
\elib{https://elibrary.ru/item.asp?id=13094575}
Linking options:
  • https://www.mathnet.ru/eng/mais158
  • https://www.mathnet.ru/eng/mais/v14/i4/p53
  • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Моделирование и анализ информационных систем
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025