首页/论文/2002.06853

arXiv 2002.068532020-02math.GR

Half-automorphism group of Chein loops

Giliard Souza dos Anjos

备注：: 9 pages

英文摘要：

A bijection $f$ of a loop $L$ is a half-automorphism if $f(xy)\in \{f(x)f(y),f(y)f(x)\}$, for any $x,y\in L$. A half-automorphism is nontrivial when it is neither an automorphism nor an anti-automorphism. A Chein loop $L=G\cup Gu$ is a Moufang loop constructed from a group $G$ and an element $u$ of order $2$ outside of $G$. In this paper, the half-automorphism group of finite Chein loops is described.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

自由双交换李代数的自同构，I

Automorphisms of free metabelian Lie algebras, I

本文研究了自由双交换李代数的自同构性质，证明了特定条件下自同构的 tame 性及部分自同构的几乎 tame 性，推翻了领域内长期存在的结论。

2026-01-08math.GRmath.RA

代码循环的半自同构群

The half-automorphism group of code loops

本文研究了代码循环的半自同构群结构，证明其为自同构群与2阶交换群的乘积，并指出初等映射在低秩代码循环上的半自同构性质。

2026-01-05math.GR

Half-automorphism group of a class of Bol loops

A Bol loop is a loop that satisfies the Bol identity $(xy.z)y=x(yz.y)$. If $L$ is a loop and $f:L\to L$ is a bijection such that $f(xy)\in\{f(x)f(y),f(y)f(x)\}$, for every $x$, $y\in L$, then $f$ is called a half-automorphism of $L$. In this paper, we describe the half-automorphism group of a class of Bol loops of order $4m$.

2022-02-07math.GR

Half-isomorphisms whose inverses are also half-isomorphisms

Let $(G,*)$ and $(G',\cdot)$ be groupoids. A bijection $f: G \rightarrow G'$ is called a half-isomorphism if $f(x*y)\in\{f(x)\cdot f(y),f(y)\cdot f(x)\}$, for any $ x, y \in G$. A half-isomorphism of a groupoid onto itself is a half-automorphism. A half-isomorphism $f$ is called special if $f^{-1}$ is also a half-isomorphism. In this paper, necessary and sufficient conditions for the existence of special half-isomorphisms on groupoids and quasigroups are obtained. Furthermore, some examples of non-special half-automorphisms for loops of infinite order are provided.

2020-07-12math.GR

Normal subgroups of groups acting on trees and automorphism groups of graphs

Let $T$ be a tree and $e$ an edge in $T$. If $C$ is a component of $T\setminus e$ and both $C$ and its complement are infinite we say that $C$ is a half-tree. The main result of this paper is that if $G$ is a closed subgroup of the automorphism group of $T$ and $G$ leaves no non-trivial subtree invariant and fixes no end of $T$ then the subgroup generated by the pointwise stabilizers of half-trees is topologically simple. This result is used to derive analogues of recent results of Caprace and De Medts (2011) and it is also applied in the study of the full automorphism group of a locally finit…

2012-09-17math.GR

Half-isomorphisms of finite automorphic Moufang loops

We show that each half-automorphism of a finite automorphic Moufang loop is trivial. In general this is not true for finite left automorphic Moufang loops and for finite automorphic loops.

2014-12-16math.GR

更多相关论文收起更多论文

关于半弧传递四价图的自同构群

On automorphism groups of half-arc-transitive tetravalent graphs

Beijing Jiaotong University（北京交通大学）；The University of Melbourne（墨尔本大学）

本文刻画了存在子群M<H使得图是M-半弧传递且H-弧传递的连通四价图，构造了各类例子，包括对Rivera和Šparl 2019年问题的反例以及首个非交换单群上的四价正规边传递非正规Cayley图。

2026-06-23math.COmath.GR

The Automorphism Groups of the Groups of Order 32p

The results of computer computations determining the automorphism groups of the groups of order 32$p$ for $p \geq 3$ are given in several tables. Presentations for the automorphism groups of the groups of order 32, which in many cases appear as direct product factors in the automorphism groups of order $32p$, are also presented for completeness. Many of the groups of order 32$p$ with a normal sylow $p$-subgroup have automorphism groups of the form: Hol($C_p$)$ \times $Invariant Factor. A suggestion is made as to how one might determine this invariant factor using only information on the automo…

2009-11-19math.GR

Half-isomorphisms of automorphic loops

Automorphic loops are loops in which all inner mappings are automorphisms. This variety of loops includes groups and commutative Moufang loops. A half-isomorphism $f : G \longrightarrow K$ between multiplicative systems $G$ and $K$ is a bijection from $G$ onto $K$ such that $f(ab)\in\{f(a)f(b), f(b)f(a)\}$ for any $a,b\in G$. A half-isomorphism is trivial when it is either an isomorphism or an anti-isomorphism. Consider the class of automorphic loops such that the equation $x\cdot(x\cdot y) = (y\cdot x)\cdot x $ is equivalent to $x\cdot y = y\cdot x$. Here we show that this class of loops incl…

2022-03-11math.GR

Half-arc-transitive graphs of prime-cube order of small valencies

A graph is called {\em half-arc-transitive} if its full automorphism group acts transitively on vertices and edges, but not on arcs. It is well known that for any prime $p$ there is no tetravalent half-arc-transitive graph of order $p$ or $p^2$. Xu~[Half-transitive graphs of prime-cube order, J. Algebraic Combin. 1 (1992) 275-282] classified half-arc-transitive graphs of order $p^3$ and valency $4$. In this paper we classify half-arc-transitive graphs of order $p^3$ and valency $6$ or $8$. In particular, the first known infinite family of half-arc-transitive Cayley graphs on non-metacyclic $p$…

2016-05-26math.COmath.GR

Finite groups with an automorphism cubing a large fraction of elements

We investigate the possible structures imposed on a finite group by its possession of an automorphism sending a large fraction of the group elements to their cubes, the philosophy being that this should force the group to be, in some sense, close to abelian. We prove two theorems. In the first, we completely classify all finite groups with an automorphism cubing more than half their elements. All such groups are either nilpotent class 2 or have an abelian subgroup of index at most 2. For our second theorem we show that, if a group possesses an automorphism sending more than 4/15 of its element…

2007-10-23math.GRmath.NT

On distance two in Cayley graphs of Coxeter groups

We consider the Cayley graph ${\rm C}(W,S)$ of a Coxeter system $(W,S)$ and describe all maximal $2$-cliques in this graph, i.e. maximal subsets in the vertex set such that the distance between any two distinct elements is equal to $2$. As an application, we show that every automorphism of the half of Cayley graph is uniquely extendable to an automorphism of the Cayley graph if $|S|\ge 5$.

2014-04-28math.COmath.GR

半旗传递区组设计的本原性与约化

On primitivity and reduction for half-flag-transitive block designs

本文为半旗传递2-设计建立点本原的充分条件，并分类几乎单型中基座为散在单群的情形，得到HS群对应的两个唯一设计。

2025-09-26math.GR