Noam Lifshitz
where else to find them
what they talk about
where they keep going back
no series more than once — all 3 in the filters
on a stage with
- Marc Vinyalsonce
- Nathan Lindzeyonce
- Neta Dafnionce
all 4 in the filters
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Product Mixing, Quantum Separation, and Comfortable Juntas | Beyond the Boolean Cube 2023 | 2023-06-26 |
Proves full product‑mixing for SU_n: if A,B,C have Haar measure > e^{-c n^{1/3}} then Pr[a∈A,b∈B: ab∈C] is within 1.01×μ(C), and this threshold is sharp up to… | ||
| Introduction 3 - Hyper-contractivity | Analysis and TCS Boot Camp 2023 | 2023-06-05 |
Defines the noise operator on the Boolean cube (resample each bit independently with probability 1−ε), proves Tε acts on Fourier characters by ε^{|S|} and that… | ||
| Applications in Extremal Combinatorics 1 | Analysis and TCS Boot Camp 2023 | 2023-06-05 |
Survey of how junta-style decompositions and Fourier-type bases give concrete extremal bounds: Friedgut and Kindler–Safra analogues extend to families, S_n and… | ||
| Applications in Extremal Combinatorics 2 | Analysis and TCS Boot Camp 2023 | 2023-06-05 |
Shows hypercontractivity for global functions combined with a decomposition into global parts to convert level‑d inequalities into exponentially stronger… | ||
| Complexity measures on symmetric group and beyond | ITCS 2021 | 2021-01-06 |
Defines an abstract simplicial complex framework that extends degree, decision tree complexity and sensitivity from the hypercube to domains like the symmetric… | ||
| nothing matches | ||