Study on Isomorphism of Finite Groups and It’s Impact

Authors

  • Puja Kumari Research Scholar (Mathematics), BNMU, Madhepura, Bihar
  • Dr. Mukund Kumar Singh Professor of Mathematics, BNMU Madhepura, Bihar

Keywords:

Isomorphism, Finite Groups, Maximal subgroup, consequently solvable group

Abstract

A present paper to analysed the “Study on isomorphism of finite groups and it’s impact.” The study has shown that G/N satisfy the hypothesis of the theorem. For a group G is finite and the Arbitrary prime is p, we define a characteristic subgroup S-p(G), which is a generalization of the F (Frattini) subgroup of G, as follows: S-p(G) is the intersection of all increasing subgroups M of G such that G has the general degree index of M is G and M are mixed and co-prime to p\ if there is no. such maximal subgroup then we set Sp(G) = G. We obtain some results which characterize solvable groups. Some properties of the subgroup Sp(G) are also obtained. A characteristic subgroup Sp(G) characterize, compare and quantify the effectiveness and complexity of invariants for group isomorphism. The center inner automorphism commutator subgroups and groups, solvable radicals, abelian radicals, derived series and π-radicals and fitting groups. A depends on the type of symmetry Derivative series with basis in lower/upper and central part of factorial series. We see dimension of finite group has one greater and indivisible factor of the direct dimension.

References

R. BAER, Classes of finiue groups and their properties, Illinois J. Math. Vol-1 (1957), 115-187.

Peter A. Brooksbank, Joshua A. Grochow, Yinan Li, Youming Qiao, and James B. Wilson. Incorporating Weisfeiler-Leman into algorithms for group isomorphism. CoRR, abs/1905.02518, 2019.

Bireswar Das and Shivdutt Sharma. Nearly linear time isomorphism algorithms for some non-abelian group classes. In Ren’e van Bevern and Gregory Kucherov, editors, Computer Science - Theory and Applications - 14th International Computer Science Symposium in Russia, CSR 2019, Novosibirsk, Russia, July 1-5, 2019, Proceedings of Lecture Notes in Computer Science, pages 80–92. Springer, 2019.

N. P. MUKHERJEE, A note on normal index and maximal sub groups in finite groups, Illinois J. Math. 75 (1975) 173-178.

Joshua A. Grochow and Youming Qiao. On the complexity of isomorphism problems for tensors, groups, and polynomials I: tensor isomorphism-completeness. In James R. Lee, editor, 12th Innovations in Theoretical Computer Science Conference, ITCS 2021, January 6-8,

W. E. DESKINS, On maximal subgroups, proc«. Sympos. Pure Math. 1 (1959), 100-104.

2021, Virtual Conference, volume 185 of LIPIcs, pages 31:1–31:19. Schloss Dagstuhl - Leibniz Zentrum four Informatic, 2021.

David J. Rosenbaum. Bidirectional collision detection and faster deterministic isomorphism testing. CoRR, abs/1304.3935, 2013. arXiv.

Eugene M. Luks. Group isomorphism with fixed subnormal chains. CoRR, abs/1511.00151, 2015.

Downloads

Published

2023-04-01

How to Cite

[1]
“Study on Isomorphism of Finite Groups and It’s Impact”, JASRAE, vol. 20, no. 2, pp. 734–737, Apr. 2023, Accessed: Jun. 01, 2025. [Online]. Available: https://ignited.in/index.php/jasrae/article/view/15017

How to Cite

[1]
“Study on Isomorphism of Finite Groups and It’s Impact”, JASRAE, vol. 20, no. 2, pp. 734–737, Apr. 2023, Accessed: Jun. 01, 2025. [Online]. Available: https://ignited.in/index.php/jasrae/article/view/15017