Related papers: The half-automorphism group of code loops
The group of 2-by-2 matrices with integer entries and determinant $\pm > 1$ can be identified either with the group of outer automorphisms of a rank two free group or with the group of isotopy classes of homeomorphisms of a 2-dimensional…
In this paper we consider some classical varieties of linear algebras over the field which has characteristic 0. For every considered variety we take a category of the finite generated free algebras of this variety. And for every this…
We introduce the concept of a double automorphism of an A-graded Lie algebra L. Roughly, this is an automorphism of L which also induces an automorphism of the group A. It is clear that the set of all double automorphisms of L forms a…
The full automorphism group of a certain elementary abelian $p$-cover of the Hermitian curve in characteristic $p>0$ is determined. It is remarkable that the order of Sylow $p$-groups of the automorphism group is close to Nakajima's bound…
A loop is automorphic if all its inner mappings are automorphisms. We construct the free commutative automorphic $2$-generated loop of nilpotency class $3$. It has dimension $8$ over the integers.
We describe the autotopism group Atp(G) of any abelian group G as being a semidirect product of its automorphism group Aut(G) and G^2. We then provide the subgroup structure of Atp(G) when G is a finite cyclic group.
Automorphic loops are loops in which all inner mappings are automorphisms. This variety of loops includes, for instance, groups and commutative Moufang loops. We study uniquely 2-divisible automorphic loops, particularly automorphic loops…
A rank 3 graph is an orbital graph of a rank 3 permutation group of even order. Despite the classification of rank 3 graphs being complete, see, e.g., Chapter 11 of the recent monograph 'Strongly regular graphs' by Brouwer and Van…
Using the theory of group action, we first introduce the concept of the automorphism group of an exponential family or a graphical model, thus formalizing the general notion of symmetry of a probabilistic model. This automorphism group…
A loop is automorphic if all its inner mappings are automorphisms. We construct a large family of automorphic loops as follows. Let $R$ be a commutative ring, $V$ an $R$-module, $E=\mathrm{End}_R(V)$ the ring of $R$-endomorphisms of $V$,…
We prove that every automorphism of the category of free Lie algebras is a semi-inner automorphism.
The present work investigates regular, semiregular, and chiral polytopes of any rank $d\geq 3$, whose automorphism groups are 2-groups. There is a large variety of rather small finite regular or alternating semiregular polytopes with…
It is shown that in various categories, including many consisting of maps or hypermaps, oriented or unoriented, of a given hyperbolic type, every countable group $A$ is isomorphic to the automorphism group of uncountably many non-isomorphic…
Many common finite p-groups admit automorphisms of order coprime to p, and when p is odd, it is reasonably difficult to find finite p-groups whose automorphism group is a p-group. Yet the goal of this paper is to prove that the automorphism…
Let $L$ be an algebra over a field $F$ with the binary operations $+$ and $[,]$. Then $L$ is called a left Leibniz algebra if it satisfies the left Leibniz identity: $[[a,b],c]=[a,[b,c]]-[b,[a,c]]$ for all elements $a,b,c\in L$. A linear…
The existence of an extremal self-dual binary linear code C of length 72 is a long-standing open problem. We continue the investigation of its automorphism group: looking at the combination of the subcodes fixed by different involutions and…
Let $A$ be an abelian variety over an algebraically closed field. We show that $A$ is the automorphism group scheme of some smooth projective variety if and only if $A$ has only finitely many automorphisms as an algebraic group. This…
We prove that the group of automorphisms of the category of free modules over Noterian rings is semi-inner and present also a short proof of a similar result for the variery of Lie algebras.
Two isometry groups of combinatorial codes are described: the group of automorphisms and the group of monomial automorphisms, which is the group of those automorphisms that extend to monomial maps. Unlike the case of classical linear codes,…
By a map we mean a $2$-cell decomposition of a closed compact surface, i.e., an embedding of a graph such that every face is homeomorphic to an open disc. Automorphism of a map can be thought of as a permutation of the vertices which…