201 citations · 235 across the 24 of their papers we have counts for
8 papers · 1 filter
The Implicit Graph Conjecture is False
Hamed Hatami, Pooya Hatami
An efficient implicit representation of an -vertex graph in a family of graphs assigns to each vertex of a binary code of length so that the ad…
An Asymptotically Tight Bound on the Number of Relevant Variables in a Bounded Degree Boolean Function
John Chiarelli, Pooya Hatami, Michael Saks
We prove that there is a constant such that every Boolean function of degree at most (as a polynomial over ) is a -junta, i.e. it depends…
On the Structure of Quintic Polynomials
Pooya Hatami
We study the structure of bounded degree polynomials over finite fields. Haramaty and Shpilka [STOC 2010] showed that biased degree three or four polynomials admit a strong structu…
A characterization of functions with vanishing averages over products of disjoint sets
Hamed Hatami, Pooya Hatami, Yaqiao Li
Given , we characterize all integrable functions satisfying for any collection of disjoint…
Limits of Boolean Functions on F_p^n
Hamed Hatami, Pooya Hatami, James Hirst
We study sequences of functions of the form F_p^n -> {0,1} for varying n, and define a notion of convergence based on the induced distributions from restricting the functions to a…
An Arithmetic Analogue of Fox's Triangle Removal Argument
Pooya Hatami, Sushant Sachdeva, Madhur Tulsiani
We give an arithmetic version of the recent proof of the triangle removal lemma by Fox [Fox11], for the group . A triangle in is a triple …