Michael Jaber

collaborators

5 papers

math.CO2026

Covering $F_{2}^{n}$ with Hamming Balls

Michael Jaber, Vinayak M. Kumar

Green asked the following question concerning structures in sumsets: Suppose that $F_{2}^{n}$ is partitioned into sets $A_{1}, \dots, A_{K}$ . Does $A_{i} + A_{i}$ contain a coset of cod…

math.CO2025

Strong Bounds for Skew-Corner-Free Sets

Michael Jaber, Shachar Lovett, Anthony Ostuni

Motivated by applications to matrix multiplication algorithms, Pratt asked (ITCS'24) how large a subset of $[n] \times [n]$ could be without containing a skew-corner: three points…

math.CO2025

Quasipolynomial bounds for the corners theorem

Michael Jaber, Yang P. Liu, Shachar Lovett +2

Let $G$ be a finite abelian group and $A$ be a subset of $G \times G$ which is corner--free, meaning that there are no $x, y \in G$ and $d \in G ∖ {0}$ such that $(x, y)$ …

cs.DS2025

Linear Hashing Is Optimal

Michael Jaber, Vinayak M. Kumar, David Zuckerman

We prove that hashing $n$ balls into $n$ bins via a random matrix over $F_{2}$ yields expected maximum load $O (lo g n / lo g lo g n)$ . This matches the expected maximum load…

math.CO2025

Corners in Quasirandom Groups via Sparse Mixing

Michael Jaber, Shachar Lovett, Anthony Ostuni

We improve the best known upper bounds on the density of corner-free sets over quasirandom groups from inverse poly-logarithmic to quasi-polynomial. We make similarly substantial i…

Covering F2n​ with Hamming Balls

Strong Bounds for Skew-Corner-Free Sets

Quasipolynomial bounds for the corners theorem

Linear Hashing Is Optimal

Corners in Quasirandom Groups via Sparse Mixing

Covering $F_{2}^{n}$ with Hamming Balls