Arrow Research search

Author name cluster

Roy Meshulam

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

3 papers
2 author rows

Possible papers

3

STOC Conference 2008 Conference Paper

Inverse conjecture for the gowers norm is false

  • Shachar Lovett
  • Roy Meshulam
  • Alex Samorodnitsky

Let p be a fixed prime number and N be a large integer. The "Inverse Conjecture for the Gowers Norm" states that if the "d-th Gowers norm" of a function f:F N p to F p is non-negligible, that is larger than a constant independent of N, then f has a non-trivial correlation with a degree d-1 polynomial. The conjecture is known to hold for d=2,3 and for any prime p. In this paper we show the conjecture to be false for p=2 and for d=4, by presenting an explicit function whose 4-th Gowers norm is non-negligible, but whose correlation with any polynomial of degree 3 is exponentially small. Essentially the same result, with different bounds for correlation, was independently obtained by Green and Tao. Their analysis uses a modification of a Ramsey-type argument of Alon and Beigel to show inapproximability of certain functions by low-degree polynomials. We observe that a combination of our results with the argument of Alon and Beigel implies the inverse conjecture to be false for any prime p, for d = p 2 .

STOC Conference 2002 Conference Paper

Expanders from symmetric codes

  • Roy Meshulam
  • Avi Wigderson

(MATH) A set S in the vector space FF p n is "good" if it satisfies the following (almost) equivalent conditions: S is an expanding generating set of Abelian group FF p n .

TCS Journal 1984 Journal Article

A geometric construction of a superconcentrator of depth 2

  • Roy Meshulam

We construct an N-superconcentrator of depth 2, with 3 N 3 2 +O(N 17 12 ) edges, by essentially duplicating the lines vs. points incidence graph of a projective plane. The validity of the construction rests mainly on the following theorem: If A and B are sets of points in a linear space such that ⋎A⋎=⋎B⋎=n and A∪B is not collinear, then there are at least n lines in the space which intersect both A and B. When A = B, this result reduces to a theorem of De Bruijin and Erdös (1948).

v2026.09.13