On the lower estimate for <i>k </i>+ 1-nondecomposible permutations
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
Saved in:
| Main Author: | G. R. Chelnokov |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Yaroslavl State University
2007-12-01
|
| Series: | Моделирование и анализ информационных систем |
| Online Access: | https://www.mais-journal.ru/jour/article/view/1147 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Calculating Permutation Entropy without Permutations
by: Alexander K. Vidybida
Published: (2020-01-01) -
Negation of permutation mass function in random permutation sets theory for uncertain information modeling
by: Yongchuan Tang, et al.
Published: (2024-07-01) -
Bernoulli trials and permutation statistics
by: Don Rawlings
Published: (1992-01-01) -
Nonlinear degree of Ascon permutation
by: Victor Ruzhentsev
Published: (2025-06-01) -
Permutation Entropy for Signal Analysis
by: Bill Kay, et al.
Published: (2024-11-01)