메뉴 건너뛰기




Volumn 174, Issue 1, 2011, Pages 619-636

On Roth's theorem on progressions

Author keywords

[No Author keywords available]

Indexed keywords


EID: 79960008630     PISSN: 0003486X     EISSN: None     Source Type: Journal    
DOI: 10.4007/annals.2011.174.1.20     Document Type: Article
Times cited : (134)

References (23)
  • 1
    • 0001587222 scopus 로고
    • On sets of integers which contain no three terms in arithmetical progression
    • F. A. Behrend, On sets of integers which contain no three terms in arithmetical progression, Proc. Nat. Acad. Sci. U.S.A. 32 (1946), 331-332.
    • (1946) Proc. Nat. Acad. Sci. U.S.A , vol.32 , pp. 331-332
    • Behrend, F.A.1
  • 3
    • 0033269755 scopus 로고    scopus 로고
    • On triples in arithmetic progression
    • J. Bourgain, On triples in arithmetic progression, Geom. Funct. Anal. 9 (1999), 968-984.
    • (1999) Geom. Funct. Anal. , vol.9 , pp. 968-984
    • Bourgain, J.1
  • 4
    • 58449129683 scopus 로고    scopus 로고
    • Roth's theorem on progressions revisited
    • J. Bourgain, Roth's theorem on progressions revisited, J. Anal. Math. 104 (2008), 155-192.
    • (2008) J. Anal. Math. , vol.104 , pp. 155-192
    • Bourgain, J.1
  • 5
    • 0037096602 scopus 로고    scopus 로고
    • A polynomial bound in Freiman's theorem
    • M.-C. Chang, A polynomial bound in Freiman's theorem, Duke Math. J. 113 (2002), 399-419.
    • (2002) Duke Math. J. , vol.113 , pp. 399-419
    • Chang, M.-C.1
  • 6
    • 78649783399 scopus 로고    scopus 로고
    • A probabilistic technique for finding almostperiods of convolutions
    • E. Croot and O. Sisask, A probabilistic technique for finding almostperiods of convolutions, Geom. Funct. Anal. 20 (2010), 1367-1396.
    • (2010) Geom. Funct. Anal. , vol.20 , pp. 1367-1396
    • Croot, E.1    Sisask, O.2
  • 8
    • 77951671627 scopus 로고    scopus 로고
    • An improved construction of progression-free sets
    • M. Elkin, An improved construction of progression-free sets, in Symposium on Discrete Algorithms, 2010, pp. 886-905.
    • (2010) Symposium on Discrete Algorithms , pp. 886-905
    • Elkin, M.1
  • 9
    • 73649131598 scopus 로고    scopus 로고
    • The true complexity of a system of linear equations
    • W. T. Gowers and J. Wolf, The true complexity of a system of linear equations, Proc. Lond. Math. Soc. 100 (2010), 155-176.
    • (2010) Proc. Lond. Math. Soc. , vol.100 , pp. 155-176
    • Gowers, W.T.1    Wolf, J.2
  • 10
    • 30444444051 scopus 로고    scopus 로고
    • Roth's theorem in the primes
    • B. Green, Roth's theorem in the primes, Ann. of Math. 161 (2005), 1609-1636.
    • (2005) Ann. of Math. , vol.161 , pp. 1609-1636
    • Green, B.1
  • 12
    • 0001260803 scopus 로고
    • Integer sets containing no arithmetic progressions
    • D. R. Heath-Brown, Integer sets containing no arithmetic progressions, J. London Math. Soc. 35 (1987), 385-394.
    • (1987) J. London Math. Soc. , vol.35 , pp. 385-394
    • Heath-Brown, D.R.1
  • 13
    • 79251557805 scopus 로고    scopus 로고
    • On additive doubling and energy
    • N. H. Katz and P. Koester, On additive doubling and energy, SIAM J. Discrete Math. 24 (2010), 1684-1693.
    • (2010) SIAM J. Discrete Math , vol.24 , pp. 1684-1693
    • Katz, N.H.1    Koester, P.2
  • 14
    • 58149209289 scopus 로고
    • On subsets of finite abelian groups with no 3-term arithmetic progressions
    • [Mes95] R. Meshulam, On subsets of finite abelian groups with no 3-term arithmetic progressions, J. Combin. Theory Ser. A 71 (1995), 168-172.
    • (1995) J. Combin. Theory Ser. A , vol.71 , pp. 168-172
    • Meshulam, R.1
  • 15
    • 0001109640 scopus 로고
    • Sur quelques ensembles d'entiers
    • K. Roth, Sur quelques ensembles d'entiers, C. R. Acad. Sci. Paris 234 (1952), 388-390.
    • (1952) C. R. Acad. Sci. Paris , vol.234 , pp. 388-390
    • Roth, K.1
  • 16
    • 84963060265 scopus 로고
    • On certain sets of integers
    • K. Roth, On certain sets of integers, J. London Math. Soc. 28 (1953), 104-109.
    • (1953) J. London Math. Soc. , vol.28 , pp. 104-109
    • Roth, K.1
  • 17
    • 0011047766 scopus 로고
    • On sets of integers which contain no three terms in arithmetical progression
    • U.S.A
    • R. Salem and D. C. Spencer, On sets of integers which contain no three terms in arithmetical progression, Proc. Nat. Acad. Sci. U. S. A. 28 (1942), 561-63.
    • (1942) Proc. Nat. Acad. Sci. , vol.28 , pp. 561-563
    • Salem, R.1    Spencer, D.C.2
  • 19
    • 79957855477 scopus 로고    scopus 로고
    • Near optimal bounds in Freiman's theorem
    • T. Schoen, Near optimal bounds in Freiman's theorem, Duke Math. J. 158 (2011), 1-12.
    • (2011) Duke Math. J. , vol.158 , pp. 1-12
    • Schoen, T.1
  • 21
    • 0006669812 scopus 로고
    • Integer sets containing no arithmetic progressions
    • E. Szemerédi, Integer sets containing no arithmetic progressions, Acta Math. Hungar. 56 (1990), 155-158.
    • (1990) Acta Math. Hungar , vol.56 , pp. 155-158
    • Szemerédi, E.1
  • 22
    • 33947248273 scopus 로고    scopus 로고
    • Additive Dombinatorics
    • Cambridge Univ. Press, Cambridge
    • T. Tao and V. Vu, Additive Dombinatorics, Cambridge Stud. Adv. Math. 105, Cambridge Univ. Press, Cambridge, 2006.
    • (2006) Cambridge Stud. Adv. Math. , pp. 105
    • Tao, T.1    Vu, V.2
  • 23
    • 0012972085 scopus 로고    scopus 로고
    • On the best constant in Marcinkiewicz- Zygmund inequality
    • R. Yao-Feng and L. Han-Ying, On the best constant in Marcinkiewicz- Zygmund inequality, Stat. Prob. Lett. 53 (2001), 227-233.
    • (2001) Stat. Prob. Lett. , vol.53 , pp. 227-233
    • Yao-Feng, R.1    Han-Ying, L.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.