Dor Minzer

activity

20242026

most citedOn Approximability of Satisfiable k-CSPs: V

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

collaborators

Showing math.COShow all

6 papers · 1 filter

math.CO2026

A Counting Lemma for Somewhat Restricted 3-APs

Amey Bhangale, Subhash Khot, Yang P. Liu +1

For a prime $p \geq 3$ , a somewhat restricted $3$ -AP in $F_{p}^{n}$ is a triplet $(x, x + a, x + 2 a)$ , where $x \in F_{p}^{n}$ and $a \in {0, 1, 2}^{n}$ . We prove a counting lemma fo…

math.CO2025

Isoperimetric Inequalities Made Simpler

Ronen Eldan, Guy Kindler, Noam Lifshitz +1

We give an alternative, simple method to prove isoperimetric inequalities over the hypercube. In particular, we show: 1. An elementary proof of classical isoperimetric inequalities…

math.CO2024

Effective Bounds for Restricted $3$ -Arithmetic Progressions in $F_{p}^{n}$

Amey Bhangale, Subhash Khot, Dor Minzer

For a prime $p$ , a restricted arithmetic progression in $F_{p}^{n}$ is a triplet of vectors $x, x + a, x + 2 a$ in which the common difference $a$ is a non-zero element from $\{0,1…

math.CO2024

Reasonable Bounds for Combinatorial Lines of Length Three

Amey Bhangale, Subhash Khot, Yang P. Liu +1

We prove that any subset $A \subseteq [3]^{n}$ with $3^{- n} ∣ A ∣ \geq (lo g lo g lo g lo g n)^{- c}$ contains a combinatorial line of length $3$ , i.e., $x, y, z \in A$ , not all equal, with…

math.CO2024

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 $ε > 0$ and $f$ be a function on the middle slice on the Boolean c…

math.CO2024

Product Mixing in Compact Lie Groups

David Ellis, Guy Kindler, Noam Lifshitz +1

If $G$ is a group, we say a subset $S$ of $G$ is product-free if the equation $x y = z$ has no solutions with $x, y, z \in S$ . For $D \in N$ , a group $G$ is said to be $D$ -quas…

A Counting Lemma for Somewhat Restricted 3-APs

Isoperimetric Inequalities Made Simpler

Effective Bounds for Restricted 3-Arithmetic Progressions in Fpn​

Reasonable Bounds for Combinatorial Lines of Length Three

A Dense Model Theorem for the Boolean Slice

Product Mixing in Compact Lie Groups

Effective Bounds for Restricted $3$ -Arithmetic Progressions in $F_{p}^{n}$