Skip to main content
SpringerLink
Log in

An Elementary Analog of the Operator Method in Additive Combinatorics

  • Research Articles
  • Published:
Mathematical Notes Aims and scope Submit manuscript

Abstract

This paper provides an elementary proof of inequalities previously obtained by the operator method and having applications in additive combinatorics. The method of proof allows us to take a new look at a certain special case of Sidorenko’s conjecture.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1.

Similar content being viewed by others

References

  1. I. D. Shkredov, “Some applications of W. Rudin’s inequality to problems of combinatorial number theory,” Unif. Distrib. Theory 6 (2), 95–116 (2011).

    MathSciNet  MATH  Google Scholar 

  2. S. V. Konyagin, “On the estimate of the \(L_1\)-norm of an exponential sum,” in Approximation Theory of Functions and Operators Abstracts of the International Conference Dedicated to the 80th Anniversary of S. B. Stechkin (Yekaterinburg, 2000), pp. 88–89 [in Russian].

    Google Scholar 

  3. T. Schoen and I. D. Shkredov, “On sumsets of convex sets,” Combin. Probab. Comput. 20 (5), 793–798 (2011).

    Article  MathSciNet  Google Scholar 

  4. T. Schoen and I. D. Shkredov, “Higher moments of convolutions,” J. Number Theory 133 (5), 1693–1737 (2013).

    Article  MathSciNet  Google Scholar 

  5. I. D. Shkredov, “Some new results on higher energies,” Trans. Moscow Math. Soc. 74, 31–63 (2013).

    Article  MathSciNet  Google Scholar 

  6. K. I. Olmezov, A. S. Semchankau, and I. D. Shkredov, “On Popular Sums and Differences for Sets with Small Multiplicative Doubling,” Math. Notes 108 (4), 557–565 (2020).

    Article  MathSciNet  Google Scholar 

  7. I. D. Shkredov, “On sums of Szemerédi–Trotter sets,” Proc. Steklov Inst. Math. 289, 300–309 (2015).

    Article  MathSciNet  Google Scholar 

  8. B. Murphy, M. Rudnev, I. D. Shkredov, and Y. N. Shteinikov, On the Few Products, Many Sums Problem, arXiv: 1712.00410v1 (2017).

  9. I. D. Shkredov, “Fourier analysis in combinatorial number theory,” Russian Math. Surveys 65 (3), 513–567 (2010).

    Article  MathSciNet  Google Scholar 

  10. A. Sidorenko, “A correlation inequality for bipartite graphs,” Graphs Combin. 9 (2), 201–204 (1993).

    Article  MathSciNet  Google Scholar 

  11. H. Hatami, “Graph norms and Sidorenko’s conjecture,” Israel J. Math. 175, 125–150 (2010).

    Article  MathSciNet  Google Scholar 

  12. D. Conlon, J. Fox, and B. Sudakov, “An approximate version Sidorenko’s conjecture,” Geom. Funct. Anal. 20 (6), 1354–1366 (2010).

    Article  MathSciNet  Google Scholar 

Download references

Funding

This work was supported by the Grant of the Government of the Russian Federation, decree no. 220 (grant no. 075-15-2019-1926)

Author information

Authors and Affiliations

  1. Moscow Institute of Physics and Technology (State University), 141701, Dolgoprudnyi, Russia

    K. I. Ol’mezov

Authors
  1. K. I. Ol’mezov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to K. I. Ol’mezov.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ol’mezov, K.I. An Elementary Analog of the Operator Method in Additive Combinatorics. Math Notes 109, 110–119 (2021). https://doi.org/10.1134/S0001434621010132

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0001434621010132

Keywords

Search

Navigation