<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE root>
<article 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" xmlns:ali="http://www.niso.org/schemas/ali/1.0/" article-type="research-article" dtd-version="1.2" xml:lang="en"><front><journal-meta><journal-id journal-id-type="publisher-id">Contemporary Mathematics. Fundamental Directions</journal-id><journal-title-group><journal-title xml:lang="en">Contemporary Mathematics. Fundamental Directions</journal-title><trans-title-group xml:lang="ru"><trans-title>Современная математика. Фундаментальные направления</trans-title></trans-title-group></journal-title-group><issn publication-format="print">2413-3639</issn><issn publication-format="electronic">2949-0618</issn><publisher><publisher-name xml:lang="en">Peoples’ Friendship University of Russia named after Patrice Lumumba (RUDN University)</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="publisher-id">33537</article-id><article-categories><subj-group subj-group-type="toc-heading" xml:lang="en"><subject>Articles</subject></subj-group><subj-group subj-group-type="toc-heading" xml:lang="ru"><subject>Статьи</subject></subj-group><subj-group subj-group-type="article-type"><subject>Research Article</subject></subj-group></article-categories><title-group><article-title xml:lang="en">Graf-zatsepleniya: nerealizuemost', orientatsiya i polinom Dzhonsa</article-title><trans-title-group xml:lang="ru"><trans-title>Граф-зацепления: нереализуемость, ориентация и полином Джонса</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author"><name-alternatives><name xml:lang="en"><surname>Il'yutko</surname><given-names>D. P.</given-names></name><name xml:lang="ru"><surname>Ильютко</surname><given-names>Д. П.</given-names></name></name-alternatives><email>ilyutko@yandex.ru</email><xref ref-type="aff" rid="aff1"/></contrib><contrib contrib-type="author"><name-alternatives><name xml:lang="en"><surname>Safina</surname><given-names>V. S.</given-names></name><name xml:lang="ru"><surname>Сафина</surname><given-names>В. С.</given-names></name></name-alternatives><email>timofeeva_vs_mgu@mail.ru</email><xref ref-type="aff" rid="aff3"/></contrib></contrib-group><aff-alternatives id="aff1"><aff><institution xml:lang="en"></institution></aff><aff><institution xml:lang="ru">МГУ имени М. В. Ломоносова</institution></aff></aff-alternatives><aff-alternatives id="aff2"><aff><institution xml:lang="ru">ЯрГУ им. П. Г. Демидова</institution></aff><aff><institution xml:lang="en"></institution></aff></aff-alternatives><aff id="aff3"><institution>МГУ имени М. В. Ломоносова</institution></aff><pub-date date-type="pub" iso-8601-date="2013-12-15" publication-format="electronic"><day>15</day><month>12</month><year>2013</year></pub-date><volume>51</volume><issue-title xml:lang="en">VOL 51, NO (2013)</issue-title><issue-title xml:lang="ru">ТОМ 51, № (2013)</issue-title><fpage>33</fpage><lpage>63</lpage><history><date date-type="received" iso-8601-date="2023-02-10"><day>10</day><month>02</month><year>2023</year></date></history><permissions><copyright-statement xml:lang="en">Copyright ©; 2013, Il'yutko D.P., Safina V.S.</copyright-statement><copyright-statement xml:lang="ru">Copyright ©; 2013, Ильютко Д.П., Сафина В.С.</copyright-statement><copyright-year>2013</copyright-year><copyright-holder xml:lang="en">Il'yutko D.P., Safina V.S.</copyright-holder><copyright-holder xml:lang="ru">Ильютко Д.П., Сафина В.С.</copyright-holder><ali:free_to_read xmlns:ali="http://www.niso.org/schemas/ali/1.0/"/><license><ali:license_ref xmlns:ali="http://www.niso.org/schemas/ali/1.0/">https://creativecommons.org/licenses/by-nc/4.0</ali:license_ref></license></permissions><self-uri xlink:href="https://journals.rudn.ru/CMFD/article/view/33537">https://journals.rudn.ru/CMFD/article/view/33537</self-uri><abstract xml:lang="ru">Данная работа посвящена граф-зацеплениям с многими компонентами и состоит из двух частей. В первой части работы мы классифицируем вершины меченого графа по их принадлежности компонентам граф-зацепления. На основе этой классификации мы строим инвариант графзацеплений. Этот инвариант показывает, что меченый второй граф Буше порождает нереализуемое граф-зацепление. Во второй части работы мы вводим понятие ориентированного граф-зацепления. Для ориентированного граф-зацепления мы определяем число закрученности и, нормируя с его помощью скобку Кауфмана, получаем инвариант ориентированных граф-зацеплений - полином Джонса.</abstract></article-meta></front><body></body><back><ref-list><ref id="B1"><label>1.</label><mixed-citation>Ильютко Д.П. Оснащенные 4-графы: эйлеровы циклы, гауссовы циклы и поворачивающие обходы// Мат. сб. - 2011. - 202, № 9. - С. 53-76.</mixed-citation></ref><ref id="B2"><label>2.</label><mixed-citation>Ильютко Д. П., Мантуров В. О. Граф-зацепления// Докл. РАН. Сер. Мат. - 2009. - 428, № 5. - С. 591-594.</mixed-citation></ref><ref id="B3"><label>3.</label><mixed-citation>Ильютко Д. П., Мантуров В. О., Никонов И. М. Четность в теории узлов и граф-зацепления// Соврем. мат. Фундам. направл. - 2011. - 41. - С. 3-163.</mixed-citation></ref><ref id="B4"><label>4.</label><mixed-citation>Мантуров В. О. Теория узлов. - Москва-Ижевск: РХД, 2005.</mixed-citation></ref><ref id="B5"><label>5.</label><mixed-citation>Мантуров В. О. Четность в теории узлов// Мат. сб. - 2010. - 201, № 5. - С. 65-110.</mixed-citation></ref><ref id="B6"><label>6.</label><mixed-citation>Прасолов В. В., Сосинский А. Б. Узлы, зацепления, косы и трехмерные многообразия. - МЦНМО, 1997.</mixed-citation></ref><ref id="B7"><label>7.</label><mixed-citation>Bar-Natan D., Garoufalidis S. On the Melvin-Morton-Rozansky conjecture// Inv. Math. - 1996. - 125. - С. 103-133.</mixed-citation></ref><ref id="B8"><label>8.</label><mixed-citation>Bouchet A. Circle graph obstructions// Comb. Theor. Ser. B J. - 1994. - 60. - С. 107-144.</mixed-citation></ref><ref id="B9"><label>9.</label><mixed-citation>Chmutov S. V., Duzhin S. V., Lando S. K. Vassiliev knot invariants. I, II, III// Adv. Sov. Math. - 1994. - 21. - С. 117-147.</mixed-citation></ref><ref id="B10"><label>10.</label><mixed-citation>Chmutov S., Duzhin S., Mostovoy J. Introduction to Vassiliev knot invariants. - Cambridge: Cambridge Univ. Press, 2012.</mixed-citation></ref><ref id="B11"><label>11.</label><mixed-citation>Cohn M., Lempel A. Cycle decomposition by disjoint transpositions// J. Combin. Theory Ser. A. - 1972. - 13. - С. 83-89.</mixed-citation></ref><ref id="B12"><label>12.</label><mixed-citation>Goussarov M., Polyak M., Viro O. Finite type invariants of classical and virtual knots// Topology. - 2000. - 39. - С. 1045-1068.</mixed-citation></ref><ref id="B13"><label>13.</label><mixed-citation>Ilyutko D. P. An equivalence between the set of graph-knots and the set of homotopy classes of looped graphs// J. Knot Theory Rami cations. - 2012. - 21, № 1. - DOI: 10.1142/S0218216512500010.</mixed-citation></ref><ref id="B14"><label>14.</label><mixed-citation>Ilyutko D. P., Manturov V. O. Introduction to graph-link theory// J. Knot Theory Rami cations. - 2009. - 18, № 6. - С. 791-823.</mixed-citation></ref><ref id="B15"><label>15.</label><mixed-citation>Ilyutko D. P., Manturov V. O. Graph-links// In: Introductory Lectures on Knot Theory, Selected Lectures Presented at the Advanced School and Conference on Knot Theory and its Applications to Physics and Biology, Series of Knots and Everything. - World Scienti c, 2012. - 46. - С. 135-161.</mixed-citation></ref><ref id="B16"><label>16.</label><mixed-citation>Kamada N., Kamada S. Abstract link diagrams and virtual knots// J. Knot Theory Rami cations. - 2000. - 9, № 1. - С. 93-109.</mixed-citation></ref><ref id="B17"><label>17.</label><mixed-citation>Kau man L. H. Virtual knots// Talks at MSRI Meeting, January 1997 and AMS meeting at University of Maryland, College Park, March 1997.</mixed-citation></ref><ref id="B18"><label>18.</label><mixed-citation>Kau man L. H. Virtual knot theory// Eur. J. Combin. - 1999. - 20, № 7. - С. 663-690.</mixed-citation></ref><ref id="B19"><label>19.</label><mixed-citation>Manturov V. O. Knot theory. - Boca Raton: CRC-Press, 2004.</mixed-citation></ref><ref id="B20"><label>20.</label><mixed-citation>Manturov V. O. On free knots// arXiv:math.GT/0901.2214.</mixed-citation></ref><ref id="B21"><label>21.</label><mixed-citation>Manturov V. O. On free knots and links// arXiv:math.GT/0902.0127.</mixed-citation></ref><ref id="B22"><label>22.</label><mixed-citation>Manturov V. O., Ilyutko D. P. Virtual knots: the state of the art. - Singapore: World Scienti c, 2012.</mixed-citation></ref><ref id="B23"><label>23.</label><mixed-citation>Moran G. Chords in a circle and linear algebra over GF (2)// J. Combin. Theory Ser. A. - 1984. - 37.- С. 239-247.</mixed-citation></ref><ref id="B24"><label>24.</label><mixed-citation>Read R. C., Rosenstiehl P. On the Gauss crossing problem// Colloq. Math. Soc. Janos Bolyai.- NorthHolland, Amsterdam-New-York, 1976. - С. 843-876.</mixed-citation></ref><ref id="B25"><label>25.</label><mixed-citation>Reidemeister K. Knotentheorie. - Berlin: Springer, 1932.</mixed-citation></ref><ref id="B26"><label>26.</label><mixed-citation>Soboleva E. Vassiliev knot invariants coming from Lie algebras and 4-invariants// J. Knot Theory Rami cations. - 2001. - 10, № 1. - С. 161-169.</mixed-citation></ref><ref id="B27"><label>27.</label><mixed-citation>Traldi L. A bracket polynomial for graphs. II. Links, Euler circuits and marked graphs// J. Knot Theory Rami cations. - 2010. - 19. - С. 547-586.</mixed-citation></ref><ref id="B28"><label>28.</label><mixed-citation>Traldi L. A bracket polynomial for graphs. III. Vertex weights// arXiv:math.GT, math.CO/0905.4879.</mixed-citation></ref><ref id="B29"><label>29.</label><mixed-citation>Traldi L. Binary nullity, Euler circuits and interlace polynomials// arXiv:math.CO/0903.4405.</mixed-citation></ref><ref id="B30"><label>30.</label><mixed-citation>Traldi L., Zulli L. A bracket polynomial for graphs// J. Knot Theory Rami cations. - 2009. - 18.- С. 1681-1709.</mixed-citation></ref></ref-list></back></article>
