On the lower estimate for k + 1-nondecomposible permutations
Abstract
A permutation т is сallеd k + 1-nondecomposible if the following condition holds: if {ai,..., ain} is a set of natural numbers such that 1 <= a1, <...,< ai <= n and т(a1) < т(a2) < < т(ai), then i <= к. By f (n, к) denote the number of all not к + 1-nondecomposible permutations.
The following statement was proved in this paper: suppose K(n) = o( 3 /n/ ln n); then f (n, к) = к2п-о(п) for every к <= K( n) .
The following statement was proved in this paper: suppose K(n) = o( 3 /n/ ln n); then f (n, к) = к2п-о(п) for every к <= K( n) .
References
1. Ширшов А.И. О кольцах с тождественными соотношениями / А.И. Ширшов // Мат. сб. - 1957. - Т.43, №2. - С. 277-283.
2. Латышев В.Н. К теореме Регева о тождествах тензорного произведения PI-алгебр / В.Н. Латышев // УМН. - 1972. - 27:4(166). - С. 213-214.
3. Феллер, В. Введение в теорию вероятностей и её приложения / В. Феллер. - М.: Мир, 1984.
Review
For citations:
Chelnokov G.R. On the lower estimate for k + 1-nondecomposible permutations. Modeling and Analysis of Information Systems. 2007;14(4):53-56. (In Russ.)
Views: 378
Email this article 