<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">cheb</journal-id><journal-title-group><journal-title xml:lang="ru">Чебышевский сборник</journal-title><trans-title-group xml:lang="en"><trans-title>Chebyshevskii Sbornik</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">2226-8383</issn><publisher><publisher-name>Tula State Lev Tolstoy  Pedagogical University</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.22405/2226-8383-2017-18-2-267-274</article-id><article-id custom-type="elpub" pub-id-type="custom">cheb-337</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>Статьи</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="en"><subject>Article</subject></subj-group></article-categories><title-group><article-title>СУММЫ ХАРАКТЕРОВ НА СДВИНУТЫХ СТЕПЕНЯХ</article-title><trans-title-group xml:lang="en"><trans-title>CHARACTER SUMS OVER SHIFTED POWERS</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Штейников</surname><given-names>Ю. Н.</given-names></name><name name-style="western" xml:lang="en"><surname>Shteinikov</surname><given-names>Yu. N.</given-names></name></name-alternatives><email xlink:type="simple">yuriisht@yandex.ru</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Математический институт имени В. А. Стеклова, ФГУ ФНЦ Научно-исследовательский институт системных исследований Российской академии наук</institution><country>Россия</country></aff><aff xml:lang="en"><institution>Steklov Mathematical Institute of RAS, Scientific Research Institute of System Analysis</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2017</year></pub-date><pub-date pub-type="epub"><day>24</day><month>12</month><year>2017</year></pub-date><volume>18</volume><issue>2</issue><fpage>267</fpage><lpage>274</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Штейников Ю.Н., 2017</copyright-statement><copyright-year>2017</copyright-year><copyright-holder xml:lang="ru">Штейников Ю.Н.</copyright-holder><copyright-holder xml:lang="en">Shteinikov Y.N.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://www.chebsbornik.ru/jour/article/view/337">https://www.chebsbornik.ru/jour/article/view/337</self-uri><abstract><p>Мы изучаем суммы характеров на множестве сдвинутых степеней по модулю простого числа p. Такие суммы могут рассматриваться как обобщение сумм характеров от сдвинутой подгруппы. Случай, когда подгруппа имеет размер меньше √p, вопрос о нетривиальных по порядку верхних оценок таких сумм остается открытым и на сегодня является нерешенным. Он был предложен Ж. Бургейном и М. Ч. Чанг в обзоре 2010 года. Тем не менее, некоторых промежуточных результатов добился профессор К. Гонг, установивший нетривиальные оценки таких сумм в случае когда подгруппа имеет размер существенно больше √p. В данной работе получены некоторые новые результаты на верхнюю оценку абсолютного значения обобщения таких сумм, которые являются неполными суммами характеров от сдвинутых подгрупп. Дано два доказательства основного утверждения. Первое из них основано на сведении указанной суммы к известной оценке А. Вейля и приеме сглаживания сумм. Применяется также прием оценки неполной суммы через полную. Используется также один результат М. З. Гараева. Второе доказательство основано на оригинальной идее И. М. Виноградова. Этот подход был предложен для уточнения известного неравенства Пойа-Виноградова и использует в своей сути некоторые геометрические и комбинаторные идеи. Второе доказательство приведено не в полной мере. Мы лишь доказываем некоторое ключевое утверждение и за остальными выкладками отсылаем читателя к самой работе И. М. Виноградова.</p></abstract><trans-abstract xml:lang="en"><p>We study character sums over shifted powers modulo a prime p. Such sums can be viewed as generalizations of character sums over shifted multiplicative subgroups. We obtain some new results on upper estimates for absolute value of these sums. The case when the cardinality of subgroup is less than √p, it is a question of non-trivial upper bounds for such sums that remains open and is unsolved today. It was proposed by J. Burgain and M. Ch. Chang in the review of 2010. Nevertheless, some intermediate results were achieved by Professor K. Gong, who established non-trivial estimates of such sums in the case when the subgroup is much larger than √p. In this paper, we obtain some new results on the upper bound for the absolute value of the generalization of such sums, which are incomplete sums of character sums over shifted subgroups. Two proofs of the main result are given. The first one is based on reduction of this sum to the well-known estimate of A. Weil and the method of smoothing such sums. The method of estimating the incomplete sum through the full one is also applied. One result of M. Z. Garaev is also used. The second proof is based on the original idea of I. M. Vinogradov. This approach was proposed to refine the known inequality of Poya-Vinogradov and uses in its essence some geometric and combinatorial ideas. The second proof is not fully presented. We only prove a key statement, and for the rest of the calculations we refer the reader to the initial work of I. M. Vinogradov.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>конечные поле</kwd><kwd>степени</kwd><kwd>суммы</kwd></kwd-group><kwd-group xml:lang="en"><kwd>finite field</kwd><kwd>powers</kwd><kwd>sums</kwd></kwd-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Hong Bing Yu, Estimates of character sums with exponential function // Acta Arithmetica. 2001. Vol. 97, №3, P. 211-218.</mixed-citation><mixed-citation xml:lang="en">Hong Bing Yu, Estimates of character sums with exponential function // Acta Arithmetica 2001. vol. 97, no. 3, pp. 211-218.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">M. Z. Garaev, On the logarithmic factor in error term estimates in certain additive congruence problems // Acta Arith. 2006. Vol 124 , P. 27–39.</mixed-citation><mixed-citation xml:lang="en">M. Z. Garaev, On the logarithmic factor in error term estimates in certain additive congruence problems Acta Arith 2006. Vol 124, pp. 27–39.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">L. Goldmakher, Multiplicative mimicry and improvements of the P?lya-Vino gradov inequality// Algebra and Number Theory 2012. Vol. 6, No. 1, P. 123–163.</mixed-citation><mixed-citation xml:lang="en">L. Goldmakher, Multiplicative mimicry and improvements of the P?lya-Vino gradov inequality Algebra and Number Theory 2012. vol. 6, no. 1, pp. 123–163.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">C. Dartyge and A. S´ark¨ozy, On additive decompositions of the set of primitive roots modulo p// Monatsh. Math. 2013. Vol 169, P 317–328.</mixed-citation><mixed-citation xml:lang="en">C. Dartyge and A. S´ark¨ozy, On additive decompositions of the set of primitive roots modulo ???? Monatsh. Math. 2013. vol 169, pp. 317–328.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">K. Gong, C. Jia, M.A. Korolev, Shifted character sums with multiplicative coefficients, II // J. Number Theory, 2017, Vol 178, P.31–39.</mixed-citation><mixed-citation xml:lang="en">K. Gong, C. Jia, M.A. Korolev, Shifted character sums with multiplicative coefficients, II J. Number Theory 2017, vol 178, pp. 31–39.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">D.A. Frolenkov A numerically explicit version of the Polya-Vinogradov inequality // Moscow journal of Combinatorics and Number Theory, 2011, Vol 1, № 3, P. 25–41.</mixed-citation><mixed-citation xml:lang="en">D.A. Frolenkov A numerically explicit version of the Polya-Vinogradov inequality Moscow journal of Combinatorics and Number Theory 2011, vol 1, no. 3, pp. 25–41.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">D. A. Frolenkov, K. Soundararajan A generalization of the Po?lya–Vinogradov inequality // Ramanujan J., 2013 Vol 31, № 3 , P. 271–279.</mixed-citation><mixed-citation xml:lang="en">D. A. Frolenkov, K. Soundararajan A generalization of the Po?lya–Vinogradov inequality Ramanujan J. 2013. vol 31, no 3 , pp. 271–279.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">C. Pomerance Remarks on the Polya-Vinogradov inequality// IMRN, 2011, Vol 151, P. 30–41.</mixed-citation><mixed-citation xml:lang="en">C. Pomerance Remarks on the Polya-Vinogradov inequality IMRN 2011, vol 151, pp. 30–41.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">E. Dobrowolski, K. S. Williams An upper bound for the sum for a certain class of funktions f // Proccedings of the American Mathematical Society, 1992, Vol 114, № 1, P. 29–35.</mixed-citation><mixed-citation xml:lang="en">E. Dobrowolski K. S. Williams An upper bound for the sum ∑︀????+???? ????=????+1 ????(????)for a certain class of funktions f Proccedings of the American Mathematical Society, 1992, vol 114, no 1, pp. 29–35.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">I. M. Vinogradov A new improvement of the method of estimation of double sums (Russian)// Doklady Akad. Nauk SSSR (N.S), 1950, Vol 73, P. 635–638.</mixed-citation><mixed-citation xml:lang="en">I. M. Vinogradov A new improvement of the method of estimation of double sums (Russian) Doklady Akad. Nauk SSSR (N.S) 1950, vol 73, pp. 635–638.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">A. Granville, K. Soundararajan Large character sums: pretentious characters and the PolyaVinogradov theorem// J. Amer. Math. Soc. (N.S), 2007, Vol.20, P. 357–384.</mixed-citation><mixed-citation xml:lang="en">A. Granville, K. Soundararajan Large character sums: pretentious characters and the PolyaVinogradov theorem J. Amer. Math. Soc. (N.S) 2007, vol.20, pp. 357–384.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">G. Bachman, L. Rachakonda On a problem of Dobrowolski and Williams and the PolyaVinogradov inequality // Ramanujan J., 2001, Vol 5, P. 65–71.</mixed-citation><mixed-citation xml:lang="en">G. Bachman, L. Rachakonda On a problem of Dobrowolski and Williams and the PolyaVinogradov inequality Ramanujan J. 2001, vol 5, pp. 65–71.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">I. M. Vinogradov Basics of number theory// Gostechizdat (1952), 1–180.</mixed-citation><mixed-citation xml:lang="en">I. M. Vinogradov Basics of number theory// Gostechizdat (1952), pp. 1–180.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">A. A. Karatsuba Basics of analytic number theory. URSS (2004), 1–182.</mixed-citation><mixed-citation xml:lang="en">A. A. Karatsuba Basics of analytic number theory. URSS (2004), pp. 1–182.</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">T. Tao , V. Vu Additive combinatorics. Cambridge University Press 2006, P. 1-530.</mixed-citation><mixed-citation xml:lang="en">T. Tao , V. Vu Additive combinatorics. Cambridge University Press 2006, pp. 1-530.</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
