<?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 custom-type="elpub" pub-id-type="custom">mais-1082</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>О тензорных квадратах неприводимых
представлений конечных почти простых групп. I.</article-title><trans-title-group xml:lang="en"><trans-title>On tensor squares of irreducible representations
of almost simple groups. I</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>Polyakov</surname><given-names>S. V.</given-names></name></name-alternatives><email xlink:type="simple">SVPuniyar@yandex.ru</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff xml:lang="ru" id="aff-1"><institution>Ярославский государственный университет им. П.Г. Демидова</institution><country>Russian Federation</country></aff><pub-date pub-type="collection"><year>2011</year></pub-date><pub-date pub-type="epub"><day>20</day><month>03</month><year>2011</year></pub-date><volume>18</volume><issue>1</issue><fpage>130</fpage><lpage>141</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Поляков С.В., 2011</copyright-statement><copyright-year>2011</copyright-year><copyright-holder xml:lang="ru">Поляков С.В.</copyright-holder><copyright-holder xml:lang="en">Polyakov S.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.mais-journal.ru/jour/article/view/1082">https://www.mais-journal.ru/jour/article/view/1082</self-uri><abstract><p>Рассматриваются конечные почти простые SM_m-группы (см. определение
ниже). В первой части работы получены результаты о строении простых SM_2-
групп. Оказалось, что каждая из таких групп изоморфна группе L_2(q), где q = 2^t, а t&gt; 1.</p></abstract><trans-abstract xml:lang="en"><p>Almost simple SM_m-groups are considered. A group G is called a SM_m-group if
the tensor square of any irreducible representation is decomposed into the sum of its
irreducible representations with multiplicities not greater than m. In the first part of
this article we consider simple groups. It turned out that among them only groups L_2(q), q = 2^t, t &gt; 1, are SM_2-groups.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>SR-группа</kwd><kwd>SM_m-группа</kwd><kwd>почти простые группы</kwd><kwd>автоморфизмы простых групп</kwd><kwd>GAP</kwd></kwd-group><kwd-group xml:lang="en"><kwd>SR-groups</kwd><kwd>SM_m-groups</kwd><kwd>almost simple groups</kwd><kwd>automorphisms</kwd><kwd>GAP</kwd></kwd-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Wigner E.P. On representations of finite groups // Amer. J. Math. 1941. Vol. 63. P. 57-63.</mixed-citation><mixed-citation xml:lang="en">Wigner E.P. On representations of finite groups // Amer. J. Math. 1941. Vol. 63. P. 57-63.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Gorenstein D. Finite groups. N.Y.: Harper and Row, 1968.</mixed-citation><mixed-citation xml:lang="en">Gorenstein D. Finite groups. N.Y.: Harper and Row, 1968.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Carter R.W. Finite groups of Lie type. Conjugacy classes and complex characters. Willey, 1985.</mixed-citation><mixed-citation xml:lang="en">Carter R.W. Finite groups of Lie type. Conjugacy classes and complex characters. Willey, 1985.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Gallagher P.X. The number of conjugacy classes in a finite group // Math. Z. 1970. Vol. 118. P. 175-179.</mixed-citation><mixed-citation xml:lang="en">Gallagher P.X. The number of conjugacy classes in a finite group // Math. Z. 1970. Vol. 118. P. 175-179.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Conway J.H., Curtis R.T., Norton S.P., Parker R.A., Wilson R.A. Atlas of Finite Groups. Oxford: Clarendon Press, 1985. http://brauer.maths.qmul.ac.uk/Atlas/v3/</mixed-citation><mixed-citation xml:lang="en">Conway J.H., Curtis R.T., Norton S.P., Parker R.A., Wilson R.A. Atlas of Finite Groups. Oxford: Clarendon Press, 1985. http://brauer.maths.qmul.ac.uk/Atlas/v3/</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Macdonald I.G. Numbers of conjugacy classes in some finite classical groups // Bull. Austral. Math. Soc. 1981. Vol. 23, №1. P. 23-48.</mixed-citation><mixed-citation xml:lang="en">Macdonald I.G. Numbers of conjugacy classes in some finite classical groups // Bull. Austral. Math. Soc. 1981. Vol. 23, №1. P. 23-48.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Liebeck M., Pyber L. Upper bounds for the number of conjugacy classes of a finite group // J. Algebra, 1997. №198. P. 538-562.</mixed-citation><mixed-citation xml:lang="en">Liebeck M., Pyber L. Upper bounds for the number of conjugacy classes of a finite group // J. Algebra, 1997. №198. P. 538-562.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Maroti A. Bounding the number of conjugacy classes of a permutation group // Journal of Group Theory. 2005. 8, №3. P. 273-289.</mixed-citation><mixed-citation xml:lang="en">Maroti A. Bounding the number of conjugacy classes of a permutation group // Journal of Group Theory. 2005. 8, №3. P. 273-289.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Кострикин А.И. Введение в алгебру, часть 3. Основные структуры алгебры. М.: Физ.-мат. лит., 2000.</mixed-citation><mixed-citation xml:lang="en">Кострикин А.И. Введение в алгебру, часть 3. Основные структуры алгебры. М.: Физ.-мат. лит., 2000.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Коуровская тетрадь. Нерешенные вопросы теории групп. Издание 16-е, дополненное, включающее Архив решенных задач. Новосибирск: ИМ СО РАН, 2006.</mixed-citation><mixed-citation xml:lang="en">Коуровская тетрадь. Нерешенные вопросы теории групп. Издание 16-е, дополненное, включающее Архив решенных задач. Новосибирск: ИМ СО РАН, 2006.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Казарин Л.С., Янишевский В.В. О конечных просто приводимых группах // Алгебра и анализ. 2007. Т. 19, № 6. С. 86-116.</mixed-citation><mixed-citation xml:lang="en">Казарин Л.С., Янишевский В.В. О конечных просто приводимых группах // Алгебра и анализ. 2007. Т. 19, № 6. С. 86-116.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Казарин Л.С., Чанков Е.И. Конечные просто приводимые группы разрешимы // Математический сборник. 2010. Т. 201, № 5. С. 27-40.</mixed-citation><mixed-citation xml:lang="en">Казарин Л.С., Чанков Е.И. Конечные просто приводимые группы разрешимы // Математический сборник. 2010. Т. 201, № 5. С. 27-40.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Kazarin L.S., Sagirov I.A. On the degrees of irreducible characters of finite simple groups // Proc. of the Steklov Inst. Math. Suppl. 2001. Vol. 2. P. 71-81.</mixed-citation><mixed-citation xml:lang="en">Kazarin L.S., Sagirov I.A. On the degrees of irreducible characters of finite simple groups // Proc. of the Steklov Inst. Math. Suppl. 2001. Vol. 2. P. 71-81.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">The GAP Group, GAP - Groups, Algorithms and Programming, Version 4.4.10, Aachen, St. Andrews, 2008; http://www.gap-system.org</mixed-citation><mixed-citation xml:lang="en">The GAP Group, GAP - Groups, Algorithms and Programming, Version 4.4.10, Aachen, St. Andrews, 2008; http://www.gap-system.org</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>
