<?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-2020-21-2-290-300</article-id><article-id custom-type="elpub" pub-id-type="custom">cheb-770</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>Распознавание и табулирование 3-многообразий до сложности 13</article-title><trans-title-group xml:lang="en"><trans-title>Recognition and tabulation of 3-manifolds up to complexity 13</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>Matveev</surname><given-names>Sergei Vladimirovich</given-names></name></name-alternatives><bio xml:lang="ru"><p>академик РАН, доктор физико-математических наук, профессор</p></bio><bio xml:lang="en"><p>cademician of RAS, Doctor of Physics and Mathematics,Professor</p></bio><email xlink:type="simple">matveev@csu.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><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>Tarkaev</surname><given-names>Vladimir Viktorovich</given-names></name></name-alternatives><bio xml:lang="ru"><p>кандидат физико-математических наук, научный сотрудник</p></bio><bio xml:lang="en"><p>Candidate of Physics and Mathematics, researcher</p></bio><email xlink:type="simple">trk@csu.ru</email><xref ref-type="aff" rid="aff-2"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Челябинский государственный университет, Томский государственный университет</institution><country>Россия</country></aff><aff xml:lang="en"><institution>Chelyabinsk State University; National Research Tomsk State University</institution><country>Russian Federation</country></aff></aff-alternatives><aff-alternatives id="aff-2"><aff xml:lang="ru"><institution>Челябинский государственный университет, Институт математики и механики УрО РАН</institution><country>Россия</country></aff><aff xml:lang="en"><institution>Chelyabinsk State University; Institute of Mathematics and Mechanics, Ural Branch of the&#13;
Russian Academy of Sciences</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2020</year></pub-date><pub-date pub-type="epub"><day>08</day><month>04</month><year>2020</year></pub-date><volume>21</volume><issue>2</issue><fpage>290</fpage><lpage>300</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Матвеев С.В., Таркаев В.В., 2020</copyright-statement><copyright-year>2020</copyright-year><copyright-holder xml:lang="ru">Матвеев С.В., Таркаев В.В.</copyright-holder><copyright-holder xml:lang="en">Matveev S.V., Tarkaev V.V.</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/770">https://www.chebsbornik.ru/jour/article/view/770</self-uri><abstract><p>В работе кратко описывается полная таблица ориентируемых замкнутых неприводи-мых 3-многообразий сложности &lt;=13, методы ее построения и проверки, кроме того, фор-мулируется ряд гипотез касающихся роста числа многообразий различных типов. В при-ложении дается сжатое объяснение использованных понятий.</p></abstract><trans-abstract xml:lang="en"><p>We describe in breaf the complete table of closed irreducible orientable 3-manifolds ofcomplexity &lt;=13, and method of its creation and verification. Also we formulate a conjecturesconcerning the growth of the number of some kinds of manifolds. The appendix contains a shortexplanation of used terminology.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>трехмерное многобразие</kwd><kwd>сложность многообразия</kwd><kwd>специальные спайны</kwd><kwd>табулирование трехмерных многообразий</kwd></kwd-group><kwd-group xml:lang="en"><kwd>three-dimensional manifolds</kwd><kwd>complexity of manifold</kwd><kwd>special spines</kwd><kwd>tabulation of three-dimensional manifolds.</kwd></kwd-group><funding-group><funding-statement xml:lang="ru">Части 1 и 2 данной работы поддержаны грантом Российского научного фонда (проект №19-41-02005).Части 3 и 4 данной работы поддержаны грантом РФФИ (проект 19-01-00741).</funding-statement></funding-group></article-meta></front><back><ref-list><title>References</title></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>
