Loading [MathJax]/jax/output/SVG/config.js
Russian Mathematical Surveys
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Uspekhi Mat. Nauk:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Russian Mathematical Surveys, 2015, Volume 70, Issue 1, Pages 113–163
DOI: https://doi.org/10.1070/RM2015v070n01ABEH004938 (Mi rm9647) 		 
This article is cited in 1 scientific paper (total in 1 paper)

Structure theorems in additive combinatorics

I. D. Shkredovab

a Steklov Mathematical Institute of Russian Academy of Sciences
b Institute for Information Transmission Problems of the Russian Academy of Sciences (Kharkevich Institute)
English version PDF (952 kB) Citations (1) Russian version article
References:
PDF
HTML
DOI: https://doi.org/10.1070/RM2015v070n01ABEH004938
Abstract: Several structure results of additive combinatorics are considered. Classical and modern problems of combinatorial number theory, higher-order Fourier analysis, inverse theorems for Gowers norms, higher energies, and the relationship between combinatorial and analytic number theory are discussed.
Bibliography: 149 titles.
Keywords: additive combinatorics, sets with the small doubling property, Gowers norms, Fourier analysis.
Funding agency Grant number
Russian Science Foundation 14-11-00433
This research was supported by the Russian Science Foundation (grant no. 14-11-00433).
Received: 27.08.2014
Bibliographic databases:
Document Type: Article
UDC: 511.34
MSC: Primary 11B30; Secondary 11B13, 11P70
Language: English
Original paper language: Russian
Citation: I. D. Shkredov, “Structure theorems in additive combinatorics”, Russian Math. Surveys, 70:1 (2015), 113–163
Citation in format AMSBIB
\Bibitem{Shk15}
\by I.~D.~Shkredov
\paper Structure theorems in additive combinatorics
\jour Russian Math. Surveys
\yr 2015
\vol 70
\issue 1
\pages 113--163
\mathnet{http://mi.mathnet.ru/eng/rm9647}
\crossref{https://doi.org/10.1070/RM2015v070n01ABEH004938}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3353118}
\zmath{https://zbmath.org/?q=an:06458418}
\adsnasa{https://adsabs.harvard.edu/cgi-bin/bib_query?2015RuMaS..70..113S}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000354181700004}
\elib{https://elibrary.ru/item.asp?id=23421576}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84929244673}
Linking options:
  • https://www.mathnet.ru/eng/rm9647
  • https://doi.org/10.1070/RM2015v070n01ABEH004938
  • https://www.mathnet.ru/eng/rm/v70/i1/p123
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Успехи математических наук Russian Mathematical Surveys
    Statistics & downloads:
    Abstract page:1105
    Russian version PDF:532
    English version PDF:91
    References:82
    First page:67
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025