An improved construction of progression-free sets

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2010, Pages 886-905

  Elkin, Michael ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CHEMICAL REACTIONS; COMPUTATIONAL GEOMETRY; NUMBER THEORY;

ADDITIVE NUMBER THEORY; ARITHMETIC PROGRESSIONS; COMMUNICATION COMPLEXITY; FAST MATRIX MULTIPLICATION; MATRIX MULTIPLICATION; MATRIX MULTIPLICATION ALGORITHM; PROGRESSION-FREE SETS; THEORETICAL COMPUTER SCIENCE;

MATRIX ALGEBRA;

EID: 77951671627     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973075.72     Document Type: Conference Paper

References (40)

1. H. Abbott. On a conjecture of Erdocombining double acute accents and Straus on non-averaging sets of integers. In Proc. of the 5th British Combinatorial Conference, Congress Numerartium XV, pages 1-4, 1975.
2. H. Abbott. Extremal problems on non-averaging and non-dividing sets. Pacific J. Math, 91, 1980.
3. H. Abbott. On the Erdocombining double acute accents-Straus non-averaging set problem. Acta Math. Hungar., 47:117-119, 1986.
4. S. D. Adhikari. Lattice points in spheres. Bulletin of the Allahabad Mathematical Society, 8-9:1-13, 1993-1994.
5. N. Alon and A. Shapira. Linear equations, arithmetic progressions, and hypergraph property testing. In Proc. of the 16th Annual Symp. on Discr. Algorithms, pages 708-717, 2005.
6. G. E. Andrews. A lower bound for the volumes of strictly convex bodies with many boundary points. Trans. Amer. Math. Soc., 106:270-279, 1963.
7. V. I. Arnold. Statistics of integer convex polytopes. Funk. Anal. Pril. (in Russian), 14(1):1-3, 1980.
8. A. Balog and I. Barany. On the convex hull of the integer points in a disc. DIMACS Series on Discrete and Computational Geometry, 6:39-44, 1991.
9. I. Barany and D. Larman. The convex hull of the integer points in a large ball. Mathematische Annalen, 312:167-181, 1998. (Pubitemid 128375739)
10. F. Behrend. On sets of integers which contain no three terms in arithmetic progression. Proc. Nat. Acad. Sci., 32:331-332, 1946.
11. A. Bosznay. On the lower estimation of non-averaging sets. Acta Math. Hungar., 53:155-157, 1989.
12. J. Bourgain. On triples in arithmetic progression. GAFA, 9:968-984, 1999.
13. J. Bourgain. Roth's theorem in progressions revisited. manuscript, 2007.
14. T. Chan. Output-sensitive results on convex hulls, extreme points, and related problems. Discrete Computational Geometry, 16:369-387, 1996.
15. A. Chandra, M. Furst, and R. Lipton. Multi-party protocols. In Proc. of the 24th Annual Symp. on Foundations of Computer Science, FOCS'83, pages 94-99, 1983.
16. D. Coppersmith. Personal communication, 2003.
17. D. Coppersmith and M. Elkin. Sparse source-wise and pair-wise distance preservers. In SODA: ACM-SIAM Symposium on Discrete Algorithms, pages 660-669, 2005.
18. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation, 9:251-280, 1990.
19. M. Elkin. An improved construction of progression-free sets. arXiv:0801.4310v1, 2008.
20. P. Erdocombining double acute accents and P. Turán. On some sequences of integers. J. London Math. Society, 11:261-264, 1936.
21. G. A. Freiman. Inverse problems of additive number theory. Izv. Akad. Nauk SSSR (Russian) Ser. Mat., 19:275-284, 1955.
22. F. Fricker. Einführung in die Gitterpunktlehre. Birkhauser, 1982.
23. W. Gasarch, J. Glenn, and C. Kruskal. Finding large 3-free sets I: The small n case. Journal of Computer and System Sciences, 74:628-655, 2008.
24. 4(n). manuscript, 2008.
25. B. Green and J. Wolf. A note on Elkin's improvement of Behrend's construction. arXiv:0810.0732v1, 2008.
26. G. Hardy and E. Wright. An Introduction to the Theory of Numbers. Oxford Science Publications (5th Edition), 2004.
27. V. Jarnik. Über Gitterpunkte und konvex Kurven. Math. Z., 2:500-518, 1925.
28. A. Khintchine. A qualitative formulation of Kronecker's theory of approximation. Izv. Akad. Nauk. SSSR Ser. Mat. (in Russian), 12:113-122, 1948.
29. I. Laba and M. T. Lacey. On sets of integers not containing long arithmetic progressions. ArXiv Mathematics e-prints, Aug. 2001.
30. L. Moser. On non-averaging sets of integers. Canadian J. Math., 5:245-253, 1953.
31. K. O'Bryant. Sets of integers that do not contain long arythmetic progressions. arXiv:0811.3057v2, 2008.
32. F. P. Preparata and S. J. Hong. Convex hulls of finite sets of points in two and three dimensions. Communications of the ACM, 20:87-93, 1977.
33. R. Rankin. Sets not containing more than a given number of terms in arithmetic progression. Proc. Roy. Soc. Edinburgh Section A, 65:332-344, 1960.
34. K. Roth. On certain sets of integers. J. London Math. Society, 28:245-252, 1953.
35. I. Ruzsa. Solving a linear equation on a set of integers I. Acta Arithmetica, 65:259-282, 1993.
36. R. Salem and D. Spencer. On sets of integers which contain no three in arithmetic progression. Proc. Nat. Acad. Sci. (USA), 28:561-563, 1942.
37. A. Shapira. Behrend-type constructions for sets of linear equations. Acta Arithmetica, 122:17-33, 2006.
38. C. Siegel. Über die Klassenzahl quadratischer Zahlkörper. Acta Arithmetica, 1:83-86, 1935.
39. E. Szemerédi. On sets of integers containing no k elements in arithmetic progression. Acta Arithm., 27:299-345, 1975.
40. B. L. van der Waerden. Beweis einer Baudetischen Vermutung. Nieuw Arch. Wiskunde, 2(15):212-216, 1927.