On Recognition of the Finite Simple Orthogonal Groups of Dimension 2m, 2m+1, and 2m+2 over a Field of Characteristic 2

The spectrum (G) of a finite group G is the set of element orders of G. A finite group G is said to be recognizable by spectrum (briefly, recognizable) if HG for every finite group H such that (H)=(G). We give two series, infinite by dimension, of finite simple classical groups recognizable by spectrum.     

Recognition of the Finite Simple Groups F 4(2m) by Spectrum

The spectrum of a finite group is the set of its element orders. A finite group G is said to be recognizable by spectrum, if every finite group with the same spectrum as G is isomorphic to G. The purpose of the paper is to prove that for every natural m the finite simple Chevalley group F ₄(2 ^m ) is recognizable by spectrum.     

On Recognition by Spectrum of Finite Simple Linear Groups over Fields of Characteristic 2

A finite group G is said to be recognizable by spectrum, i.e., by the set of element orders, if every finite group H having the same spectrum as G is isomorphic to G. We prove that the simple linear groups L _n (2^k) are recognizable by spectrum for n = 2^m ≥ 32.Original Russian Text Copyright © 2005 Vasil’ev A. V. and Grechkoseeva M. A.The authors were supported by the Russian Foundation for Basic Research (Grant 05-01-00797), the State Maintenance Program for the Leading Scientific Schools of the Russian Federation (Grant NSh-2069.2003.1), the Program “ Development of the Scientific Potential of Higher School” of the Ministry for Education of the Russian Federation (Grant 8294), the Program “Universities of Russia” (Grant UR.04.01.202), and a grant of the Presidium of the Siberian Branch of the Russian Academy of Sciences (No. 86-197).__________Translated from Sibirskii Matematicheskii Zhurnal, Vol. 46, No. 4, pp. 749–758, July–August, 2005.     

Recognition by spectrum of the groups 2~D_(2m+1)(3)

It is proved that a finite group with the same set of element orders as the simple group 2~D_(2m+1)(3) is isomorphic to 2~D_(2m+1)(3).     

Recognition by spectrum of the groups $$ ^2 D_{2^m + 1} (3) $$

Abstract It is proved that a finite group with the same set of element orders as the simple group is isomorphic to . This work was supported by Russian Foundation for Basic Research (Grant No. 07-01-00148), RFBR-BRFBR (Grant No. 08-01-90006) and RFBR-GFEN (Grant No. 08-01-92200)     

Recognition of simple groups U 3(Q) by element orders

An exhaustive solution is given to the recognition-by-spectrum problem for finite, simple, three-dimensional unitary groups. For every such group, the number of non-isomorphic, finite, isospectral groups is determined. In particular, a new counterexample to Problem 13.63 in the Kourovka Notebook is furnished. Supported by RFBR grant No. 05-01-00797, and by SB RAS Young Researchers Support grant No. 29 and Integration Project No. 2006.1.2. __________ Translated from Algebra i Logika, Vol. 45, No. 2, pp. 185–202, March–April, 2006.     

On Connection Between the Structure of a Finite Group and the Properties of Its Prime Graph

It is shown that the condition of nonadjacency of 2 and at least one odd prime in the Gruenberg-Kegel graph of a finite group G under some natural additional conditions suffices to describe the structure of G; in particular, to prove that G has a unique nonabelian composition factor. Applications of this result to the problem of recognition of finite groups by spectrum are also considered.Original Russian Text Copyright © 2005 Vasilev A. V.The author was supported by the Russian Foundation for Basic Research (Grant 05-01-00797), the State Maintenance Program for the Leading Scientific Schools of the Russian Federation (Grant NSh-2069.2003.1), the Program Development of the Scientific Potential of Higher School of the Ministry for Education of the Russian Federation (Grant 8294), the Program Universities of Russia (Grant UR.04.01.202), and a grant of the Presidium of the Siberian Branch of the Russian Academy of Sciences (No. 86-197).__________Translated from Sibirskii Matematicheskii Zhurnal, Vol. 46, No. 3, pp. 511–522, May–June, 2005.     

Recognition by Spectrum of Some Linear Groups over the Binary Field

We focus our attention on the linear groups L _n (2) and obtain some general properties of these groups. We will show then that the linear groups L _p (2), where 2 is a primitive root mod p (p odd prime), are recognizable by spectrum. For example, the linear groups L ₃(2), L ₅(2), L ₁₁(2), L ₁₃(2), L ₁₉(2), L ₂₉(2), L ₃₇(2), L ₅₃(2), etc. are recognizable by spectrum.     

Recognition by spectrum for finite simple linear groups of small dimensions over fields of characteristic 2

Two groups are said to be isospectral if they share the same set of element orders. For every finite simple linear group L of dimension n over an arbitrary field of characteristic 2, we prove that any finite group G isospectral to L is isomorphic to an automorphic extension of L. An explicit formula is derived for the number of isomorphism classes of finite groups that are isospectral to L. This account is a continuation of the second author's previous paper where a similar result was established for finite simple linear groups L in a sufficiently large dimension (n > 26), and so here we confine ourselves to groups of dimension at most 26. Supported by RFBR (project Nos. 08-01-00322 and 06-01-39001), by SB RAS (Integration Project No. 2006.1.2), and by the Council for Grants (under RF President) and State Aid of Leading Scientific Schools (grant NSh-344.2008.1) and Young Doctors and Candidates of Science (grants MD-2848.2007.1 and MK-377.2008.1). Translated from Algebra i Logika, Vol. 47, No. 5, pp. 558–570, September–October, 2008.     

On difference between the spectra of the simple groups Bn(q) and Cn(q)

We prove that the nonisomorphic simple groups B _n (q) and C _n (q) have different sets of element orders. Original Russian Text Copyright ? 2007 Grechkoseeva M. A. __________ Translated from Sibirskiĭ Matematicheskiĭ Zhurnal, Vol. 48, No. 1, pp. 89–92, January–February, 2007.     

Recognition of the Projective Special Linear Group over GF（3）

Let P be a finite group and denote by w（P） the set of its element orders. P is called k-recognizable by the set of its element orders if for any finte group G with ω（G） =ω（P） there are, up to isomorphism, k finite groups G such that G ≌P. In this paper we will prove that the group Lp（3）, where p 〉 3 is a prime number, is at most 2-recognizable.     

关于HSOLSSOM（2^nu^1）的谱

本文讨论型为２＾ｎｕ＾１的有对称正交侣的带洞自正交拉丁方（ＨＳＯＬＳＳＯＭ（２＾ｎｕ＾１））的谱。证明当ｎ≤９时,ＨＳＯＬＳＳＯＭ（２＾ｎｕ＾１）存在的充分必要条件是ｕ为偶数且ｎ≥３ｕ／２＋１;当ｎ≥２６３时,若ｕ为偶数且ｎ≥２（ｕ－２）,则ＨＳＯＬＳＳＯＭ（２＾ｎｕ＾１）存在。     

Recognition by the Set of Element Orders of Symmetric Groups of Degree r and r+1 for Prime r

We prove that the symmetric group S _r of prime degree r17 is recognizable by its element order set. A test for recognizability is obtained for the symmetric group S _r+1 with r17 prime.     

The Spectrum and Automorphism Group of the Set-Inclusion Graph

Let n,k and l be integers with 1 ≤ k ＜ l ≤ n-1.The set-inclusion graph G(n,k,l) is the graph whose vertex set consists of all k-andl-subsets of[n]={1,2,...,n},where two distinct vertices are adjacent if one of them is contained in the other.In this paper,we determine the spectrum and automorphism group of G(n,k,l).     

An Adjacency Criterion for the Prime Graph of a Finite Simple Group

For every finite non-Abelian simple group, we give an exhaustive arithmetic criterion for adjacency of vertices in a prime graph of the group. For the prime graph of every finite simple group, this criterion is used to determine an independent set with a maximal number of vertices and an independent set with a maximal number of vertices containing 2, and to define orders on these sets; the information obtained is collected in tables. We consider several applications of these results to various problems in finite group theory, in particular, to the recognition-by-spectra problem for finite groups. Supported by RFBR grant No. 05-01-00797; by the Council for Grants (under RF President) and State Aid of Fundamental Science Schools, project NSh-2069.2003.1; by the RF Ministry of Education Developmental Program for Scientific Potential of the Higher School of Learning, project No. 8294; by FP “Universities of Russia,” grant No. UR.04.01.202; and by Presidium SB RAS grant No. 86-197. __________ Translated from Algebra i Logika, Vol. 44, No. 6, pp. 682–725, November–December, 2005.     

Recognition of finite groups by the prime graph

We obtain the first example of an infinite series of finite simple groups that are uniquely determined by their prime graph in the class of all finite groups. We also show that there exist almost simple groups for which the number of finite groups with the same prime graph is equal to 2. Supported by RFBR grant No. 05-01-00797, and by SB RAS Young Researchers Support grant No. 29 and Integration project No. 2006.1.2. __________ Translated from Algebra i Logika, Vol. 45, No. 4, pp. 390–408, July–August, 2006.     

The Structure of the (Outer) Automorphism Group of a Bieberbach Group

Referring to Tits alternative, we develop a necessary and sufficient condition to decide whether the normalizer of a finite group of integral matrices is polycyclic-by-finite or is containing a non-Abelian free group. This result is of fundamental importance to conclude whether the (outer) automorphism group of a Bieberbach group is polycyclic-by-finite or has a non-cyclic free subgroup.     

Quasirecognition by the set of element orders of the groups E 6( q ) and 2 E 6( q )

We prove that if L is one of the simple groups E ₆(q) and ² E ₆(q) and G is some finite group with the same spectrum as L, then the commutant of G/F(G) is isomorphic to L and the quotient G/G′ is a cyclic {2,3}-group. Original Russian Text Copyright ? 2007 Kondrat’ev A. S. The author was supported by the Russian Foundation for Basic Research (Grant 04-01-00463) and the RFBR-NSFC (Grant 05-01-39000). __________ Translated from Sibirskiĭ Matematicheskiĭ Zhurnal, Vol. 48, No. 6, pp. 1250–1271, November–December, 2007.     

Optimal Systems and Group Classification of (1+2)-Dimensional Heat Equation

The optimal systems and symmetry breaking interactions for the (1+2)-dimensional heat equation are systematically studied. The equation is invariant under the nine-dimensional symmetry group H ₂. The details of the construction for an one-dimensional optimal system is presented. The optimality of one- and two-dimensional systems is established by finding some algebraic invariants under the adjoint actions of the group H ₂. A list of representatives of all Lie subalgebras of the Lie algebra h ₂ of the Lie group H ₂ is given in the form of tables and many of their properties are established. We derive the most general interactions F(t,x,y,u,u _x ,u _y ) such that the equation u _t =u _xx +u _yy +F(t,x,y,u,u _x ,u _y ) is invariant under each subgroup.     

Embeddings of Un(q2) and symmetric strongly regular graphs

In the geometric setting of the embedding of the unitary group U_n(q²) inside an orthogonal or a symplectic group over the subfield GF(q) of GF(q²), q odd, we show the existence of infinite families of transitive two‐character sets with respect to hyperplanes that in turn define new symmetric strongly regular graphs and two‐weight codes. © 2009 Wiley Periodicals, Inc. J Combin Designs 18: 248–253, 2010