NewEvery arXiv paper, its researchers & institutions — mapped.
papers

Publications (43)

math.CO2013

Limits of local-global convergent graph sequences

Hamed Hatami, László Lovász, Balázs Szegedy

cs.CC2012

Spectral Norm of Symmetric Functions

Anil Ada, Omar Fawzi, Hamed Hatami

cs.CC2016

Trading information complexity for error

Yuval Dagan, Yuval Filmus, Hamed Hatami +1

math.FA2008

Graph norms and Sidorenko's conjecture

Hamed Hatami

math.CO2006

Sharp Thresholds for Constraint Satisfaction Problem and Graph Homomorphisms

Hamed Hatami, Michael Molloy

math.CO2011

Non-three-colorable common graphs exist

Hamed Hatami, Jan Hladky, Daniel Kral +2

cs.CC2013

Correlation Testing for Affine Invariant Properties on $\mathbb{F}_p^n$ in the High Error Regime

Hamed Hatami, Shachar Lovett

math.CO2009

Sharp thresholds for constraint satisfaction problems and homomorphisms

Hamed Hatami, Michael Molloy

math.CO2016

On the additive bases problem in finite fields

Hamed Hatami, Victoria de Quehen

math.CO2006

A lower bound for the size of the largest critical sets in Latin squares

Hamed Hatami, Ebadollah S. Mahmoodian

math.CO2015

A characterization of functions with vanishing averages over products of disjoint sets

Hamed Hatami, Pooya Hatami, Yaqiao Li

math.FA2007

Amenability constants for semilattice algebras

Mahya Ghandehari, Hamed Hatami, Nico Spronk

math.CO2013

Graph properties, graph limits and entropy

Hamed Hatami, Svante Janson, Balázs Szegedy

math.CO2009

On the spectrum of the forced matching number of graphs

Peyman Afshani, Hamed Hatami, Ebadollah S. Mahmoodian

math.CO2010

Undecidability of linear inequalities in graph homomorphism densities

Hamed Hatami, Serguei Norine

math.CO2011

A structure theorem for Boolean functions with small total influences

Hamed Hatami

cs.CC2006

On the Computational Complexity of Defining Sets

Hamed Hatami, Hossein Maserrat

cs.CG2009

Approximation and Inapproximability Results for Maximum Clique of Disc Graphs in High Dimensions

Peyman Afshani, Hamed Hatami

math.NT2014

General systems of linear forms: equidistribution and true complexity

Hamed Hatami, Pooya Hatami, Shachar Lovett

math.CO2006

Circular chromatic index of graphs of maximum degree 3

Peyman Afshani, Mahsa Ghandehari, Mahya Ghandehari +3

cs.DS2006

Integrality gaps of semidefinite programs for Vertex Cover and relations to $\ell_1$ embeddability of Negative Type metrics

Hamed Hatami, Avner Magen, Vangelis Markakis

math.CO2012

On the Number of Pentagons in Triangle-Free Graphs

Hamed Hatami, Jan Hladký, Daniel Král +2

math.CO2016

On the boundary of the region defined by homomorphism densities

Hamed Hatami, Sergey Norin

cs.CC2013

Every locally characterized affine-invariant property is testable

Arnab Bhattacharyya, Eldar Fischer, Hamed Hatami +2

cs.CG2006

On the Complexity of the Circular Chromatic Number

Hamed Hatami, Ruzbeh Tusserkani

cs.CC2015

On the sum of the L1 influences of bounded functions

Yuval Filmus, Hamed Hatami, Nathan Keller +1

math.CO2009

On generalizations of Gowers norms and their geometry

Hamed Hatami

cs.DM2019

Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions

Yuval Filmus, Lianna Hambardzumyan, Hamed Hatami +2

math.PR2009

Decision trees and influences of variables over product probability spaces

Hamed Hatami

cs.CC2013

Estimating the distance from testable affine-invariant properties

Hamed Hatami, Shachar Lovett

math.NT2011

Higher-order Fourier analysis of $\mathbb{F}_p^n$ and the complexity of systems of linear forms

Hamed Hatami, Shachar Lovett

math.CO2013

Limits of Boolean Functions on F_p^n

Hamed Hatami, Pooya Hatami, James Hirst

math.CO2006

$Δ+300$ is a Bound on the Adjacent Vertex Distinguishing Edge Chromatic Number

Hamed Hatami

math.CO2006

Fourier analysis and large independent sets in powers of complete graphs

Mahya Ghandehari, Hamed Hatami

cs.CC2017

Information complexity of the AND function in the two-Party, and multiparty settings

Yuval Filmus, Hamed Hatami, Yaqiao Li +1

math.CO2016

Teaching dimension, VC dimension, and critical sets in Latin squares

Hamed Hatami, Yingjie Qian

cs.CC2017

The Unbounded-Error Communication Complexity of symmetric XOR functions

Hamed Hatami, Yingjie Qian

math.CO2011

The inducibility of blow-up graphs

Hamed Hatami, James Hirst, Serguei Norine

math.CO2009

The scaling window for a random graph with a given degree sequence

Hamed Hatami, Michael Molloy

math.CO2012

The entropy of random-free graphons and properties

Hamed Hatami, Serguei Norine

math.CO2006

Random cubic graphs are not homomorphic to the cycle of size 7

Hamed Hatami

math.CO2009

Perfect dominating sets in the Cartesian products of prime cycles

Hamed Hatami, Pooya Hatami

math.CO2006

On the size of the minimum critical set of a Latin square

Mahya Ghandehari, Hamed Hatami, Ebadollah S. Mahmoodian