Graph products, fourier analysis and spectral techniques

Geometric and Functional Analysis

Volumn 14, Issue 5, 2004, Pages 913-940

  Alon, N ^a   Dinur, I ^b   Friedgut, E ^c   Sudakov, B ^d,e  

^a TEL AVIV UNIVERSITY   (Israel)

^b NEC LABORATORIES AMERICA   (United States)

^c HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^d PRINCETON UNIVERSITY   (United States)

^e INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 12744277463     PISSN: 1016443X     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00039-004-0478-3     Document Type: Article

References (31)

1. [A1] N. ALON, Spectral techniques in graph algorithms, Springer Lecture Notes in Computer Science 1380 (C.L. Lucchesi, A.V. Moura, eds.) (1998), 206-215.
2. [A2] N. ALON, Graph powers, in "Contemporary Combinatorics (B. Bollobás, ed.), Bolyai Society Mathematical Studies, Springer (2002), 11-28.
3. th ACM STOC, ACM Press (1994), 346-355; also; SIAM J. Comput. 26 (1997), 1733-1748.
4. th ACM STOC, ACM Press (1994), 346-355; also; SIAM J. Comput. 26 (1997), 1733-1748.
5. rd IEEE FOCS, Pittsburgh, IEEE (1992), 334-343; also: Theoretical Computer Science 130 (1994), 175-201.
6. rd IEEE FOCS, Pittsburgh, IEEE (1992), 334-343; also: Theoretical Computer Science 130 (1994), 175-201.
7. [ALM] N. ALON, N. LINIAL, R. MESHULAM, Additive bases of vector spaces over prime fields, J. Combinatorial Theory, Ser. A 57 (1991), 203-210.
8. [BS] R.C. BAKER, W.M. SCHMIDT, Diophantine problems in variables restricted to the values 0 and 1, J. Number Theory 12 (1980), 460-486.
9. [Be] W. BECKNER, Inequalities in Fourier analysis, Annals of Mathematics, 102 (1975), 159-182.
10. [BenKS] I. BENJAMINI, G. KALAI, O. SCHRAMM, Noise sensitivity of boolean functions and applications to percolation, Inst. Hautes Etudes Sci. Publ. Math. 90 (1999), 5-43 (2001).
11. p(G), Ann. Inst. Fourier (Grenoble) 20:2 (1970), 335-402.
12. p product spaces, Seminaire D'Analyse Fonctionnelle, Ecole Polytechnique, Centre De Mathematiques 1979-80 (1980), 4.1-4.9.
13. [Bou2] J. BOURGAIN, On the distribution of the Fourier spectrum of Boolean functions, Israel Journal of Math., to appear.
14. [BrNR] J.I. BROWN, R.J. NOWAKOWSKI, D. RALL, The ultimate categorical independence ratio of a graph, SIAM J. Discrete Math. 9 (1996), 290-300.
15. [DFK] I. DINUR, E. FRIEDGUT, G. KINDLER, Bounded functions with decaying Fourier expansion are juntas, in preparation.
16. th ACM STOC, ACM Press (2002), 33-42.
17. [EKR] P. ERDOS, C. KO, R. RADO, Intersection theorems for systems of finite sets, Quart. J. Math. Oxford (2) 12 (1961), 313-320.
18. [F] E. FRIEDGUT, Boolean functions with low average sensitivity depend on few coordinates, Combinatorica 18:1 (1998), 27-36.
19. [FKN] E. FRIEDGUT, G. KALAI, A. NAOR, Boolean functions whose Fourier transform is concentrated on the first two levels, Adv. in Appl. Math., to appear.
20. [GL] D. GREENWELL, L. LOVÁSZ, Applications of product colorings, Acta Math. Acad. Sci. Hungar. 25:3-4 (1974), 335-340.
21. [HHP] G. HAHN, P. HELL, S. POLJAK, On the ultimate independence ratio of a graph, Europ. J. Combinatorics 16 (1995), 253-261.
22. [Ha] J. HÅSTAD, private communication.
23. [KKL] J. KAHN, G. KALAI, N. LINIAL, The influence of variables on Boolean functions, Proc. 29-th Ann. Symp. on Foundations of Comp. Sci., Computer Society Press (1988), 68-80.
24. [KiS] G. KINDLER, M. SAFRA, Noise insensitive Boolean functions are juntas, submitted.
25. [KrS] M. KRIVELEVICH, B. SUDAKOV, Pseudo-random graphs, to appear.
26. [LT] B. LAROSE, C. TARDIF, Projectivity and independent sets in powers of graphs, preprint (2003).
27. [LiMN] N. LINIAL Y. MANSOUR, N. NISAN, Constant-depth circuits, Fourier transform and learnability, Jour. Assoc. Comput. Mach. 40 (1993), 607-620.
28. [Lo] L. LOVÁSZ, On the Shannon capacity of a graph, IEEE Transactions on Information Theory IT-25 (1979), 1-7.
29. [M] R. MESHULAM, On subsets of finite abelian groups with no 3-term arithmetic progressions, Journal of Combinatorial Theory Ser. A. 71 (1995), 168-172.
30. [Mü] V. MÜLLER, On colorings of graphs without short cycles, Discrete Math. 26 (1979), 165-179.
31. [T] M. TALAGRAND, On boundaries and influences, Combinatorica 17 (1997), 275-285.