scholarly journals Finite automorphism groups of laminated near-rings

1983 ◽  
Vol 26 (3) ◽  
pp. 297-306 ◽  
Author(s):  
K. D. Magill ◽  
P. R. Misra ◽  
U. B. Tewari
Keyword(s):  
Finite Group ◽  
Linear Group ◽  
Complex Plane ◽  
Finite Groups ◽  
Automorphism Groups ◽  
The Other ◽  
Complex Polynomial ◽  
Infinite Groups ◽  
Nonsingular Matrices ◽  
A Finite Group

In [3] we initiated our study of the automorphism groups of a certain class of near-rings. Specifically, let P be any complex polynomial and let P denote the near-ring of all continuous selfmaps of the complex plane where addition of functions is pointwise and the product fg of two functions f and g in P is defined by fg=f∘P∘g. The near-ring P is referred to as a laminated near-ring with laminating element P. In [3], we characterised those polynomials P(z)=anzn + an−1zn−1 +…+a0 for which Aut P is a finite group. We are able to show that Aut P is finite if and only if Deg P≧3 and ai ≠ 0 for some i ≠ 0, n. In addition, we were able to completely determine those infinite groups which occur as automorphism groups of the near-rings P. There are exactly three of them. One is GL(2) the full linear group of all real 2×2 nonsingular matrices and the other two are subgroups of GL(2). In this paper, we begin our study of the finite automorphism groups of the near-rings P. We get a result which, in contrast to the situation for the infinite automorphism groups, shows that infinitely many finite groups occur as automorphism groups of the near-rings under consideration. In addition to this and other results, we completely determine Aut P when the coefficients of P are real and Deg P = 3 or 4.

scholarly journals More on automorphism groups of laminated near-rings

1988 ◽  
Vol 31 (2) ◽  
pp. 185-195 ◽  
Author(s):  
D. K. Blevins ◽  
K. D. Magill ◽  
P. R. Misra ◽  
J. C. Parnami ◽  
U. B. Tewari
Keyword(s):  
Automorphism Group ◽  
Linear Group ◽  
Complex Plane ◽  
Automorphism Groups ◽  
Complex Polynomial ◽  
Infinite Groups ◽  
Real Matrices

We will assume throughout this paper that polynomials are nonconstant. Let P be any complex polynomial and let p denote the near-ring of all continuous selfmaps of the complex plane where addition of functions is pointwise and multiplication is defined by fg = f ο P ο g for all f,g∈p. The near-ring p is referred to as a laminated near-ring and P is referred to as the laminating element or laminator. In [1] the problem was posed of determining Aut p the automorphism group of p. It was shown that exactly three infinite groups occur as automorphism groups of the laminated near-rings p and for each of the three groups those polynomials P were characterized such that Aut p is isomorphic to that particular group. The infinite groups turn out to be GL(2), the full linear group of all 2×2 nonsingular real matrices and two of its subgroups.

scholarly journals Towards a classification of rigid product quotient varieties of Kodaira dimension 0

2021 ◽  
Author(s):  
Ingrid Bauer ◽  
Christian Gleissner
Keyword(s):  
Finite Group ◽  
Finite Groups ◽  
Structure Theorem ◽  
Complete Classification ◽  
Kodaira Dimension ◽  
The Other ◽  
Diagonal Action ◽  
Quotient Varieties ◽  
A Finite Group

AbstractIn this paper the authors study quotients of the product of elliptic curves by a rigid diagonal action of a finite group G. It is shown that only for $$G = {{\,\mathrm{He}\,}}(3), {\mathbb {Z}}_3^2$$ G = He ( 3 ) , Z 3 2 , and only for dimension $$\ge 4$$ ≥ 4 such an action can be free. A complete classification of the singular quotients in dimension 3 and the smooth quotients in dimension 4 is given. For the other finite groups a strong structure theorem for rigid quotients is proven.

Proper connection of power graphs of finite groups

2020 ◽  
pp. 2150033
Author(s):  
Xuanlong Ma
Keyword(s):  
Finite Group ◽  
Finite Groups ◽  
Undirected Graph ◽  
The Other ◽  
Connection Number ◽  
Power Graph ◽  
Vertex Set ◽  
Proper Connection Number ◽  
A Finite Group

Let [Formula: see text] be a finite group. The power graph of [Formula: see text] is the undirected graph whose vertex set is [Formula: see text], and two distinct vertices are adjacent if one is a power of the other. The reduced power graph of [Formula: see text] is the subgraph of the power graph of [Formula: see text] obtained by deleting all edges [Formula: see text] with [Formula: see text], where [Formula: see text] and [Formula: see text] are two distinct elements of [Formula: see text]. In this paper, we determine the proper connection number of the reduced power graph of [Formula: see text]. As an application, we also determine the proper connection number of the power graph of [Formula: see text].

scholarly journals On the minimum degree of the power graph of a finite cyclic group

2020 ◽  
pp. 2150044
Author(s):  
Ramesh Prasad Panda ◽  
Kamal Lochan Patra ◽  
Binod Kumar Sahoo
Keyword(s):  
Finite Group ◽  
Cyclic Group ◽  
Finite Groups ◽  
Minimum Degree ◽  
Simple Graph ◽  
The Other ◽  
Prime Divisors ◽  
Power Graph ◽  
Vertex Set ◽  
A Finite Group

The power graph [Formula: see text] of a finite group [Formula: see text] is the undirected simple graph whose vertex set is [Formula: see text], in which two distinct vertices are adjacent if one of them is an integral power of the other. For an integer [Formula: see text], let [Formula: see text] denote the cyclic group of order [Formula: see text] and let [Formula: see text] be the number of distinct prime divisors of [Formula: see text]. The minimum degree [Formula: see text] of [Formula: see text] is known for [Formula: see text], see [R. P. Panda and K. V. Krishna, On the minimum degree, edge-connectivity and connectivity of power graphs of finite groups, Comm. Algebra 46(7) (2018) 3182–3197]. For [Formula: see text], under certain conditions involving the prime divisors of [Formula: see text], we identify at most [Formula: see text] vertices such that [Formula: see text] is equal to the degree of at least one of these vertices. If [Formula: see text], or that [Formula: see text] is a product of distinct primes, we are able to identify two such vertices without any condition on the prime divisors of [Formula: see text].

Finite Groups Which are Automorphism Groups of Infinite Groups Only

1985 ◽  
Vol 28 (1) ◽  
pp. 84-90
Author(s):  
Jay Zimmerman
Keyword(s):  
Finite Group ◽  
Automorphism Group ◽  
Finite Field ◽  
Finite Groups ◽  
Finite Simple Group ◽  
Automorphism Groups ◽  
Outer Automorphism ◽  
Schur Multiplier ◽  
Infinite Groups ◽  
Infinite Set

AbstractThe object of this paper is to exhibit an infinite set of finite semisimple groups H, each of which is the automorphism group of some infinite group, but of no finite group. We begin the construction by choosing a finite simple group S whose outer automorphism group and Schur multiplier possess certain specified properties. The group H is a certain subgroup of Aut S which contains S. For example, most of the PSL's over a non-prime finite field are candidates for S, and in this case, H is generated by all of the inner, diagonal and graph automorphisms of S.

More on the OD-Characterizability of a Finite Group

2011 ◽  
Vol 18 (04) ◽  
pp. 663-674 ◽  
Author(s):  
A. R. Moghaddamfar ◽  
S. Rahbariyan
Keyword(s):  
Finite Group ◽  
Finite Groups ◽  
Automorphism Groups ◽  
Symmetric Groups ◽  
Alternating Groups ◽  
Degree Pattern ◽  
Prime Graphs ◽  
A Finite Group ◽  
P 53 ◽  
Number Of Authors

The degree pattern of a finite group G was introduced in [10]. We say that G is k-fold OD-characterizable if there exist exactly k non-isomorphic finite groups with the same order and same degree pattern as G. When a group G is 1-fold OD-characterizable, we simply call it OD-characterizable. In recent years, a number of authors attempt to characterize finite groups by their order and degree pattern. In this article, we first show that for the primes p=53, 61, 67, 73, 79, 83, 89, 97, the alternating groups Ap+3 are OD-characterizable, while the symmetric groups Sp+3 are 3-fold OD-characterizable. Next, we show that the automorphism groups Aut (O7(3)) and Aut (S6(3)) are 6-fold OD-characterizable. It is worth mentioning that the prime graphs associated with all these groups are connected.

scholarly journals Spectrum and L-spectrum of the power graph and its main supergraph for certain finite groups

Filomat ◽  
2017 ◽  
Vol 31 (16) ◽  
pp. 5323-5334 ◽  
Author(s):  
Asma Hamzeh ◽  
Ali Ashrafi
Keyword(s):  
Finite Group ◽  
Characteristic Polynomial ◽  
Finite Groups ◽  
The Other ◽  
Laplacian Spectrum ◽  
Simple Graphs ◽  
Power Graph ◽  
Vertex Set ◽  
A Finite Group

Let G be a finite group. The power graph P(G) and its main supergraph S(G) are two simple graphs with the same vertex set G. Two elements x,y ? G are adjacent in the power graph if and only if one is a power of the other. They are joined in S(G) if and only if o(x)|o(y) or o(y)|o(x). The aim of this paper is to compute the characteristic polynomial of these graph for certain finite groups. As a consequence, the spectrum and Laplacian spectrum of these graphs for dihedral, semi-dihedral, cyclic and dicyclic groups were computed.

Centralizers in a group whose central factor is simple

2018 ◽  
Vol 17 (08) ◽  
pp. 1850149
Author(s):  
Seyyed Majid Jafarian Amiri ◽  
Hojjat Rostami
Keyword(s):  
Finite Group ◽  
Linear Group ◽  
Finite Groups ◽  
Special Linear Group ◽  
Projective Special Linear Group ◽  
Special Linear ◽  
Central Factor ◽  
Suzuki Group ◽  
A Finite Group ◽  
Appl Math

In this paper, we find the number of the element centralizers of a finite group [Formula: see text] such that the central factor of [Formula: see text] is the projective special linear group of degree 2 or the Suzuki group. Our results generalize some main results of [Ashrafi and Taeri, On finite groups with a certain number of centralizers, J. Appl. Math. Comput. 17 (2005) 217–227; Schmidt, Zentralisatorverbände endlicher Gruppen, Rend. Sem. Mat. Univ. Padova 44 (1970) 97–131; Zarrin, On element centralizers in finite groups, Arch. Math. 93 (2009) 497–503]. Also, we give an application of these results.

scholarly journals Families of solvable Frobenius subgroups in finite groups

2002 ◽  
Vol 165 ◽  
pp. 117-121
Author(s):  
Paul Lescot
Keyword(s):  
Finite Group ◽  
Linear Group ◽  
Finite Groups ◽  
Special Linear Group ◽  
Famous Result ◽  
Rank 2 ◽  
Characteristic 2 ◽  
A Finite Group ◽  
Suzuki Groups ◽  
Degenerate Cases

We introduce the notion of abelian system on a finite group G, as a particular case of the recently defined notion of kernel system (see this Journal, September 2001). Using a famous result of Suzuki on CN-groups, we determine all finite groups with abelian systems. Except for some degenerate cases, they turn out to be special linear group of rank 2 over fields of characteristic 2 or Suzuki groups. Our ideas were heavily influenced by [1] and [8].

scholarly journals Perfect codes in power graphs of finite groups

2017 ◽  
Vol 15 (1) ◽  
pp. 1440-1449 ◽  
Author(s):  
Xuanlong Ma ◽  
Ruiqin Fu ◽  
Xuefei Lu ◽  
Mengxia Guo ◽  
Zhiqin Zhao
Keyword(s):  
Finite Group ◽  
Finite Groups ◽  
Cyclic Subgroup ◽  
The Other ◽  
Perfect Code ◽  
Perfect Codes ◽  
Power Graph ◽  
Vertex Set ◽  
A Finite Group

Abstract The power graph of a finite group is the graph whose vertex set is the group, two distinct elements being adjacent if one is a power of the other. The enhanced power graph of a finite group is the graph whose vertex set consists of all elements of the group, in which two vertices are adjacent if they generate a cyclic subgroup. In this paper, we give a complete description of finite groups with enhanced power graphs admitting a perfect code. In addition, we describe all groups in the following two classes of finite groups: the class of groups with power graphs admitting a total perfect code, and the class of groups with enhanced power graphs admitting a total perfect code. Furthermore, we characterize several families of finite groups with power graphs admitting a perfect code, and several other families of finite groups with power graphs which do not admit perfect codes.

Sign in / Sign up

Export Citation Format

Share Document