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
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 |
Similar Items
-
Detecting nondecomposability of time evolution via extreme gain of correlations
by: Krisnanda, Tanjung, et al.
Published: (2018) -
Tapping into Permutation Symmetry for Improved Detection of <i>k</i>-Symmetric Extensions
by: Youning Li, et al.
Published: (2023-10-01) -
Permutations fixing a k-set
by: Eberhard, S, et al.
Published: (2015) -
Matrix estimation with latent permutations
by: Mao, Cheng, Ph. D. Massachusetts Institute of Technology
Published: (2018) -
Permutation Groups Generated by <i>γ</i>-Cycles
by: Răzvan Diaconescu
Published: (2022-10-01)