RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive
Probl. Peredachi Inf., 2011 Volume 47, Issue 1, Pages 40–53 (Mi ppi2036)
This article is cited in 1 paper

Large Systems

Intersection theorem for finite permutations

V. M. Blinovsky

Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow

Abstract: We find the maximal number of permutations on a set of $n$ elements such that any pair of permutations has at least t common cycles.

UDC: 621.391.1+519.1

Received: 08.07.2010
Revised: 22.11.2010


 English version: Problems of Information Transmission, 2011, 47:1, 34–45

Bibliographic databases:

© Steklov Math. Inst. of RAS, 2024