<?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-2015-16-2-155-185</article-id><article-id custom-type="elpub" pub-id-type="custom">cheb-202</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>BASES OF RECURRENT SEQUENCES</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>Malyshev</surname><given-names>F. M.</given-names></name></name-alternatives><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff xml:lang="ru" id="aff-1"><institution>Математический институт им. В. А. Стеклова РАН.</institution><country>Russian Federation</country></aff><pub-date pub-type="collection"><year>2015</year></pub-date><pub-date pub-type="epub"><day>06</day><month>07</month><year>2016</year></pub-date><volume>16</volume><issue>2</issue><fpage>155</fpage><lpage>185</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">Malyshev F.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/202">https://www.chebsbornik.ru/jour/article/view/202</self-uri><abstract><p>В работе приводится обзор результатов (с разной степенью подробности) по трём различным направлениям. Основное центральное направление относится к рекуррентным после­ довательностям, прежде всего к их базисным (в различном понимании) множествам. Другое направление связано с новыми комбинаторными объектами – (v, k1, k2)-конфигурациями, возникающими на пути ослабления условий, определяющих известные комбинаторные объекты – (v, k, λ)-конфигура­ ции. Третье направление имеет дело с инвариантными дифференциалами высших порядков от нескольких гладких функций одной вещественной переменной. В каждой из этих тем рассматриваемые вопросы связаны с комби­ наторными конфигурациями в виде конечных плоскостей, а приводимые результаты получены благодаря однотипным представлениям точек соот­ ветствующих конфигураций точками многомерных локально евклидовых пространств. В случае инвариантных дифференциалов эти представления возникают естественно, а в случае рекуррентных последовательностей и (v, k1, k2)-конфигураций вводятся по аналогии, но уже искусственным образом.</p><p> </p></abstract><trans-abstract xml:lang="en"><p>This paper provides an overview of the results (with varying degrees of detail) in three different directions. The main Central direction refers to recurrent sequences, primarily to their base (in a different sense) sets. Another direction is related to new combinatorial objects (v, k1, k2)-confi­ gurations encountered on the way of weakening the determinants of well-known combinatorial objects (v, k, λ)-configuration. The third direction deals with invariant differentials of higher orders from several smooth functions of one real variable. In each of these themes the issues associated with combinatorial configurations in the form of finite planes, and the results obtained through the same type of views, points of the corresponding configurations of points in multidimensional locally Euclidean spaces. In the case of invariant differentials of these representations arise naturally, and in the case of recurrent sequences and (v, k1, k2)-configurations are introduced by analogy, but in an artificial way.</p><p> </p></trans-abstract><kwd-group xml:lang="ru"><kwd>рекуррентные последовательности</kwd><kwd>решётки</kwd><kwd>торы</kwd><kwd>комбинаторные конфигурации</kwd><kwd>инвариантные дифференциальные операторы</kwd></kwd-group><kwd-group xml:lang="en"><kwd>recurrent sequences</kwd><kwd>lattices</kwd><kwd>Torah</kwd><kwd>combinatorial configuration</kwd><kwd>invariant differential operators</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">Кострикин А. И, Манин Ю. И. Линейная алгебра и геометрия. М.: Наука, 1986. 304 c.</mixed-citation><mixed-citation xml:lang="en">Kostrikin, A. I. &amp; Manin, Yu. I. 1986, "Lineinaya algebra i geometriya" (Russian) [Linear algebra and geometry] Second edition. “Nauka”, Moscow, 304 pp.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Кон П. Универсальная алгебра. М.: Мир, 1968. 352 с.</mixed-citation><mixed-citation xml:lang="en">Kon, P. 1968, "Universal’naya algebra" (Russian) [Universal algebra] Translated from the English by T. M. Baranovic. Edited by A. G. Kurosh “MIR”, Moscow 351 pp.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Veblen O. Differential invariants and geometry. //Atti del Congr., Int. Mat., Bologna. 1928.</mixed-citation><mixed-citation xml:lang="en">Veblen, O. 1928, "Differential invariants and geometry" , Atti del Congr., Int. Mat., Bologna.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Кириллов А.А. Инвариантные операторы над геометрическими величинами. //Итоги науки и техники. Современные проблемы математики. Т. 16. М. 1980. С. 3 – 29.</mixed-citation><mixed-citation xml:lang="en">Kirillov, A. A. 1980, "Invariant operators over geometric quantities" (Russian) Current problems in mathematics, Vol. 16 (Russian), Akad. Nauk SSSR, Vsesoyuz. Inst. Nauchn. i Tekhn. Informatsii, Moscow, pp. 3–29, 228.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Малышев Ф.М. Симплициальные системы линейных уравнений. //Алгебра: Сб. ст-й. Изд-во МГУ им. М.В. Ломоносова. 1980. C. 53–56.</mixed-citation><mixed-citation xml:lang="en">Malyshev, F. M. 1980, "Simpletsialnye system of linear equations" , Algebra, Moscow, Moscow University Press, pp. 53–56.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Картеси Ф. Введение в конечные геометрии. М.: Наука, 1980. 320 с.</mixed-citation><mixed-citation xml:lang="en">Kartesi, F. 1980, "Vvedenie v konechnye geometrii" (Russian) [Introduction to finite geometries] Translated from the English by F. L. Varpahovskii and A. S. Solodovnikov., “Nauka”, Moscow, 320 pp.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Малышев Ф.М. Порождающие наборы элементов рекуррентных последовательностей. //Труды по дискретной математике. 2008. Т. 11, № 2. С. 86 – 111.</mixed-citation><mixed-citation xml:lang="en">Malyshev, F. M. 2008, "Generating sets of elements of recurrent sequences" , Tr. discr. Mat., Fizmatlit, Moscow, vol. 11, № 2, pp. 86 – 111.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Малышев Ф.М. Базисные множества целых чисел относительно многоместных операций сдвига. //Математические вопросы криптографии. 2011. Т. 2, № 1. С. 29 – 74.</mixed-citation><mixed-citation xml:lang="en">Malyshev, F. M. 2011, "Bases of the set of integers with respect to multi-shift operations" , Mat. Issues. kriptogr., vol. 2, no. 1, pp. 29–73.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Малышев Ф.М. Метрические свойства вложений множества целых чисел в цилиндр. //Математические вопросы криптографии. 2012. Т. 3, № 3. С. 57 – 79.</mixed-citation><mixed-citation xml:lang="en">Malyshev, F. M. 2012, "Metric properties of the nested set of integers into a cylinder" , Mat. Issues. kriptogr., vol. 3, no. 3, pp. 57–79.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Делоне Б.Н., Сандакова Н.Н. Теория стероэдров. //Труды Математического института им. В.А. Стеклова. 1961. Т. 64. С. 28 – 51.</mixed-citation><mixed-citation xml:lang="en">Delone, B. N. &amp; Sandakova, N. N. 1961, "Theory of stereohedra" (Russian) Trudy Mat. Inst. Steklov., vol. 64, pp. 28—51.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Wolfram S. Cellular Automaton Supercomputing. // In High-Speed Computing. University of Illinois Press. 1988. P. 40–48.</mixed-citation><mixed-citation xml:lang="en">Wolfram, S. 1988, "Cellular Automaton Supercomputing" , In High-Speed Computing. University of Illinois Press., pp. 40–48.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Малышев Ф.М., Кутырёва Е.В. О распределении числа единиц в булевом треугольнике Паскаля. //Дискретная математика. 2006. Т.18, № 2. С. 123 – 131.</mixed-citation><mixed-citation xml:lang="en">Malyshev, F. M. &amp; Kutyreva, E. V. 2006, "On the distribution of the number of ones in a Boolean Pascal’s triangle" (Russian) Diskret. Mat., vol. 18, no. 2, pp. 123–131; translation in Discrete Math. Appl., vol. 16 (2006), no. 3, pp. 271—279.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Малышев Ф.М., Тараканов В.Е. О (v, k)-конфигурациях. //Математический сбор¬ ник. 2001. Т. 192, № 9. С. 85 – 108.</mixed-citation><mixed-citation xml:lang="en">Malyshev, F. M. &amp; Tarakanov, V. E. 2001, "On (v,k)-configurations" (Russian) Mat. Sb., vol. 192, no. 9, pp. 85–108; translation in Sb. Math., vol. 192 (2001), no. 9–10, pp. 1341—1364.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Холл М. Комбинаторика. //М.: Мир, 1970. 424 c.</mixed-citation><mixed-citation xml:lang="en">Holl, M. 1970, "Kombinatorika" (Russian) [Combinatorial theory] Translated from the English by S. A. Shirokova. Edited by A. O. Gel’fond and V. E. Tarakanov, “MIR”, Moscow, 424 pp.</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Харари Ф. Теория графов. //М.: Мир, 1973. 302 c.</mixed-citation><mixed-citation xml:lang="en">Harary, F. 1973, "Teoriya grafov" (Russian) [Graph theory] Translated from the English by V. P. Kozyrev. Edited by G. P. Gavrilov., “MIR”, Moscow, 300 pp.</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">Камерон П., ван Линт Дж. Теория графов, теория кодирования и блок-схемы. //М.: Наука, 1980. 144 c.</mixed-citation><mixed-citation xml:lang="en">Cameron, Peter J. &amp; van Lint, Jacobus Hendricus 1980, "Teoriya grafov, teoriya kodirovaniya i blok-skhemy" (Russian) [Graph theory, coding theory and block designs] Translated from the English by B. S. Steckin. “Nauka”, Moscow, 140 pp.</mixed-citation></citation-alternatives></ref><ref id="cit17"><label>17</label><citation-alternatives><mixed-citation xml:lang="ru">Сачков В.Н. Комбинаторные методы дискретной математики. //М.: Наука, 1977. 320 c.</mixed-citation><mixed-citation xml:lang="en">Sachkov, V. N. 1977, "Kombinatornye metody diskretnoi matematiki" (Russian) [Combinatorial methods of discrete mathematics], “Nauka”, Moscow, 320 pp.</mixed-citation></citation-alternatives></ref><ref id="cit18"><label>18</label><citation-alternatives><mixed-citation xml:lang="ru">Тараканов В.Е. Комбинаторные задачи и (0, 1)-матрицы. //М.: Наука, 1985. 192 c.</mixed-citation><mixed-citation xml:lang="en">Tarakanov, V. E. 1985, "Kombinatornye zadachi i (0,1)-matritsy" (Russian) [Combinatorial problems and (0,1)-matrices], Problemy Nauki i Tekhnicheskogo Progressa. [Problems of Science and Technological Progress], “Nauka”, Moscow, 192 pp.</mixed-citation></citation-alternatives></ref><ref id="cit19"><label>19</label><citation-alternatives><mixed-citation xml:lang="ru">Малышев Ф.М., Фролов А.А. Классификация (v, 3)-конфигураций. //Математические заметки. 2012. Т. 91, № 5. С. 741 – 749.</mixed-citation><mixed-citation xml:lang="en">Malyshev, F. M. &amp; Frolov, A. A. 2012, "Classification of (v,3)-configurations" , Translation of Mat. Zametki, vol. 91, no. 5, pp. 741—749. Math. Notes, vol. 91 (2012), no. 5-6, pp. 689—696.</mixed-citation></citation-alternatives></ref><ref id="cit20"><label>20</label><citation-alternatives><mixed-citation xml:lang="ru">Тришин А.Е. Классификация циркулянтных (v, 5)-матриц. //Обозрение прикладной и промышленной математики. 2004. Т. 11, № 2. С. 258 – 259.</mixed-citation><mixed-citation xml:lang="en">Trishin, A. E. 2004, "Classification circulant (v, 5)-matrices" , Review of Applied and Industrial Mathematics, vol. 11, № 2. pp. 258 – 259.</mixed-citation></citation-alternatives></ref><ref id="cit21"><label>21</label><citation-alternatives><mixed-citation xml:lang="ru">Фролов А.А. Классификация неразложимых абелевых (v, 5)-групп. //Дискретная математика. 2008. Т. 20, № 1. С. 94 – 108.</mixed-citation><mixed-citation xml:lang="en">Frolov, A. A. 2008, "Classification of indecomposable abelian (v,5)-groups" (Russian) Diskret. Mat., vol. 20, no. 1, pp. 94–108; translation in Discrete Math. Appl., vol. 18, no. 1, pp. 99—114.</mixed-citation></citation-alternatives></ref><ref id="cit22"><label>22</label><citation-alternatives><mixed-citation xml:lang="ru">Брославский М.В. Примеры (v, k1, k2)-конфигураций. //Дипломная работа. М.: в/ч 33965, 2010.</mixed-citation><mixed-citation xml:lang="en">Broslavsky, M. V. 2010, "Examples of (v, k1, k2)-configurations" Thesis. Moscow, v/ch 33965 (Russian).</mixed-citation></citation-alternatives></ref><ref id="cit23"><label>23</label><citation-alternatives><mixed-citation xml:lang="ru">Никулин В.В., Шафаревич И.Р. Геометрии и группы. //М.: Наука, 1973. 240 c.</mixed-citation><mixed-citation xml:lang="en">Nikulin, V. V. &amp; Shafarevich, I. R. 1983, "Geometrii i gruppy" (Russian) [Geometries and groups], “Nauka”, Moscow, 240 pp.</mixed-citation></citation-alternatives></ref><ref id="cit24"><label>24</label><citation-alternatives><mixed-citation xml:lang="ru">Рышков С.С., Барановский Е.П. Классические методы теории решётчатых упаковок. //Успехи математических наук. 1979. Т. 34, № 4(202). С. 3 – 63.</mixed-citation><mixed-citation xml:lang="en">Ryshkov, S. S. &amp; Baranovskii, E. P. 1979, "Classical methods of the theory of lattice packings" (Russian) Uspekhi Mat. Nauk, vol. 34, no. 4(208), pp. 3-–63, 256.</mixed-citation></citation-alternatives></ref><ref id="cit25"><label>25</label><citation-alternatives><mixed-citation xml:lang="ru">Kuzmin A.S., Kurakin V.L., Mikhalev A.V., Nechaev A.A. Linear recurreces over rings and modules. //J. Math. Science (Contemporary Math. and Its Appl. Thematic surveys). V. 76, № 6. P. 2793 – 2915.</mixed-citation><mixed-citation xml:lang="en">Kurakin, V. L., Kuzmin, A. S., Mikhalev, A. V. &amp; Nechaev, A. A. 1995, "Linear recurring sequences over rings and modules" , Algebra, 2. J. Math. Sci., vol. 76, №. 6, pp. 2793 – 2915.</mixed-citation></citation-alternatives></ref><ref id="cit26"><label>26</label><citation-alternatives><mixed-citation xml:lang="ru">Кузьмин А.С., Куракин В.Л., Нечаев А.А. Псевдослучайные и полилинейные по¬ следовательности. //Труды по дискретной математике. 1997. Т. 1, С. 139 – 202.</mixed-citation><mixed-citation xml:lang="en">Kuzmin, A. S.; Kurakin, V. L.; Nechaev, A. A. 1997, "Pseudorandom and polylinear sequences" (Russian) Proceedings in discrete mathematics, Tr. Diskretn. Mat., Nauchn. Izd. TVP, Moscow, vol. 1, pp. 139—202.</mixed-citation></citation-alternatives></ref><ref id="cit27"><label>27</label><citation-alternatives><mixed-citation xml:lang="ru">National Institute of Standards and Technology, U.S.A., Advanced Encryption Standard (AES) FIPS – 197, 2001.</mixed-citation><mixed-citation xml:lang="en">National Institute of Standards and Technology, U.S.A., Advanced Encryption Standard (AES) FIPS – 197, 2001.</mixed-citation></citation-alternatives></ref><ref id="cit28"><label>28</label><citation-alternatives><mixed-citation xml:lang="ru">Specification of ARIA. National Security Research Institute (NSRI). January, 2005. http://www.nsri.re.kr/ARIA/index-e.html.</mixed-citation><mixed-citation xml:lang="en">Specification of ARIA. National Security Research Institute (NSRI). January, 2005. http://www.nsri.re.kr/ARIA/index-e.html.</mixed-citation></citation-alternatives></ref><ref id="cit29"><label>29</label><citation-alternatives><mixed-citation xml:lang="ru">SEED Algorithm Specification. Korea Information Security Agency. 2005. https:// tools.ietf.org/draft-park-seed-01. 30. Lu J., Ji W., Hu L., Ding J., Pyshkin A., Weinmann R. Analysis of the SMS4 Block Cipher. Procedings of ACISP’07. LNCS 4586, 2007. P. 306 – 318.</mixed-citation><mixed-citation xml:lang="en">SEED Algorithm Specification. Korea Information Security Agency. 2005. https:// tools.ietf.org/draft-park-seed-01.</mixed-citation></citation-alternatives></ref><ref id="cit30"><label>30</label><citation-alternatives><mixed-citation xml:lang="ru">Винберг Э.Б., Шварцман О.В. Дискретные группы движений пространств постоянной кривизны. //Итоги науки и техники. Современные проблемы математики. Фундаментальные направления. Т. 29. М. 1988. С. 147 – 259.</mixed-citation><mixed-citation xml:lang="en">Lu J., Ji W., Hu L., Ding J., Pyshkin A., Weinmann R. Analysis of the SMS4 Block Cipher. Procedings of ACISP’07. LNCS 4586, 2007. P. 306 – 318.</mixed-citation></citation-alternatives></ref><ref id="cit31"><label>31</label><citation-alternatives><mixed-citation xml:lang="ru">Малышев Ф.М. О замкнутых подмножествах корней и когомологиях регулярных подалгебр. //Математический сборник. 1977. Т. 104(146), № 1(9). С. 140 – 150.</mixed-citation><mixed-citation xml:lang="en">Vinberg, E. B. &amp; Shvartsman, O. V. 1988, "Discrete groups of motions of spaces of constant curvature" (Russian), Current problems in mathematics. Fundamental directions, Itogi Nauki i Tekhniki, Akad. Nauk SSSR, Vsesoyuz. Inst. Nauchn. i Tekhn. Inform., Moscow, vol. 29, pp. 147 – 259.</mixed-citation></citation-alternatives></ref><ref id="cit32"><label>32</label><citation-alternatives><mixed-citation xml:lang="ru">Бурбаки Н. Группы и алгебры Ли. М.: Мир, 1972. 336 с.</mixed-citation><mixed-citation xml:lang="en">Malyshev, F. M. 1977, "Closed subsets of roots and the cohomology of regular subalgebras" (Russian), Mat. Sb. (N.S.), vol. 104(146), no. 1, pp. 140—150, 176.</mixed-citation></citation-alternatives></ref><ref id="cit33"><label>33</label><citation-alternatives><mixed-citation xml:lang="ru">Morgado I. Note on quasi-orders, partial orders and orders. //Notes comuus mat. 1972. № 43. P. 31 – 40.</mixed-citation><mixed-citation xml:lang="en">Burbaki, N. 1972, "Gruppy i algebry Li. Gruppy Kokstera i sistemy Titsa. Gruppy, porozhdennye otrazheniyami. Sistemy kornei." (Russian) [Lie groups and algebras. Coxeter groups and Tits systems. Groups generated by reflections. Root systems] Translated from the French by A. I. Kostrikin and A. N. Tjurin. Edited by A. I. Kostrikin. “MIR”, Moscow, 334 pp.</mixed-citation></citation-alternatives></ref><ref id="cit34"><label>34</label><citation-alternatives><mixed-citation xml:lang="ru">Krishnamurthy. On the number of topologies on a finite set. //Amer. Math. Monthly. 1966. V. 73. P. 154 – 157.</mixed-citation><mixed-citation xml:lang="en">Morgado, I. 1972, "Note on quasi-orders, partial orders and orders" , Notes comuus mat., № 43, pp. 31 – 40.</mixed-citation></citation-alternatives></ref><ref id="cit35"><label>35</label><citation-alternatives><mixed-citation xml:lang="ru">Толпыго А.К. О когомологиях параболических алгебр Ли. //Математические за¬ метки. 1972. Т. 12, № 3. С. 251 – 255.</mixed-citation><mixed-citation xml:lang="en">Krishnamurthy, V. 1966, "On the number of topologies on a finite set" , Amer. Math. Monthly., vol. 73. pp. 154 – 157.</mixed-citation></citation-alternatives></ref><ref id="cit36"><label>36</label><citation-alternatives><mixed-citation xml:lang="ru">Лидл Р., Нидеррайтер Г. Конечные поля: В 2-х томах. М.: Мир, 1988. 822 с.</mixed-citation><mixed-citation xml:lang="en">Tolpygo, A. K. 1972, "The cohomology of parabolic Lie algebras" (Russian) Mat. Zametki, vol. 12, № 3, pp. 251–255.</mixed-citation></citation-alternatives></ref><ref id="cit37"><label>37</label><citation-alternatives><mixed-citation xml:lang="ru">Лупанов О.Б. Введение в математическую логику. Конспект лекций. //М.: Мех – мат МГУ им. М.В. Ломоносова. 2007. 199 с.</mixed-citation><mixed-citation xml:lang="en">Lidl, R. &amp; Niderraiter, G. 1988, "Konechnye polya. Tom 1" (Russian) [Finite fields. Vol. 1] Translated from the English by A. E. Zhukov and V. I. Petrov. Translation edited and with a preface by V. I. Nechaev. “MIR”, Moscow, 430 pp.; Lidl, R. &amp; Niderraiter, G. 1988, "Konechnye polya. Tom 2" (Russian) [Finite fields. Vol. 2] Translated from the English by A. E. Zhukov and V. I. Petrov. Translation edited by V. I. Nechaev. “MIR”, Moscow, pp. 433—822.</mixed-citation></citation-alternatives></ref><ref id="cit38"><label>38</label><citation-alternatives><mixed-citation xml:lang="ru">Воробьёв Н.Н. Числа Фибоначчи. М.: Наука, 1978. 144 с.</mixed-citation><mixed-citation xml:lang="en">Lupanov, O. B. 2007, "Introduction to mathematical logic. Lecture notes." , Moscow, Mekh – mat. MGU M. V. Lomonosov, 199 p.</mixed-citation></citation-alternatives></ref><ref id="cit39"><label>39</label><citation-alternatives><mixed-citation xml:lang="ru">Vorob’ev, N. N. 1978, "Chisla Fibonachchi" (Russian) [Fibonacci numbers] Fourth edition. Populyarnye Lektsii po Matematike [Popular Lectures on Mathematics], 6. “Nauka”, Moscow, 142 pp.</mixed-citation><mixed-citation xml:lang="en">Vorob’ev, N. N. 1978, "Chisla Fibonachchi" (Russian) [Fibonacci numbers] Fourth edition. Populyarnye Lektsii po Matematike [Popular Lectures on Mathematics], 6. “Nauka”, Moscow, 142 pp.</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>
