The half-automorphism group of code loops

Abstract

For any code loop L, we prove that the half-automorphism group of L is the product of the automorphism group of L by an elementary abelian 2-group consisting of all half-automorphisms that acts as the identity on a fixed basis. Also, we prove that elementary mappings only can be a half-automorphism on code loops of rank at most 3.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…