<?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">mais</journal-id><journal-title-group><journal-title xml:lang="ru">Моделирование и анализ информационных систем</journal-title><trans-title-group xml:lang="en"><trans-title>Modeling and Analysis of Information Systems</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1818-1015</issn><issn pub-type="epub">2313-5417</issn><publisher><publisher-name>Yaroslavl State University</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.18255/1818-1015-2015-5-723-730</article-id><article-id custom-type="elpub" pub-id-type="custom">mais-287</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>Articles</subject></subj-group></article-categories><title-group><article-title>Асимптотика моментов сингулярной функции Лебега</article-title><trans-title-group xml:lang="en"><trans-title>Asymptotic Formula for the Moments of Lebesgue’s Singular Function</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>Tимофеев</surname><given-names>Е. А.</given-names></name><name name-style="western" xml:lang="en"><surname>Timofeev</surname><given-names>E. A.</given-names></name></name-alternatives><bio xml:lang="ru"><p>доктор физ.-мат. наук, профессор кафедры теоретической информатики</p></bio><bio xml:lang="en"><p>ScD, professor</p></bio><email xlink:type="simple">timofeevEA@gmail.com</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Ярославский государственный университет им. П.Г. Демидова, ул. Советская, 14, г. Ярославль, 150000 Россия</institution><country>Россия</country></aff><aff xml:lang="en"><institution>Yaroslavl State University, Sovetskaya str., 14, Yaroslavl, 150000, Russia</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2015</year></pub-date><pub-date pub-type="epub"><day>20</day><month>10</month><year>2015</year></pub-date><volume>22</volume><issue>5</issue><fpage>723</fpage><lpage>730</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Tимофеев Е.А., 2015</copyright-statement><copyright-year>2015</copyright-year><copyright-holder xml:lang="ru">Tимофеев Е.А.</copyright-holder><copyright-holder xml:lang="en">Timofeev E.A.</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.mais-journal.ru/jour/article/view/287">https://www.mais-journal.ru/jour/article/view/287</self-uri><abstract><p>Напомним определение сингулярной функции Лебега. Пусть в результате бросания несимметричной монеты с вероятностью p выпадает решка, а с вероятностью q = 1 − p – орел. Пусть бинарное разложение ξ ∈ [0, 1]: ξ =∑∞k=1 ck2−k задается бросанием монеты бесконечно много раз, т.е. ck = 1, если результат k-го бросания – решка, и ck = 0, если – орел. Сингулярная функция Лебега L(t) является функцией распределения случайной величины ξ: L(t) = Prob{ξ &lt; t}. Хорошо известно, что L(t) строго возрастает и ее производная равна нулю почти всюду (p ̸= q). Моменты сингулярной функции Лебега определяются как Mn = Eξn. Основной результат работы – следующая оценка: Mn = O(nlog2 p).</p></abstract><trans-abstract xml:lang="en"><p>Recall Lebesgue’s singular function. Imagine ﬂipping a biased coin with probability p of heads and probability q = 1 − p of tails. Let the binary expansion of ξ ∈ [0, 1]: ξ = ∑∞ k=1 ck2−k be determined by ﬂipping the coin inﬁnitely many times, that is, ck = 1 if the k-th toss is heads and ck = 0 if it is tails. We deﬁne Lebesgue’s singular function L(t) as the distribution function of the random variable ξ: L(t) = Prob{ξ &lt; t}. It is well-known that L(t) is strictly increasing and its derivative is zero almost everywhere (p ̸= q). The moments of Lebesque’ singular function are deﬁned as Mn = Eξn. The main result of this paper is the following: Mn = O(nlog2 p).</p></trans-abstract><kwd-group xml:lang="ru"><kwd>моменты</kwd><kwd>само-подобие</kwd><kwd>функция Лебега</kwd><kwd>сингулярная функция</kwd><kwd>преобразование Меллина</kwd><kwd>асимптотика</kwd></kwd-group><kwd-group xml:lang="en"><kwd>moments</kwd><kwd>self-similar</kwd><kwd>Lebesgue’s function</kwd><kwd>singular</kwd><kwd>Mellin transform</kwd><kwd>asymptotic</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">Flajolet P., Sedgewick R., Analytic Combinatorics, Cambridge University Press, 2008.</mixed-citation><mixed-citation xml:lang="en">Flajolet P., Sedgewick R., Analytic Combinatorics, Cambridge University Press, 2008.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Lomnicki Z., Ulam S. E., “Sur la theorie de la mesure dans les espaces combinatoires et son application au calcul des probabilites. I. Variables independantes”, Fundamenta Mathematicae, 23:1 (1934), 237–278.</mixed-citation><mixed-citation xml:lang="en">Lomnicki Z., Ulam S. E., “Sur la theorie de la mesure dans les espaces combinatoires et son application au calcul des probabilites. I. Variables independantes”, Fundamenta Mathematicae, 23:1 (1934), 237–278.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Salem R., “On some singular monotonic functions which are strictly increasing,”, Trans. Amer. Math. Soc., 53:3 (1943), 427–439.</mixed-citation><mixed-citation xml:lang="en">Salem R., “On some singular monotonic functions which are strictly increasing,”, Trans. Amer. Math. Soc., 53:3 (1943), 427–439.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">De Rham G., “On Some Curves Deﬁned by Functional Equations”, Classics on Fractals, ed. Gerald A. Edgar (Ed.), Addison-Wesley, 1993, 285–298.</mixed-citation><mixed-citation xml:lang="en">De Rham G., “On Some Curves Deﬁned by Functional Equations”, Classics on Fractals, ed. Gerald A. Edgar (Ed.), Addison-Wesley, 1993, 285–298.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Szpankowski W.,, Average Case Analysis of Algorithms on Sequences, John Wiley &amp; Sons, New York, 2001.</mixed-citation><mixed-citation xml:lang="en">Szpankowski W.,, Average Case Analysis of Algorithms on Sequences, John Wiley &amp; Sons, New York, 2001.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Gradstein I. S., Ryzhik I. M., Table of integrals, Series, and Products, Academic Press, 1994.</mixed-citation><mixed-citation xml:lang="en">Gradstein I. S., Ryzhik I. M., Table of integrals, Series, and Products, Academic Press, 1994.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Timofeev E. A., “Bias of a nonparametric entropy estimator for Markov measures”, Journal of Mathematical Sciences, 176:2 (2011), 255–269.</mixed-citation><mixed-citation xml:lang="en">Timofeev E. A., “Bias of a nonparametric entropy estimator for Markov measures”, Journal of Mathematical Sciences, 176:2 (2011), 255–269.</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>
