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
-
The permutation group in physics and chemistry /
Published: (1979) -
SELECTIVE-PERMUTATIONAL METHOD FOR SOLVING PROBLEMS ON PARALLEL DISTRIBUTION OF TASKS AMONG PERFORMERS: SINGLE PERMUTATIONS
by: Rudolf A. Neydorf
Published: (2011-09-01) -
Vertex degrees in grid graphs of permutations
by: Aubrey Blecher, et al.
Published: (2025-07-01) -
Permutations of Theory – Open Channels then and now
by: Holger Briel
Published: (2012-01-01) -
A short note on computing permutations
by: Paweł Gburzyński, et al.
Published: (2023-09-01)