20 citations · 27 across the 9 of their papers we have counts for
16 papers
On Shapley Values and Threshold Intervals
Gil Kalai, Noam Lifshitz
Let be a monotone Boolean functions, let denote the Shapley value of the th variable and denote the Banzhaf value (influence) of…
Completing the proof of the Liebeck--Nikolov--Shalev conjecture
Noam Lifshitz
Liebeck, Nikolov, and Shalev conjectured the existence of an absolute constant , such that for every subset of a finite simple group with , there exists $C\l…
Initiating the proof of the Liebeck--Nikolov--Shalev conjecture
Nick Gill, Noam Lifshitz, László Pyber +1
Liebeck, Nikolov, and Shalev conjectured that for every subset A of a finite simple group S with |A|>1, there exist O( log|S| / log|A| ) conjugates of A whose product is S. This pa…
On the Largest Product-free Subsets of the Alternating Groups
Peter Keevash, Noam Lifshitz, Dor Minzer
A subset of a group is called product-free if there is no solution to with all in . It is easy to see that the largest product-free subset of the symmetri…
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…