20 citations · 69 across the 36 of their papers we have counts for
5 papers · 1 filter
Approximation by juntas in the symmetric group, and forbidden intersection problems
David Ellis, Noam Lifshitz
A family of permutations is said to be -intersecting if any two permutations in agree on at least points. It is said to be -…
High dimensional Hoffman bound and applications in extremal combinatorics
Yuval Filmus, Konstantin Golubev, Noam Lifshitz
One powerful method for upper-bounding the largest independent set in a graph is the Hoffman bound, which gives an upper bound on the largest independent set of a graph in terms of…
Towards a Proof of the Fourier--Entropy Conjecture?
Esty Kelman, Guy Kindler, Noam Lifshitz +2
The total influence of a function is a central notion in analysis of Boolean functions, and characterizing functions that have small total influence is one of the most fundamental…
AND Testing and Robust Judgement Aggregation
Yuval Filmus, Noam Lifshitz, Dor Minzer +1
A function is called an approximate AND-homomorphism if choosing randomly, we have that $f({\bf x}\land {\bf y}) = f({\b…
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,…