Abstract
AbstractDetermining the maximum size of a ‐intersecting code in was a longstanding open problem of Frankl and Füredi, solved independently by Ahlswede and Khachatrian and by Frankl and Tokushige. We extend their result to the setting of forbidden intersections, by showing that for any and large compared with (but not necessarily ) that the same bound holds for codes with the weaker property of being ‐avoiding, that is, having no two vectors that agree on exactly coordinates. Our proof proceeds via a junta approximation result of independent interest, which we prove via a development of our recent theory of global hypercontractivity: we show that any ‐avoiding code is approximately contained in a ‐intersecting junta (a code where membership is determined by a constant number of coordinates). In particular, when , this gives an alternative proof of a recent result of Eberhard, Kahn, Narayanan and Spirkl that symmetric intersecting codes in have size .
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
