Skip to main content
SpringerLink
Log in

Intersection theorem for finite permutations

  • Large Systems
  • Published:
Problems of Information Transmission Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Ku, C.Y. and Renshaw, D., Erdős-Ko-Rado Theorems for Permutations and Set Partitions, J. Combin. Theory, Ser. A, 2008, vol. 115, no. 6, pp. 1008–1020.

    Article  MATH  MathSciNet  Google Scholar 

  2. Cameron, P.J. and Ku, C.Y., Intersecting Families of Permutations, European J. Combin. 2003, vol. 24, no. 7, pp. 881–890.

    Article  MATH  MathSciNet  Google Scholar 

  3. Larose, B. and Malvenuto, C., Stable Sets of Maximal Size in Kneser-type Graphs, European J. Combin., 2004, vol. 25, no. 5, pp. 657–673.

    Article  MATH  MathSciNet  Google Scholar 

  4. Ahlswede, R. and Khachatrian, L.H., The Complete Intersection Theorem for Systems of Finite Sets, European J. Combin., 1997, vol. 18, no. 2, pp. 125–136.

    Article  MATH  MathSciNet  Google Scholar 

  5. Ahlswede, R. and Khachatrian, L.H., The Diametric Theorem in Hamming Spaces -Optimal Anticodes, Adv. Appl. Math., 1998, vol. 20, no. 4, pp. 429–449.

    Article  MATH  MathSciNet  Google Scholar 

  6. Ahlswede, R. and Blinovsky, V., Lectures on Advances in Combinatorics, Berlin: Springer, 2008.

    Book  MATH  Google Scholar 

  7. Frankl, P. and Tokushige, N., The Erdős-Ko-Rado Theorem for Integer Sequences, Combinatorica, 1999, vol. 19, no. 1, pp. 55–63.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    V. M. Blinovsky

Authors
  1. V. M. Blinovsky
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to V. M. Blinovsky.

Additional information

Original Russian Text © V.M. Blinovsky, 2011, published in Problemy Peredachi Informatsii, 2011, Vol. 47, No. 1, pp. 40–53.

Supported in part by the Russian Foundation for Basic Research, project no. 09-01-00536.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Blinovsky, V.M. Intersection theorem for finite permutations. Probl Inf Transm 47, 34–45 (2011). https://doi.org/10.1134/S0032946011010042

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0032946011010042

Keywords

Search

Navigation