Journal article
Frankl-Rödl-type theorems for codes and permutations
- Abstract:
- We give a new proof of the Frankl-Rödl theorem on forbidden intersections, via the probabilistic method of dependent random choice. Our method extends to codes with forbidden distances, where over large alphabets our bound is significantly better than that obtained by Frankl and Rödl. We also apply our bound to a question of Ellis on sets of permutations with forbidden distances and to establish a weak form of a conjecture of Alon, Shpilka and Umans on sunflowers.
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Preview, Accepted manuscript, pdf, 171.3KB, Terms of use)
-
- Publisher copy:
- 10.1090/tran/7015
Authors
+ Engineering and Physical Sciences Research Council
More from this funder
- Funding agency for:
- Keevash, P
- Grant:
- 239696
- Publisher:
- American Mathematical Society
- Journal:
- Transactions of the American Mathematical Society More from this journal
- Volume:
- 369
- Issue:
- 2
- Pages:
- 1147-1162
- Publication date:
- 2016-10-01
- Acceptance date:
- 2016-06-16
- DOI:
- ISSN:
-
0002-9947
- Keywords:
- Pubs id:
-
pubs:453016
- UUID:
-
uuid:7fd3369d-d863-4cd8-ac29-e12083c1c595
- Local pid:
-
pubs:453016
- Source identifiers:
-
453016
- Deposit date:
-
2017-01-12
Terms of use
- Copyright holder:
- American Mathematical Society
- Copyright date:
- 2016
- Notes:
- © Copyright 2016 American Mathematical Society. First published in Transactions of the American Mathematical Society in 369 (2), published by the American Mathematical Society
If you are the owner of this record, you can report an update to it here: Report update to this record