Nilpotent groups are round

We define a notion of roundness for finite groups. Roughly speaking, a group is round if one can order its elements in a cycle in such a way that some natural summation operators map this cycle into new cycles containing all the elements of the group. Our main result is that this combinatorial property is equivalent to nilpotence.     

The average number of cycles

The paper remarks on the average number of cycles of the elements of a finite permutation group in general and computes this number for the alternating groups and wreath products using the cycle number indicator.     

On Spectra of Almost Simple Extensions of Even-Dimensional Orthogonal Groups

The spectrum of a finite group is the set of the orders of its elements. We consider the problem that arises within the framework of recognition of finite simple groups by spectrum: Determine all finite almost simple groups having the same spectrum as its socle. This problem was solved for all almost simple groups with exception of the case that the socle is a simple even-dimensional orthogonal group over a field of odd characteristic. Here we address this remaining case and determine the almost simple groups in question.Also we prove that there are infinitely many pairwise nonisomorphic finite groups having the same spectrum as the simple 8-dimensional symplectic group over a field of characteristic other than 7.     

Solvability of finite groups with 10 p elements of maximal order

It is proved that finite groups with 10_p elements of the largest order, wherep ≥ 23 a prime, are solvable in this article. Consequently it follows that all finite group with 10p elements of largest order are solvable by some other results.     

The intersection of the subgroups of finite index in Baumslag—Solitar groups

For any one-relator group in the family of Baumslag—Solitar groups, a system of its elements is indicated whose normal closure in the group coincides with the intersection of all normal finite-index subgroups. The well-known criterion for the residual finiteness of Baumslag—Solitar groups is an immediate consequence of this result. It is also shown that, if the intersection of all finite-index normal subgroups in a Baumslag—Solitar group differs from the identity subgroup (i.e., if the group is not residually finite), then this intersection cannot be the normal closure of any finite set of elements.     

Idempotent transformations of finite groups

We describe the action of idempotent transformations on finite groups. We show that finiteness is preserved by such transformations and enumerate all possible values such transformations can assign to a fixed finite simple group. This is done in terms of the first two homology groups. We prove for example that except special linear groups, such an orbit can have at most 7 elements. We also study the action of monomials of idempotent transformations on finite groups and show for example that orbits of this action are always finite.     

On residually finite groups of finite general rank

Following A. I.Mal’tsev, we say that a group G has finite general rank if there is a positive integer r such that every finite set of elements of G is contained in some r-generated subgroup. Several known theorems concerning finitely generated residually finite groups are generalized here to the case of residually finite groups of finite general rank. For example, it is proved that the families of all finite homomorphic images of a residually finite group of finite general rank and of the quotient of the group by a nonidentity normal subgroup are different. Special cases of this result are a similar result of Moldavanskii on finitely generated residually finite groups and the following assertion: every residually finite group of finite general rank is Hopfian. This assertion generalizes a similarMal’tsev result on the Hopf property of every finitely generated residually finite group.     

Finite groups and elements where characters vanish

By investigating the action of linear irreducible characters of a finite group on the product of all the irreducible characters and on a sum of certain irreducible characters, some results on vanishing elements of finite groups are obtained.     

On the Normal Structure of NonCommutative Association Schemes of Rank 6

The concept of an association scheme is a far-reaching generalization of the notion of a group. Many group theoretic facts have found a natural generalization in scheme theory. One of these generalizations is the observation that, similar to groups, association schemes of finite order are commutative if they have at most five elements and not necessarily commutative if they have six elements. While there is (up to isomorphism) only one noncommutative group of order 6, there are infinitely many pairwise non-isomorphic noncommutative association schemes of finite order with six elements. (Each finite projective plane provides such a scheme, and non-isomorphic projective planes yield non-isomorphic schemes.) In this note, we investigate noncommutative schemes of finite order with six elements which have a symmetric normal closed subset with three elements. We take advantage of the classification of the finite simple groups.     

On the power graph and the reduced power graph of a finite group

In this paper, for a finite group, we investigate to what extent its directed (resp. undirected) reduced power graph determines its directed power graph (resp. reduced power graph). Moreover, we investigate the determination of the orders of the elements of a finite group from its directed (resp. undirected) reduced power graph. Consequently, we show that some classes of finite groups are recognizable from their undirected reduced power graphs. Also, we study the relationship between the isomorphism classes of groups corresponding to the equivalence relations induced by the isomorphism of each of these graphs on the set of all finite groups.     

Pairwise -connected Products of Certain Classes of Finite Groups

Abstract

Subgroups A and B of a finite group are said to be 𝒩-connected if the subgroup generated by elements x and y is a nilpotent group, for every pair of elements x in A and y in B. The behaviour of finite pairwise permutable and 𝒩-connected products are studied with respect to certain classes of groups including those groups where all the subnormal subgroups permute with all the maximal subgroups, the so-called SM-groups, and also the class of soluble groups where all the subnormal subgroups permute with all the Carter subgroups, the so-called C-groups.     

SATURATED FORMATIONS CLOSED UNDER SYLOW NORMALIZERS

In this article we show that a finite soluble group possesses nilpotent Hall subgroups for well-defined sets of primes if and only if its Sylow normalizers satisfy the same property. In fact, this property of groups provides a characterization of the subgroup-closed saturated formations, whose elements are characterized by the Sylow normalizers belonging to the class, in the universe of all finite soluble groups.     

自同构群是循环群被交换群扩张的有限群

设Ｃ是有限群，ＡｕｔＧ＝ＡＢ，，Ａ是交换群且每Ｓｙｌｏｗ子群的秩≤２，Ｂ是循环群，本文得出了Ｇ的结构，特别地，证明了ＡｕｔＧ是秩≤２的交换群时，Ｇ循环。     

Scenery reconstruction on finite abelian groups

We consider the question of when a random walk on a finite abelian group with a given step distribution can be used to reconstruct a binary labeling of the elements of the group, up to a shift. Matzinger and Lember (2006) give a sufficient condition for reconstructability on cycles. While, as we show, this condition is not in general necessary, our main result is that it is necessary when the length of the cycle is prime and larger than 5, and the step distribution has only rational probabilities. We extend this result to other abelian groups.     

Finite groups in which every pair of elements of the same order is either conjugate or inverse-conjugate

For a group G, elements a and b are said to be inverse-conjugate if α is conjugate to b^?1. We classify all finite groups in which every pair of elements of the same order is either conjugate or inverse-conjugate. The groups with this property are either small soluble groups, which are explicitly listed, or the groups L ₂;(7), M₁₁, M₂₃ and Aut(Sz(8)).     

The power graph of a finite group

The power graph of a group is the graph whose vertex set is the group, two elements being adjacent if one is a power of the other. We observe that non-isomorphic finite groups may have isomorphic power graphs, but that finite abelian groups with isomorphic power graphs must be isomorphic. We conjecture that two finite groups with isomorphic power graphs have the same number of elements of each order. We also show that the only finite group whose automorphism group is the same as that of its power graph is the Klein group of order 4.     

On Turner’s theorem and first-order theory

A theorem of E.C. Turner states that if F is a finitely generated free group, then the test words are precisely the elements not contained in any proper retract. In this paper, we examine some ideas in model theory and logic related to Turner’s characterization of test words and introduce Turner groups, a class of groups containing all finite groups and all stably hyperbolic groups satisfying this characterization. We show that Turner’s theorem is not first-order expressible. However, we prove that every finitely generated elementary free group is a Turner group.     

恰有两个子群共轭类长的有限群

设G是有限群,Ns(G)表示G的子群共轭类长构成的集合.本文研究Ns(G)中只有两个元素时有限群G的结构,在非幂零情形时给出了G的完全分类,在幂零情形时获得了G的一些性质.     

The Subgroup Normalizer Problem for Integral Group Rings of Some Nilpotent and Metacyclic Groups

For a group G and a subgroup H of G, this article discusses the normalizer of H in the units of a group ring RG. We prove that H is only normalized by the “obvious” units, namely products of elements of G normalizing H and units of RG centralizing H, provided H is cyclic. Moreover, we show that the normalizers of all subgroups of certain nilpotent and metacyclic groups in the corresponding group rings are as small as possible. These classes contain all dihedral groups, all finite nilpotent groups, and all finite groups with all Sylow subgroups being cyclic.