A set of permutations IβSnβ is said to be {\em k-intersecting} if
any two permutations in I agree on at least k points. We show that for any
kβN, if n is sufficiently large depending on k, then the
largest k-intersecting subsets of Snβ are cosets of stabilizers of k
points, proving a conjecture of Deza and Frankl. We also prove a similar result
concerning k-cross-intersecting subsets. Our proofs are based on eigenvalue
techniques and the representation theory of the symmetric group.Comment: 'Erratum' section added. Yuval Filmus has recently pointed out that
the 'Generalised Birkhoff theorem', Theorem 29, is false for k > 1, and so is
Theorem 27 for k > 1. An alternative proof of the equality part of the
Deza-Frankl conjecture is referenced, bypassing the need for Theorems 27 and
2