Linear equations, arithmetic progressions, and hypergraph property testing

Theory of Computing

Volumn 1, Issue , 2005, Pages 177-216

  Alon, Noga ^a   Shapira, Asaf ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Additive number theory; Extremal problems; Hypergraphs; Linear algebra; Lower bounds; Property testing

Indexed keywords

ADDITIVES; GRAPHIC METHODS; LINEAR ALGEBRA; LINEAR EQUATIONS; NUMBER THEORY;

ADDITIVE NUMBER THEORY; EXTREMAL PROBLEMS; HYPER GRAPH; LOWER BOUNDS; PROPERTY-TESTING;

GRAPH THEORY;

EID: 33847313522     PISSN: None     EISSN: 15572862     Source Type: Journal    
DOI: 10.4086/toc.2005.v001a009     Document Type: Article

References (27)

1. N. ALON: Testing subgraphs in large graphs. Random Structures and Algorithms, 21: 359-370, 2002. Also, Proc. 42nd IEEE FOCS, IEEE (2001), 434-441. [FOCS:10.1109/SFCS.2001.959918, RSA:10.1002/rsa.10056]. 1.2, 1.3, 1.4, 6.2
2. N. ALON, R. A. DUKE, H. LEFMANN, V. RÖDL, and R. YUSTER: The algorithmic aspects of the regularity lemma. J. of Algorithms, 16: 80-109, 1994. Also, Proc. 33rd IEEE FOCS, Pittsburgh, IEEE (1992), 473-481. [FOCS:10.1109/SFCS.1992.267804, JAlg:10.1006/jagm.1994.1005]. 1.2
3. N. ALON, E. FISCHER, M. KRIVELEVICH, and M. SZEGEDY: Efficient testing of large graphs. Combinatorica, 20: 451-476, 2000. Also, Proc. of 40th FOCS, New York, NY, IEEE (1999), 656-666. [Combinatorica:mwapje2fdyk7ma2e]. 1.2, 4.1, 4.4, 4.7
4. N. ALON and A. SHAPIRA: A characterization of easily testable induced subgraphs. In Proc. of the 15th Annual ACM-SIAM SODA, pp. 935-944. ACM Press, 2004. Combinatorics, Probability and Computing, to appear. 1.2, 1.4, 1.5, 2.1, 6.2, 8
5. N. ALON and A. SHAPIRA: Testing subgraphs in directed graphs. JCSS, 69:354-382, 2004. Also, Proc. of the 35th STOC, 2003, 700-709. [STOC: 780542.780644, JCSS:10.1016/j.jcss.2004.04.008]. 1.2, 1.2, 1.4
6. N. ALON and A. SHAPIRA: On an extremal hypergraph problem of Brown, Erdős and Sós. Combinatorica, to appear, 2005. 1.4
7. F. A. BEHREND: On sets of integers which contain no three terms in arithmetic progression. Proc. of National Academy of Sciences USA, 32:331-332, 1946. 1.4, 6.2
8. J. BOURGAIN: On triples in arithmetic progression. Geom. and Funct. Anal., 9:968-984, 1999. [GAFA:7wqhpp8fnnuk388g]. 8
9. P. ERDŐS, P. FRANKL, and V. RÖDL: The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent. Graphs and Combin., 2:113-121, 1986. 2.1, 6.2
10. P. ERDŐS and M. SIMONOVITS: Supersaturated graphs and hypergraphs. Combinatorica, 3:181-192, 1983. 7.1, 7
11. E. FISCHER: The art of uninformed decisions: A primer to property testing. The Computational Complexity Column of The Bulletin of the European Association for Theoretical Computer Science, 75:97-126, 2001. 1.1
12. P. FRANKL and V. RÖDL: Extremal problems on set systems. Random Struct. Algorithms, 20:131-164, 2002. [RSA:10.1002/rsa.10017]. 1.2, 1.4
13. O. GOLDREICH, S. GOLDWASSER, and D. RON: Property testing and its connection to learning and approximation. JACM, 45:653-750, 1998. Also, Proc. of 37th Annual IEEE FOCS, (1996), 339-348. [FOCS:10.1109/SFCS.1996.548493, JACM:10.1145/285055.285060]. 1.1
14. O. GOLDREICH and L. TREVISAN: Three theorems regarding testing graph properties. Random Structures and Algorithms, 23: 23-57, 2003. Also, Proc. 42nd IEEE FOCS, IEEE (2001), 460-469. [FOCS:10.1109/SFCS.2001.959922, RSA:10.1002/rsa.10078]. 4.1, 4.4, 4.7, 4.4
15. W. T. GOWERS: Hypergraph regularity and the multidimensional Szemerédi theorem. Manuscript, 2004. 1.2
16. I. S. GRADSHTEYN and I. M. RYZHIK: Tables of Integrals, Series, and Products. Academic Press, 2000. 2.2
17. th ICALP, pp. 1017-1028, 2002. [ICALP:4wa2tdcqx50avb08]. 1.2, 1.2, 1.3, 1.3, 1.4, 5.2, 7
18. I. LABA and M. LACEY: On sets of integers not containing long arithmetic progressions. Manuscript, 2004. [arXiv:math/0108155]. 1.4, 2.3
19. B. NAGLE and V. RÖDL: Regularity properties for triple systems. Random Structures and Algorithms, 23:264-332, 2003. [RSA:10.1002/rsa.10094]. 1.2
20. B. NAGLE, V. RÖDL, and M. SCHACHT: The counting lemma for regular k-uniform hypegraphs. Random Structures and Algorithms, to appear. 1.2
21. R. A. RANKIN: Sets of integers containing not more than a given number of terms in arithmetical progression. Proc. Roy. Soc. Edinburgh Sect. A, 65:332-344, 1962. 1.4
22. V. R ÖDL and J. SKOKAN: Regularity lemma for k-uniform hypergraphs. Random Structures and Algorithms, 25:1-42, 2004. [RSA:10.1002/rsa.20017]. 1.2
23. D. RON: Property testing. Handbook of Randomized Computing, 2:597-649, 2001. 1.1
24. R. RUBINFELD and M. SUDAN: Robust characterization of polynomials with applications to program testing. SIAM J. on Computing, 25:252-271, 1996. [SICOMP:10.1137/S0097539793255151]. 1.1
25. I. Z. RUZSA and E. SZEMERÉDI: Triple systems with no six points carrying three triangles. In Combinatorics (Keszthely, 1976), pp. 939-945. Coll. Math. Soc. J. Bolyai, 1976. 1.4
26. A. SHAPIRA: Behrend-type constructions for sets of linear equations. Acta Arithmetica, to appear. 1.4
27. E. SZEMERÉDI: Regular partitions of graphs. In Proc. Colloque Inter. CNRS (J. C. Bermond, J. C. Fournier, M. Las Vergnas and D. Sotteau, eds.), pp. 399-401, 1978. 1.2