20 citations · 33 across the 27 of their papers we have counts for
10 papers · 1 filter
A Counting Lemma for Somewhat Restricted 3-APs
Amey Bhangale, Subhash Khot, Yang P. Liu +1
For a prime , a somewhat restricted -AP in is a triplet , where and . We prove a counting lemma fo…
Reasonable Bounds for Combinatorial Lines of Length Three
Amey Bhangale, Subhash Khot, Yang P. Liu +1
We prove that any subset with contains a combinatorial line of length , i.e., , not all equal, with…
A Dense Model Theorem for the Boolean Slice
Gil Kalai, Noam Lifshitz, Dor Minzer +1
The (low soundness) linearity testing problem for the middle slice of the Boolean cube is as follows. Let and be a function on the middle slice on the Boolean c…
Product Mixing in Compact Lie Groups
David Ellis, Guy Kindler, Noam Lifshitz +1
If is a group, we say a subset of is product-free if the equation has no solutions with . For , a group is said to be -quas…
Effective Bounds for Restricted -Arithmetic Progressions in
Amey Bhangale, Subhash Khot, Dor Minzer
For a prime , a restricted arithmetic progression in is a triplet of vectors in which the common difference is a non-zero element from $\{0,1…
On -Intersecting Families of Permutations
Nathan Keller, Noam Lifshitz, Dor Minzer +1
We prove that there exists a constant such that for any and any , if is a -intersecting family of permutations then$|A|\leq…