3 papers
math.CO2026
A -Topological Framework for Sign-rank Lower Bounds
Florian Frick, Kaave Hosseini, Aliaksei Vasileuski
We develop a topological framework for proving lower bounds on sign-rank via -equivariant topology, and use it to resolve the sign-rank of the Gap Hamming Distance pr…
math.CO2025
Sparse graph counting and Kelley-Meka bounds for binary systems
Yuval Filmus, Hamed Hatami, Kaave Hosseini +1
In a recent breakthrough, Kelley and Meka (FOCS 2023) obtained a strong upper bound on the density of sets of integers without nontrivial three-term arithmetic progressions. In thi…
cs.CC2024
Refuting approaches to the log-rank conjecture for XOR functions
Hamed Hatami, Kaave Hosseini, Shachar Lovett +1
The log-rank conjecture, a longstanding problem in communication complexity, has persistently eluded resolution for decades. Consequently, some recent efforts have focused on poten…