20 citations · 58 across the 39 of their papers we have counts for
4 papers · 1 filter
Approximate polymorphisms
Gilad Chase, Yuval Filmus, Dor Minzer +2
For a function , a function is called a -polymorphism if their actions commute: $f(g(\mathsf{row}_1(Z)),\ldots,g(\maths…
Hypercontractivity on the symmetric group
Yuval Filmus, Guy Kindler, Noam Lifshitz +1
The hypercontractive inequality is a fundamental result in analysis, with many applications throughout discrete mathematics, theoretical computer science, combinatorics and more. S…
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…