-
1
-
-
78649783399
-
A Probabilistic Technique for Finding Almost-Periods of Convolutions
-
MR2738997
-
E. Croot and O. Sisask, A Probabilistic Technique for Finding Almost-Periods of Convolutions, Geom. Funct. Anal. 20 (2010), 1367-1396. MR2738997
-
(2010)
Geom. Funct. Anal
, vol.20
, pp. 1367-1396
-
-
Croot, E.1
Sisask, O.2
-
2
-
-
84855986603
-
What is difficult about the cap set problem?
-
T. Gowers, What is difficult about the cap set problem?, http://gowers.wordpress.com/2011/01/11/what-is-difficult-about-the-cap-set-problem/.
-
-
-
Gowers, T.1
-
3
-
-
84855986599
-
-
(M. Bateman and) N.H. Katz, http://gowers.wordpress.com/2011/01/11/what-isdifficult-about-the-cap-set-problem/# comment-10533.
-
-
-
Bateman, M.1
Katz, N.H.2
-
4
-
-
84856005161
-
-
(M. Bateman and) N.H. Katz, http://gowers.wordpress.com/2011/01/11/what-isdifficult-about-the-cap-set-problem/# comment-10540.
-
-
-
Bateman, M.1
Katz, N.H.2
-
5
-
-
79251557805
-
On additive doubling and energy
-
MR2746716
-
N. H. Katz and P. Koester, On Additive Doubling and Energy, SIAM J. Discrete Math. 24 (2010), 1684-1693. MR2746716
-
(2010)
SIAM J. Discrete Math
, vol.24
, pp. 1684-1693
-
-
Katz, N.H.1
Koester, P.2
-
6
-
-
58149209289
-
On subsets of finite abelian groups with no 3-term arithmetic progressions
-
MR1335785 (96g:20033)
-
R. Meshulam, On subsets of finite abelian groups with no 3-term arithmetic progressions, J. Combin. Theory Ser. A 71 (1995), 168-172. MR1335785 (96g:20033)
-
(1995)
J. Combin. Theory Ser. A
, vol.71
, pp. 168-172
-
-
Meshulam, R.1
-
7
-
-
84855988380
-
-
Polymath on wikipedia
-
Polymath on wikipedia, http://en.wikipedia.org/wiki/Polymath project#Polymath Project.
-
-
-
-
8
-
-
84855988378
-
-
Polymath 6: Improving the bounds for Roth's theorem
-
Polymath 6: Improving the bounds for Roth's theorem, http://polymathprojects.org/2011/02/05/polymath6-improving-the-bounds-for-roths-theorem/.
-
-
-
-
9
-
-
0005877097
-
An analog of Freiman's theorem in groups
-
Ast ́erisque No, MR1701207 (2000h:11111)
-
I. Ruzsa, An analog of Freiman's theorem in groups, Structure theory of set addition, Ast ́erisque No. 258 (1999), 323-329. MR1701207 (2000h:11111)
-
(1999)
Structure Theory of Set Addition
, vol.258
, pp. 323-329
-
-
Ruzsa, I.1
-
10
-
-
39449090961
-
A note on Freiman's theorem in vector spaces
-
MR2396355 (2009a:11024)
-
T. Sanders, A note on Freiman's theorem in vector spaces, Combin. Probab. Comput. 17 (2008), 297-305. MR2396355 (2009a:11024)
-
(2008)
Combin. Probab. Comput
, vol.17
, pp. 297-305
-
-
Sanders, T.1
-
11
-
-
78049235347
-
Structure in Sets with Logarithmic Doubling
-
Arxiv 1002.1552
-
T. Sanders, Structure in Sets with Logarithmic Doubling, Arxiv 1002.1552.
-
-
-
Sanders, T.1
-
12
-
-
84864997979
-
On Roth's Theorem on Progressions
-
Arxiv 1011.0104
-
T. Sanders, On Roth's Theorem on Progressions, Arxiv 1011.0104.
-
-
-
Sanders, T.1
-
13
-
-
79957855477
-
Near optimal bounds in Freiman's theorem
-
MR2794366
-
T. Schoen, Near optimal bounds in Freiman's theorem, Duke Math. J. 158, Number 1 (2011), 1-12. MR2794366
-
(2011)
Duke Math. J
, vol.158
, Issue.1
, pp. 1-12
-
-
Schoen, T.1
-
14
-
-
41549099125
-
On sets of large trigonometric sums
-
MR2394976 (2009e:11151)
-
I. Shkredov, On sets of large trigonometric sums, 2008 Izv. Ross. Akad. Nauk Ser. Math. 72, pp. 161-182. MR2394976 (2009e:11151)
-
(2008)
Izv. Ross. Akad. Nauk Ser. Math
, vol.72
, pp. 161-182
-
-
Shkredov, I.1
-
15
-
-
33845302486
-
-
Cambridge Univ. Press, Cambridge, MR2289012 (2008a:11002)
-
T. Tao and V. Vu, Additive Combinatorics, Cambridge Univ. Press, Cambridge, 2006. MR2289012 (2008a:11002)
-
(2006)
Additive Combinatorics
-
-
Tao, T.1
Vu, V.2
|
