<?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-2019-20-2-140-155</article-id><article-id custom-type="elpub" pub-id-type="custom">cheb-600</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>Cones and polytopes of geleralized metrics</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>Deza</surname><given-names>Elena Ivanovna</given-names></name></name-alternatives><email xlink:type="simple">elena.deza@gmail.com</email></contrib></contrib-group><pub-date pub-type="collection"><year>2019</year></pub-date><pub-date pub-type="epub"><day>21</day><month>01</month><year>2020</year></pub-date><volume>20</volume><issue>2</issue><fpage>140</fpage><lpage>155</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Деза Е.И., 2019</copyright-statement><copyright-year>2019</copyright-year><copyright-holder xml:lang="ru">Деза Е.И.</copyright-holder><copyright-holder xml:lang="en">Deza E.I.</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/600">https://www.chebsbornik.ru/jour/article/view/600</self-uri><abstract><p>.</p></abstract><trans-abstract xml:lang="en"><p>.</p></trans-abstract></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Деза М. М., Деза Е. И., Дютур Сикирич М. Полиэдральные конструкции, связанные с квазиметриками // Чебышевский сборник. 2015. Т. 16, выпуск 2. С. 79–92.</mixed-citation><mixed-citation xml:lang="en">Deza, M. M., Deza, E. I., Dutour Sikirić, М. 2015, “Polyhedral structures associated with quasimetrics”, Chebyshevskii sbornik, Vol. 16 (2), P. 79–92.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Кудряшов Б. Д. Теория информации: Учебник для вузов. – СПб.: Петир, 2009.</mixed-citation><mixed-citation xml:lang="en">Kudryashov, B. D. 2009, “Information Theory”, StPb.: Petir.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Лидовский В. В. Теория информации: Учебное пособие. – М.: Компания Спутник, 2004.</mixed-citation><mixed-citation xml:lang="en">Lidovskii, V. V. 2004, “Information Theory”, M.: Sputnik.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Шеннон К. Математическая теория связи. – М.: ИЛ, 1963.</mixed-citation><mixed-citation xml:lang="en">Shannon, C. E. 1948, “A Mathematical Theory of Communication”, M.: IL.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Charikar M., Makarychev K., Makarychev V. Directed metrics and directed graph partitioning problem // Proc. of 11-th ACM-SIAM Symp. on Discrete Algorithms. 2006. P. 51–60.</mixed-citation><mixed-citation xml:lang="en">Charikar, M., Makarychev, K., Makarychev, V. 2006, “Directed metrics and directed graph partitioning problem”, Proc. of 11-th ACM-SIAM Symp. on Discrete Algorithms, P. 51–60.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Chebotarev P. Studying new classes of graph metrics // Proceedings of the SEE Conference “Geometric Science of Information” (GSI-2013), Lecture Notes in Computer Science, LNCS 8085. 2013. P. 207–214.</mixed-citation><mixed-citation xml:lang="en">Chebotarev, P. 2013, “Studying new classes of graph metrics”, Proceedings of the SEE Conference “Geometric Science of Information” (GSI-2013), Lecture Notes in Computer Science, LNCS 8085, P. 207–214.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Chebotarev P., Agaev R. Forest matrices around the Laplacian matrix // Linear Algebra and its Applications. 2002. No 356. P. 253–274.</mixed-citation><mixed-citation xml:lang="en">Chebotarev, P., Agaev, R. 2002, “Forest matrices around the Laplacian matrix”, Linear Algebra and its Applications, No 356, P. 253–274.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Chebotarev P., Deza E. Hitting time quasi-metric and its forest representation // Optimization Letters. 2018. URL: https://link.springer.com/article/10.1007%2Fs11590-018-1314-2.</mixed-citation><mixed-citation xml:lang="en">Chebotarev, P., Deza, E. 2018, “Hitting time quasi-metric and its forest representation”, Optimization Letters, URL: https://link.springer.com/article/10.1007%2Fs11590-018-1314-2.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Chebotarev P., Shamis Е. The forest metric for graph verticies // arXiv:060257v1. 2006.</mixed-citation><mixed-citation xml:lang="en">Chebotarev, P., Shamis, Е. 2006, “The forest metric for graph verticies”, arXiv:060257v1.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Chebotarev P., Shamis E. Matrix forest theorems // arXiv:0602575v1. 2006.</mixed-citation><mixed-citation xml:lang="en">Chebotarev, P., Shamis, E. 2006, “Matrix forest theorems”, arXiv:0602575v1.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Chebotarev P., Shamis E. On proximity measures for graph vertices // Automation and Remote Control. 1998. No 59. P. 1443–1459.</mixed-citation><mixed-citation xml:lang="en">Chebotarev, P., Shamis, E. 1998, “On proximity measures for graph vertices”, Automation and Remote Control, No 59, P. 1443–1459.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Chebotarev P., Shamis E. The matrix-forest theorem and measuring relations in small social groups // Automation and Remote Control. 1997. No 58. P. 1505–1514.</mixed-citation><mixed-citation xml:lang="en">Chebotarev, P., Shamis, E. 1997, “The matrix-forest theorem and measuring relations in small social groups”, Automation and Remote Control, No 58, P. 1505–1514.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Deza M. M., Deza E. I. Encyclopedia of Distances, 4-rd edition. – Springer-Verlag, Berlin, 2016.</mixed-citation><mixed-citation xml:lang="en">Deza, M. M., Deza, E. I. 2016, “Encyclopedia of Distances”, 4-rd edition, Springer-Verlag, Berlin.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Deza M.M., Deza E.I. Cones of partial metrics // Contrib. Discrete Math. 2011. No 6(1). P. 26–47.</mixed-citation><mixed-citation xml:lang="en">Deza, M. M., Deza, E. I. 2011, “Cones of partial metrics”, Contrib. Discrete Math., No 6(1), P. 26–47.</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Deza M. M., Deza E. I., Vidali J. Cones of weighted and partial metrics // Proceedings of the International Conference on Algebra. 2010. P. 177–197.</mixed-citation><mixed-citation xml:lang="en">Deza, M. M., Deza, E. I., Vidali, J. 2010, “Cones of weighted and partial metrics”, Proceedings of the International Conference on Algebra, P. 177–197.</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">Deza M. M., Dutour M., Deza E. I. Generalizations of finite metrics and cuts. –World Scientific, 2016.</mixed-citation><mixed-citation xml:lang="en">Deza, M. M., Dutour, M., Deza, E. I. 2016, “Generalizations of finite metrics and cuts”, World Scientific.</mixed-citation></citation-alternatives></ref><ref id="cit17"><label>17</label><citation-alternatives><mixed-citation xml:lang="ru">Deza M. M., Dutour M., Panteleeva E. I. Small cones of oriented semi-metrics // Forum for Interdisciplinary Mathematics Proceedings on Statistics, Combinatorics and Related Areas. 2002. Vol. 22. P. 199–225.</mixed-citation><mixed-citation xml:lang="en">Deza, M. M., Dutour, M., Panteleeva, E. I. 2002, “Small cones of oriented semi-metrics”, Forum for Interdisciplinary Mathematics Proceedings on Statistics, Combinatorics and Related Areas, Vol. 22, P. 199–225.</mixed-citation></citation-alternatives></ref><ref id="cit18"><label>18</label><citation-alternatives><mixed-citation xml:lang="ru">Deza M. M., Grishukhin V. P., Deza E. I. Cones of weighted quasi-metrics, weighted quasihypermetrics and of oriented cuts // Mathematics of Distances and Applications, ITEA, Sofia. 2012. P. 31–53.</mixed-citation><mixed-citation xml:lang="en">Deza, M. M., Grishukhin, V. P., Deza, E. I. 2012, “Cones of weighted quasi-metrics, weighted quasi-hypermetrics and of oriented cuts”, Mathematics of Distances and Applications, ITEA, Sofia, P. 31–53.</mixed-citation></citation-alternatives></ref><ref id="cit19"><label>19</label><citation-alternatives><mixed-citation xml:lang="ru">Deza M. M., Laurent M. Geometry of cuts and metrics. - Springer-Verlag, Berlin, 1997.</mixed-citation><mixed-citation xml:lang="en">Deza, M. M., Laurent, M. 1997, “Geometry of cuts and metrics”, Springer-Verlag, Berlin.</mixed-citation></citation-alternatives></ref><ref id="cit20"><label>20</label><citation-alternatives><mixed-citation xml:lang="ru">Deza M. M., Panteleeva E. I. Quasi-semi-metrics, oriented multi-cuts and related polyhedra // European Journal of Combinatorics. 2000. No 21(6). P. 777–795.</mixed-citation><mixed-citation xml:lang="en">Deza, M. M., Panteleeva, E. I. 2000, “Quasi-semi-metrics, oriented multi-cuts and related polyhedral”, European Journal of Combinatorics, No 21(6), P. 777–795.</mixed-citation></citation-alternatives></ref><ref id="cit21"><label>21</label><citation-alternatives><mixed-citation xml:lang="ru">Deza M. M., Rosenberg I. G. n-semimetrics // European Journal of Combinatorics, Special Issue Discrete Metric Spaces. 2000. No 21(6). P. 797–806.</mixed-citation><mixed-citation xml:lang="en">Deza, M. M., Rosenberg, I. G. 2000, “n-semimetrics”, European Journal of Combinatorics, Special Issue Discrete Metric Spaces, No 21(6), P. 797–806.</mixed-citation></citation-alternatives></ref><ref id="cit22"><label>22</label><citation-alternatives><mixed-citation xml:lang="ru">Doyle P. G., Snell J. L. Random Walks and Electric Networks. - Mathematical Association of America, Washington D.C., 1984.</mixed-citation><mixed-citation xml:lang="en">Doyle, P. G., Snell, J. L. 1984, “Random Walks and Electric Networks”, Mathematical Association of America, Washington D.C..</mixed-citation></citation-alternatives></ref><ref id="cit23"><label>23</label><citation-alternatives><mixed-citation xml:lang="ru">Fréchet M. Sur quelques points du calcul fonctionnel // Rend. Circolo mat. Palermo. 1906. Vol. 22. P. 1–74.</mixed-citation><mixed-citation xml:lang="en">Fréchet, M. 1906, “Sur quelques points du calcul fonctionnel”, Rend. Circolo mat. Palermo, Vol. 22, P. 1–74.</mixed-citation></citation-alternatives></ref><ref id="cit24"><label>24</label><citation-alternatives><mixed-citation xml:lang="ru">Gvishiani A. D., Gurvich V. A. Metric and ultrametric spaces of resistances // Russian Mathematical Surveys. 1987. No 42. P. 235–236.</mixed-citation><mixed-citation xml:lang="en">Gvishiani, A. D., Gurvich, V. A. 1987, “Metric and ultrametric spaces of resistances”, Russian Mathematical Surveys, No 42, P. 235–236.</mixed-citation></citation-alternatives></ref><ref id="cit25"><label>25</label><citation-alternatives><mixed-citation xml:lang="ru">Hausdorff F. Grundzüge der Mengenlehre. – Leipzig, 1914.</mixed-citation><mixed-citation xml:lang="en">Hausdorff, F. 1914, “Grundzüge der Mengenlehre”, Leipzig.</mixed-citation></citation-alternatives></ref><ref id="cit26"><label>26</label><citation-alternatives><mixed-citation xml:lang="ru">Klein D. J., Randic M. Resistance distance // Journal of Mathematical Chemistry. 1993. No 12. P. 81–95.</mixed-citation><mixed-citation xml:lang="en">Klein, D. J., Randic, M. 1993, “Resistance distance”, Journal of Mathematical Chemistry, No 12, P. 81–95.</mixed-citation></citation-alternatives></ref><ref id="cit27"><label>27</label><citation-alternatives><mixed-citation xml:lang="ru">Seda A.K. Quasi-metrics and the semantic of logic programs // Fundamenta Informaticaem. 1997. Vol. 29. P. 97–117.</mixed-citation><mixed-citation xml:lang="en">Seda, A. K. 1997, “Quasi-metrics and the semantic of logic programs”, Fundamenta Informaticaem, Vol. 29, P. 97–117.</mixed-citation></citation-alternatives></ref><ref id="cit28"><label>28</label><citation-alternatives><mixed-citation xml:lang="ru">Sharpe G. E. Solution of the (m + 1)-terminal resistive network problem by means of metric geometry // Proceedings of the First Asilomar Conference on Circuits and Systems, Pacific Grove, CA. 1967. P. 319–328.</mixed-citation><mixed-citation xml:lang="en">Sharpe, G. E. 1967, “Solution of the (m + 1)-terminal resistive network problem by means of metric geometry”, Proceedings of the First Asilomar Conference on Circuits and Systems, Pacific Grove, CA, P. 319–328.</mixed-citation></citation-alternatives></ref><ref id="cit29"><label>29</label><citation-alternatives><mixed-citation xml:lang="ru">Wilson W.A. On quasi-metric spaces // American J. of Math. 1931. Vol. 53. P. 575–681.</mixed-citation><mixed-citation xml:lang="en">Wilson, W. A. 1931, “On quasi-metric spaces”, American J. of Math., Vol. 53, P. 575–681.</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>
