<?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">33540</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">O kombinatorike razvedeniy</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>Krisman</surname><given-names>M. V.</given-names></name><name xml:lang="ru"><surname>Крисман</surname><given-names>М. В.</given-names></name></name-alternatives><email>mchrisma@monmouth.edu</email><xref ref-type="aff" rid="aff1"/></contrib></contrib-group><aff-alternatives id="aff1"><aff><institution xml:lang="en"></institution></aff><aff><institution xml:lang="ru">Monmouth University</institution></aff></aff-alternatives><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>87</fpage><lpage>109</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, Krisman M.V.</copyright-statement><copyright-statement xml:lang="ru">Copyright ©; 2013, Крисман М.В.</copyright-statement><copyright-year>2013</copyright-year><copyright-holder xml:lang="en">Krisman M.V.</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/33540">https://journals.rudn.ru/CMFD/article/view/33540</self-uri><abstract xml:lang="ru">Многие инварианты узлов строятся по разведениям узла в его перекрестках. Для их вычисления необходимо знать, на сколько компонент связности распадается диаграмма узла после разведения. В настоящей работе демонстрируется, как исследовать этот вопрос, используя модификацию теоремы Зулли вместе с модификацией спектральной теории графов.</abstract></article-meta></front><body></body><back><ref-list><ref id="B1"><label>1.</label><mixed-citation>Brandenbursky M., Polyak M. Link invariants via counting surfaces. - Preprint, 2011.</mixed-citation></ref><ref id="B2"><label>2.</label><mixed-citation>Burde G., Zieschang H. Knots. - Berlin: Walter de Gruyter &amp; Co., 2003.</mixed-citation></ref><ref id="B3"><label>3.</label><mixed-citation>Chmutov S., Khoury M. C., Rossi A. Polyak-Viro formulas for coe cients of the Conway polynomial// arXiv: 0810.3146v1 [math.GT], 2008.</mixed-citation></ref><ref id="B4"><label>4.</label><mixed-citation>Chmutov S., Polyak M. Elementary combinatorics for the HOMFLYPT polynomial// arXiv: 0810.4105v2 [math.GT], 2009.</mixed-citation></ref><ref id="B5"><label>5.</label><mixed-citation>Chrisman M. W. Twist lattices and the Jones-Kau man polynomial for long virtual knots// J. Knot Theory Rami cations. - 2010. - 19, № 5. - С. 655-675.</mixed-citation></ref><ref id="B6"><label>6.</label><mixed-citation>Chrisman M. W. A lattice of  nite-type invariants of virtual knots. - In preparation, 2011.</mixed-citation></ref><ref id="B7"><label>7.</label><mixed-citation>Cvetkovic´ D., Rowlinson P., Simic´ S. Eigenspaces of graphs. - Cambridge: Cambridge Univ. Press, 1997.</mixed-citation></ref><ref id="B8"><label>8.</label><mixed-citation>Cvetkovic´ D., Rowlinson P., Simic´ S. An introduction to the theory of graph spectra. - Cambridge: Cambridge Univ. Press, 2010.</mixed-citation></ref><ref id="B9"><label>9.</label><mixed-citation>Ilyutko D. P., Manturov V. O. Graph-links// arXiv:1001.0384v1 [math.GT].</mixed-citation></ref><ref id="B10"><label>10.</label><mixed-citation>Ilyutko D., Nikonov I., Manturov V. O. Parity in knot theory and graph-links// J. Math. Sci. - 2013. - 193, № 6. - С. 809-965.</mixed-citation></ref><ref id="B11"><label>11.</label><mixed-citation>Kau man L. H. Virtual knot theory// Eur. J. Combin. - 1999. - 20, № 7. - С. 663-690.</mixed-citation></ref><ref id="B12"><label>12.</label><mixed-citation>Maunder C. R. F. Algebraic topology. - New York: Dover Publ. Inc., 1996. О КОМБИНАТОРИКЕ РАЗВЕДЕНИЙ 109</mixed-citation></ref><ref id="B13"><label>13.</label><mixed-citation>Mostovoy J., Chmutov S., Dushin S. CDBook: Introduction to Vassiliev knot invariants. - http://www.math.ohio-state.edu/chmutov/preprints/.</mixed-citation></ref><ref id="B14"><label>14.</label><mixed-citation>Traldi L. A bracket polynomial for graphs. II. Links, Euler circuits and marked graphs// J. Knot Theory Rami cations. - 2010. - 19, № 4. - С. 547-586.</mixed-citation></ref><ref id="B15"><label>15.</label><mixed-citation>Traldi L., Zulli L. A bracket polynomial for graphs. I// J. Knot Theory Rami cations. - 2009. - 18, № 12. - С. 1681-1709.</mixed-citation></ref><ref id="B16"><label>16.</label><mixed-citation>Zulli L. A matrix for computing the Jones polynomial of a knot// Topology. - 1995. - 34, № 3. - С. 717- 729.</mixed-citation></ref></ref-list></back></article>
