|
Problemy Peredachi Informatsii, 2012, Volume 48, Issue 1, Pages 80–82
(Mi ppi2070)
|
|
|
|
Large Systems
Remark on one problem in extremal combinatorics
V. M. Blinovsky Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow
Abstract:
We reduce the problem of determining the maximum number of permutations of a finite set such that any pair of permutations has at least $t$ common transpositions to the problem of determining the maximum number of permutations of finite set such that any pair has at least $t$ common fixed points. The latter problem was solved by the author in [1].
Received: 19.12.2011
Citation:
V. M. Blinovsky, “Remark on one problem in extremal combinatorics”, Probl. Peredachi Inf., 48:1 (2012), 80–82; Problems Inform. Transmission, 48:1 (2012), 70–71
Linking options:
https://www.mathnet.ru/eng/ppi2070 https://www.mathnet.ru/eng/ppi/v48/i1/p80
|
Statistics & downloads: |
Abstract page: | 328 | Full-text PDF : | 70 | References: | 40 | First page: | 12 |
|