20 citations · 31 across the 7 of their papers we have counts for
13 papers · 1 filter
Global hypercontractivity and its applications
Peter Keevash, Noam Lifshitz, Eoin Long +1
The hypercontractive inequality on the discrete cube plays a crucial role in many fundamental results in the Analysis of Boolean functions, such as the KKL theorem, Friedgut's junt…
Forbidden intersections for codes
Peter Keevash, Noam Lifshitz, Eoin Long +1
Determining 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 Fra…
Tournament quasirandomness from local counting
M. Bucić, E. Long, A. Shapira +1
A well-known theorem of Chung and Graham states that if then a tournament is quasirandom if and only if contains each -vertex tournament the "correct number" o…
Distinct degrees in induced subgraphs
Matthew Jenssen, Peter Keevash, Eoin Long +1
An important theme of recent research in Ramsey theory has been establishing pseudorandomness properties of Ramsey graphs. An -vertex graph is called -Ramsey if it has no hom…
Correlation for permutations
J. Robert Johnson, Imre Leader, Eoin Long
In this note we investigate correlation inequalities for `up-sets' of permutations, in the spirit of the Harris--Kleitman inequality. We focus on two well-studied partial orders on…
Hypercontractivity for global functions and sharp thresholds
Peter Keevash, Noam Lifshitz, Eoin Long +1
The classical hypercontractive inequality for the noise operator on the discrete cube plays a crucial role in many of the fundamental results in the Analysis of Boolean functions,…