RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive

Probl. Peredachi Inf., 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].

UDC: 621.391.1+519.1

Received: 19.12.2011


 English version:
Problems of Information Transmission, 2012, 48:1, 70–71

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024