A study of the holomorphy of (r, s, t)-inverse loops

被引:0
作者
Oyebo, Y. T. [1 ]
Jaiyeola, T. G. [2 ]
Adeniran, J. O. [3 ]
机构
[1] Lagos State Univ, Dept Math, Ojo 102101, Nigeria
[2] Obafemi Awolowo Univ, Dept Math, Ife 220005, Nigeria
[3] Fed Univ Agr, Dept Math, Abeokuta 110101, Nigeria
关键词
Automorphism group; Autotopism; Weak inverse property (W.I.P.); Cross inverse property (C.I.P.); m-inverse prop; (r; s; t)-inverse property; Holomorphy; INNER MAPPINGS; QUASI-GROUPS;
D O I
10.1080/09720529.2021.1885810
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
In this paper, the holomorphic study of inverse properties in loops is put in a more general setting. For various combinations of r, s, t is an element of Z in parities, it was established that: (i) the A(Q)-holomorph H(Q) of a loop Q is an (r, s, t)-inverse loop if and only if Q is an (r, s, t) -inverse loop; (ii) the A(Q) -holomorph H(Q) of a loop Q is an (r, s, t)-inverse loop if and only if Q is an (r, s, t)-inverse loop, A(Q) is a particular kind of group (e.g abelian, Boolean) and any two elements of A(Q) satisfies some autotopic conditions. Specifically, m-inverse loop (when m is odd), double weak inverse property loop (WWIPL) and weak inverse property loop were found to satisfy the case (i) while m-inverse loop (when m is even) and weak inverse property loop were found to satisfy case (ii). For a Buchsteiner loop (which is a special kind of WWIPL) Q, it was shown that the A(Q)-holomorph H(Q) is a Buchsteiner loop if and only if A(Q) is a nuclear automorphism group. The left (right) inner automorphism group of a Buchsteiner loop Q was shown to be a normal subgroup of the automorphism group of Q. Existing examples of loops which are relevant to this study were cited.
引用
收藏
页码:67 / 86
页数:20
相关论文
共 50 条
  • [1] [r, s, t]-colorings of fans
    Liao, Wei
    Li, Mingchu
    ARS COMBINATORIA, 2015, 119 : 263 - 273
  • [2] [r, s, t; f]-COLORING OF GRAPHS
    Yu, Yong
    Liu, Guizhen
    JOURNAL OF THE KOREAN MATHEMATICAL SOCIETY, 2011, 48 (01) : 105 - 115
  • [3] A Note on [r, s, c, t]-Colorings of Graphs
    Sheng, Jian-Ting
    Liu, Gui-Zhen
    BULLETIN OF THE MALAYSIAN MATHEMATICAL SCIENCES SOCIETY, 2011, 34 (01) : 165 - 169
  • [4] [r, s, t]- Colorings of Friendship Graphs and Wheels
    Liao, Wei
    Li, Mingchu
    GRAPHS AND COMBINATORICS, 2015, 31 (06) : 2275 - 2292
  • [5] [r, s, t]-coloring of trees and bipartite graphs
    Dekar, Lyes
    Effantin, Brice
    Kheddouci, Hamamache
    DISCRETE MATHEMATICS, 2010, 310 (02) : 260 - 269
  • [6] On properties of discrete (r, q) and (s, T) inventory systems
    Ang, Marcus
    Song, Jing-Sheng
    Wang, Mingzheng
    Zhang, Hanqin
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2013, 229 (01) : 95 - 105
  • [7] [r, s, t]-Coloring of the Joint Graph Cm VCn
    Pan Yumei
    Mo Mingzhong
    2011 30TH CHINESE CONTROL CONFERENCE (CCC), 2011, : 1939 - 1943
  • [8] [r,s,t] - Colouring of One Kind of Join Graphs
    Mo Ming-Zhong
    Pan Yu-Mei
    PROCEEDINGS OF THE 2012 INTERNATIONAL CONFERENCE ON COMMUNICATION, ELECTRONICS AND AUTOMATION ENGINEERING, 2013, 181 : 655 - 661
  • [9] [r, s, t]-chromatic numbers and hereditary properties of graphs
    Kemnitz, Arnfried
    Marangio, Massimiliano
    Mihok, Peter
    DISCRETE MATHEMATICS, 2007, 307 (7-8) : 916 - 922
  • [10] (T,S) splitting methods for computing the generalized inverse A(2)T,S and rectangular systems
    Wei, YM
    Wu, HB
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2001, 77 (03) : 401 - 424