<?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-2016-17-2-56-63</article-id><article-id custom-type="elpub" pub-id-type="custom">cheb-229</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>ON SQUARES IN SPECIAL SETS OF FINITE FIELDS</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>Gabdullin</surname><given-names>M.</given-names></name></name-alternatives><bio xml:lang="en"><p>Moscow</p></bio><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Московский государственный университет  им. М. В. Ломоносова;&#13;
Институт математики и механики Уральского  отделения Российской академии наук</institution><country>Россия</country></aff><aff xml:lang="en"><institution>Московский государственный университет  им. М. В. Ломоносова;&#13;
Институт математики и механики Уральского  отделения Российской академии наук</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2016</year></pub-date><pub-date pub-type="epub"><day>04</day><month>09</month><year>2016</year></pub-date><volume>17</volume><issue>2</issue><fpage>56</fpage><lpage>63</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Габдуллин М.Р., 2016</copyright-statement><copyright-year>2016</copyright-year><copyright-holder xml:lang="ru">Габдуллин М.Р.</copyright-holder><copyright-holder xml:lang="en">Gabdullin M.</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/229">https://www.chebsbornik.ru/jour/article/view/229</self-uri><abstract><p>В теории чисел имеется обширная тематика, связанная с изучением арифметических свойств чисел с ”пропущенными цифрами“(т.е. тех чисел, цифры которых в фиксированной системе счисления принадлежат заданному множеству). В настоящей работе изучается аналог таких задач в конечных полях. Рассмотрим линейное пространство, образованное элементами конечного поля Fq, где q = p r , над Fp. Пусть {a1, . . . , ar} — базис этого пространства. Тогда каждый элемент x ∈ Fq имеет единственное представление в виде Pr j=1 cjaj , где cj ∈ Fp; коэффициенты cj можно назвать ”цифрами“. Пусть D ⊂ Fp.</p><p>Рассмотрим множество WD тех элементов x ∈ Fq, для которых cj ∈ D при всех 1 ≤ j ≤ r. При этом элементы D \ Fp можно назвать ”пропущенными цифрами“. В недавней работе C.Dartyge, C.Mauduit, A.S´ark¨ozy было показано, что если множество D достаточно велико, то во множестве WD имеются квадраты. В данной работе исследуется более общая задача. Зафиксируем множества D1, . . . , Dr ⊂ Fp и пусть W = W(D1, . . . , Dr) — множество тех элементов x ∈ Fq, для которых cj ∈ Dj при всех 1 ≤ j ≤ r. Доказана оценка на количество квадратов во множестве W, из которой вытекают следующие два утверждения:</p><p>1) если для некоторого ε &gt; 0 выполнено Qr i=1 |Di | ≥ (2r − 1)rp r(1/2+ε) , то справедлива асимптотическая оценка |W ∩ Q| = |W| 1 2 + O(p −ε/2 ) ;</p><p>2) при Qr i=1 |Di | ≥ 8(2r − 1)rp r/2 во множестве W имеются ненулевые квадраты.</p></abstract><trans-abstract xml:lang="en"><p>A large part of number theory deals with arithmetic properties of numbers with “missing digits” (that is numbers which digits in a number system with a fixed base belong to a given set). The present paper explores the analog of such a similar problem in the finite field.</p><p>We consider the linear vector space formed by the elements of the finite field Fq with q = p r over Fp. Let {a1, . . . , ar} be a basis of this space. Then every element x ∈ Fq has a unique representation in the form Pr j=1 cjaj with cj ∈ Fp; the coefficients cj may be called “digits”. Let us fix the set D ⊂ Fp and let WD be the set of all elements x ∈ Fq such that all its digits belong to the set D. In this connection the elements of Fp \ D may be called “missing digits”. In a recent paper of C.Dartyge, C.Mauduit, A.S´ark¨ozy it has been shown that if the set D is quite large then there are squares in the set WD. In this paper more common problem is considered.</p><p>Let us fix subsets D1, . . . , Dr ⊂ Fp and consider the set W = W(D1, . . . , Dr) of all elements x ∈ Fq such that cj ∈ Dj for all 1 ≤ j ≤ r. We prove an estimate for the number of squares in the set W, which implies the following assertions:</p><p>1) if Qr i=1 |Di | ≥ (2r − 1)rp r(1/2+ε) for some ε &gt; 0, then the asymptotic formula |W ∩ Q| = = |W| 1 2 + O(p −ε/2 ) is valid;</p><p>2) if Qr i=1 |Di | ≥ 8(2r − 1)rp r/2 , then there exist nonzero squares in the set W.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>конечные поля</kwd><kwd>квадраты</kwd><kwd>суммы характеров</kwd></kwd-group><kwd-group xml:lang="en"><kwd>finite fields</kwd><kwd>squares</kwd><kwd>character sums</kwd></kwd-group><funding-group><funding-statement xml:lang="ru">Российский научный фонд</funding-statement></funding-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Banks W. D., Conflitti A., Shparlinski I. E. Character sums over integers with restricted g-ary digits // Illinois J. Math. 2002. Vol. 46, №3. P. 819–836.</mixed-citation><mixed-citation xml:lang="en">Banks, W. D., Conflitti, A. &amp; Shparlinski, I. E. 2002, “Character sums over integers with restricted g-ary digits”, Illinois J. Math., vol. 46, no. 3, pp. 819–836.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Banks W. D., Shparlinski I. E. Arithmetic properties of numbers with restricted digits // Acta Arith. 2004. Vol. 112. P. 313–332.</mixed-citation><mixed-citation xml:lang="en">Banks, W. D. &amp; Shparlinski, I. E. 2004, “Arithmetic properties of numbers with restricted digits”, Acta Arith., vol. 112, pp. 313–332.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Col S. Propri´et´es multiplicatives d’entiers soumis `a des contraintes digitales // Th`ese de doctorat de math´ematiques de l’Universit´e Henri Poincar´e-Nancy. 2006. Vol. 1.</mixed-citation><mixed-citation xml:lang="en">Col, S. 2006, “Propri´et´es multiplicatives d’entiers soumis `a des contraintes digitales”, Th`ese de doctorat de math´ematiques de l’Universit´e Henri Poincar´e-Nancy, vol. 1.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Col S. Diviseurs des nombres ellips´ephiques // Periodica Mathematica Hungarica. 2009. Vol. 58, №1. P. 1–23.</mixed-citation><mixed-citation xml:lang="en">Col, S. 2009, “Diviseurs des nombres ellips´ephiques. Periodica Mathematica Hungarica”, vol. 58, no. 1, pp. 1–23.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Coquet J. On the uniform distribution modulo one of some subsequences of polynomial sequences // J. Number Theory. 1978. Vol. 10, №3. P. 291–296.</mixed-citation><mixed-citation xml:lang="en">Coquet, J. 1978, “On the uniform distribution modulo one of some subsequences of polynomial sequences”, J. Number Theory, vol. 10, no. 3, pp. 291–296.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Coquet J. On the uniform distribution modulo one of some subsequences of polynomial sequences // J. Number Theory. 1980. Vol. 12, №2. P. 244–250.</mixed-citation><mixed-citation xml:lang="en">Coquet, J. 1980, “On the uniform distribution modulo one of some subsequences of polynomial sequences”, J. Number Theory, vol. 12, no. 2, pp. 244–250.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Coquet J. Graphes connexes, repr´esentation de entiers et ´equir´epartition // J. Number Theory. 1983. Vol. 16, №3. P. 363–375.</mixed-citation><mixed-citation xml:lang="en">Coquet, J. 1983, “Graphes connexes, repr´esentation de entiers et ´equir epartition”, J. Number Theory, vol. 16, no. 3, pp. 363–375.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Dartyge C., Mauduit C. Nombres presque premiers dont l‘´ecriture en base r ne comporte pas certain chiffres // Journal of Number Theory. 2000. Vol. 81. P. 270–291.</mixed-citation><mixed-citation xml:lang="en">Dartyge, C. &amp; Mauduit, C. 2000, “Nombres presque premiers dont l‘´ecriture en base r ne comporte pas certain chiffres”, Journal of Number Theory, vol. 81, pp. 270–291.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Dartyge C., Mauduit C. Ensembles de densit´e nulle contenant des entiers poss´edant au plus deux facteurs premiers // Journal of Number Theory. 2001. Vol. 91. P. 230–255.</mixed-citation><mixed-citation xml:lang="en">Dartyge, C. &amp; Mauduit, C. 2001, “Ensembles de densit´e nulle contenant des entiers poss´edant au plus deux facteurs premiers”, Journal of Number Theory, vol. 91, pp. 230–255.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Drmota M., Mauduit C. Weyl sums over integers with affine digits restriction // Journal of Number Theory. 2010. Vol. 30. P. 2404–2427.</mixed-citation><mixed-citation xml:lang="en">Drmota, M. &amp; Mauduit, C. 2010, “Weyl sums over integers with affine digits restriction”, Journal of Number Theory, vol. 30, pp. 2404–2427.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Erd˝os P., Mauduit C., S´ark¨ozy A. On the arithmetic properties of integers with missing digits I: Distribution in residue classes // Journal of Number Theory. 1998. Vol. 70, №2. P. 99–120.</mixed-citation><mixed-citation xml:lang="en">Erd˝os, P., Mauduit, C. &amp; S´ark¨ozy, A. 1998, “On the arithmetic properties of integers with missing digits I: Distribution in residue classes”, Journal of Number Theory, vol. 70, no. 2, pp. 99–120.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Konyagin S. V., Mauduit C., S´ark¨ozy A. On the number of prime factors of integers characterized by digits properties // Period. Math. Hung. 2000. Vol. 40. P. 37–52.</mixed-citation><mixed-citation xml:lang="en">Konyagin, S. V., Mauduit, C. &amp; S´ark¨ozy, A. 2000, “On the number of prime factors of integers characterized by digits properties”, Period. Math. Hung., vol. 40, pp. 37–52.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Dartyge C., S´ark¨ozy A. The sum of digits function in the finite field // Proc. Amer. Math. Soc. 2013. Vol. 141, №12. P. 4119–4124.</mixed-citation><mixed-citation xml:lang="en">Dartyge, C. &amp; S´ark¨ozy, A. 2013, “The sum of digits function in the finite field”, Proc. Amer. Math. Soc., vol. 141, no. 12, pp. 4119–4124.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Dartyge C., Mauduit C., S´ark¨ozy A. Polynomial values and generators with missing digits in finite fields // Functiones et Approximatio. 2015. Vol. 52, №1. P. 65–74.</mixed-citation><mixed-citation xml:lang="en">Dartyge, C., Mauduit, C. &amp; S´ark¨ozy, A. 2015, “Polynomial values and generators with missing digits in finite fields”, Functiones et Approximatio, vol. 52, no. 1, pp. 65–74.</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Габдуллин М. Р. О квадратах во множестве элементов конечного поля с ограничениями на коэффициенты при разложении по базису // arXiv: 1602.06603v1.</mixed-citation><mixed-citation xml:lang="en">Gabdullin, M. R., “On squares in subsets of finite fields with restrictions on coefficients of basis decomposition”, arXiv: 1602.06603v1 (Russian).</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">Dietmann R., Elsholtz C., Shparlinski I. E. Prescribing the binary digits of squarefree numbers and quadratic residues // arXiv: 1601.04754v1.</mixed-citation><mixed-citation xml:lang="en">Dietmann, R., Elsholtz, C. &amp; Shparlinski, I. E. “Prescribing the binary digits of squarefree numbers and quadratic residues”, arXiv: 1601.04754v1.</mixed-citation></citation-alternatives></ref><ref id="cit17"><label>17</label><citation-alternatives><mixed-citation xml:lang="ru">Wan D. Generators and irreducible polynomials over finite fields // Math. Comp. 1997. Vol. 66. P. 1195–1212.</mixed-citation><mixed-citation xml:lang="en">Wan, D. 1997, “Generators and irreducible polynomials over finite fields”, Math. Comp., vol. 66, pp. 1195–1212.</mixed-citation></citation-alternatives></ref><ref id="cit18"><label>18</label><citation-alternatives><mixed-citation xml:lang="ru">Winterhof A. Characters sums, primitive elements, and powers in finite fields // Journal of Number Theory. 2001. Vol. 91. P. 153–161.</mixed-citation><mixed-citation xml:lang="en">Winterhof, A. 2001, “Characters sums, primitive elements, and powers in finite fields”, Journal of Number Theory, vol. 91, pp. 153–161.</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>
