<?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">mais</journal-id><journal-title-group><journal-title xml:lang="ru">Моделирование и анализ информационных систем</journal-title><trans-title-group xml:lang="en"><trans-title>Modeling and Analysis of Information Systems</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1818-1015</issn><issn pub-type="epub">2313-5417</issn><publisher><publisher-name>Yaroslavl State University</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.18255/1818-1015-2013-1-133-137</article-id><article-id custom-type="elpub" pub-id-type="custom">mais-225</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>Articles</subject></subj-group></article-categories><title-group><article-title>Об аппроксимируемости обобщенных свободных произведений корневыми классами групп</article-title><trans-title-group xml:lang="en"><trans-title>On the Root-Class Residuallity of Generalized Free Products</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>Tumanova</surname><given-names>E. A.</given-names></name></name-alternatives><bio xml:lang="ru"><p>аспирант кафедры алгебры и математической логики,</p><p>153025, Россия, г. Иваново, ул. Ермака, 39</p></bio><bio xml:lang="en"><p>аспирант кафедры алгебры и математической логики,</p><p>ul. Ermaka, 39, Ivanovo, 153025 Russia</p></bio><email xlink:type="simple">helenfog@bk.ru</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Ивановский государственный университет</institution><country>Россия</country></aff><aff xml:lang="en"><institution>Ivanovo State University</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2013</year></pub-date><pub-date pub-type="epub"><day>20</day><month>02</month><year>2013</year></pub-date><volume>20</volume><issue>1</issue><fpage>133</fpage><lpage>137</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Туманова Е.А., 2013</copyright-statement><copyright-year>2013</copyright-year><copyright-holder xml:lang="ru">Туманова Е.А.</copyright-holder><copyright-holder xml:lang="en">Tumanova E.A.</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.mais-journal.ru/jour/article/view/225">https://www.mais-journal.ru/jour/article/view/225</self-uri><abstract><p>Пусть K — корневой класс групп. Доказано, что свободное произведение произвольного семейства K-аппроксимируемых групп с одной объединенной подгруппой, являющейся ретрактом в каждом свободном множителе, K-аппроксимируемо. Также получено достаточное условие K-аппроксимируемости обобщенного свободного произведения двух групп, в котором объединяемая подгруппа в одном из сомножителей нормальна, а в другом является ретрактом.</p></abstract><trans-abstract xml:lang="en"><p>Let K be a root class of groups. It is proved that a free product of any family of residually K groups with one amalgamated subgroup, which is a retract in all free factors, is residually K. The sufficient condition for a generalized free product of two groups to be residually K is also obtained, provided that the amalgamated subgroup is normal in one of the free factors and is a retract in another.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>свободное произведение с одной объединенной подгруппой</kwd><kwd>корневой класс групп</kwd><kwd>аппроксимируемость корневыми классами групп</kwd><kwd>ретракт</kwd></kwd-group><kwd-group xml:lang="en"><kwd>free product with one amalgamated subgroup</kwd><kwd>root class of groups</kwd><kwd>root-class residuallity</kwd><kwd>retract</kwd></kwd-group><funding-group><funding-statement xml:lang="ru">грант ИвГУ</funding-statement></funding-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Bobrovskii P. A., Sokolov E. V. The cyclic subgroup separability of certain generalized free products of two groups // Algebra Colloquium. 2010. V. 17, № 4. P. 577 – 582.</mixed-citation><mixed-citation xml:lang="en">Bobrovskii P. A., Sokolov E. V. The cyclic subgroup separability of certain generalized free products of two groups // Algebra Colloquium. 2010. V. 17, № 4. P. 577 – 582.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Boler J., Evans B. The free product of residually finite groups amalgamated along retracts is residually finite // Proc. Amer. Math. Soc. 1973. V. 37. № 1. P. 50 – 52.</mixed-citation><mixed-citation xml:lang="en">Boler J., Evans B. The free product of residually finite groups amalgamated along retracts is residually finite // Proc. Amer. Math. Soc. 1973. V. 37. № 1. P. 50 – 52.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Grunberg K. W. Residual properties of infinite soluble groups // Proc. Lond. Math. Soc. 1957. V. 7. P. 29 – 62.</mixed-citation><mixed-citation xml:lang="en">Grunberg K. W. Residual properties of infinite soluble groups // Proc. Lond. Math. Soc. 1957. V. 7. P. 29 – 62.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Neumann B. H. An assay on free products of groups with amalgamations // Phil. Trans. Royal Soc. of London. 1954. V. 246. P. 503 – 554.</mixed-citation><mixed-citation xml:lang="en">Neumann B. H. An assay on free products of groups with amalgamations // Phil. Trans. Royal Soc. of London. 1954. V. 246. P. 503 – 554.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Азаров Д. Н., Туманова Е. А. Об аппроксимируемости обобщенных свободных произведений групп корневыми классами // Научные труды Иван. гос. ун-та. Математика. 2008. Вып. 6. С. 29 – 42. (Azarov D. N., Tumanova E. A. Ob approksimiruyemosti obobshchennykh svobodnykh proizvedeniy grupp kornevymi klassami // Nauchnyye trudy Ivan. gos. un-ta. Matematika. 2008. Vyp. 6. P. 29 – 42 [in Russian].)</mixed-citation><mixed-citation xml:lang="en">Азаров Д. Н., Туманова Е. А. Об аппроксимируемости обобщенных свободных произведений групп корневыми классами // Научные труды Иван. гос. ун-та. Математика. 2008. Вып. 6. С. 29 – 42. (Azarov D. N., Tumanova E. A. Ob approksimiruyemosti obobshchennykh svobodnykh proizvedeniy grupp kornevymi klassami // Nauchnyye trudy Ivan. gos. un-ta. Matematika. 2008. Vyp. 6. P. 29 – 42 [in Russian].)</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>
