activity
20152022
most citedThe success probability in Lionel Levine's hat problem is strictly decreasing with the number of players, and this is related to interesting questions regarding Hamming powers of Kneser graphs and independent sets in random subgraphs

1 citations · 2 across the 3 of their papers we have counts for

collaborators
Showing cs.DMShow all

2 papers · 1 filter

cs.DM2020

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…

cs.DM2019

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…