3 citations · 6 across the 6 of their papers we have counts for
4 papers · 1 filter
Superpolynomial lower bounds for vertex numbers of real projective space triangulations via a topological Figiel-Lindenstrauss-Milman theorem
Florian Frick, Kaave Hosseini, Eric Myzelev +2
We prove that every simplicial triangulation of real projective -space has vertices. Together with known constructions, this determines the minimum vertex num…
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…
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…
On the structure of the spectrum of small sets
Kaave Hosseini, Shachar Lovett
Let be a finite abelian group and a subset of . The spectrum of is the set of its large Fourier coefficients. Known combinatorial results on the structure of spectru…