<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2012-05-30 08:55:25Mathematics Cryptography Algebra Permutations Polynomials Computational complexity theory Proof of knowledge IP Permutation matrix SchwartzZippel lemma NP Permutation |
Add to Reading List |
Proofs of Restricted Shuffles Bj¨ orn Terelius and Douglas Wikstr¨om CSC KTH Stockholm, Sweden {terelius,dog}@csc.kth.se
![A comment on Intersecting Families of Permutations Yuval Filmus July 3, 2017 Abstract Ellis, Friedgut and Pilpel [EFP11] prove that for large enough n, a t-intersecting family of permutations contains at most (n − t)!](https://www.pdfsearch.io/img/1dd1dd0fef39f361843f9cf70a461d35.jpg "A comment on Intersecting Families of Permutations Yuval Filmus July 3, 2017 Abstract Ellis, Friedgut and Pilpel [EFP11] prove that for large enough n, a t-intersecting family of permutations contains at most (n − t)!")
