Compositions and parities of complete mappings and of orthomorphisms

DOI10.1016/J.JCTA.2022.105723arXiv2207.09642MaRDI QIDQ6405503FDOQ6405503

Publication date: 20 July 2022

Abstract: We determine the permutation groups

P_{m a t h r m c o m p} (m a t h b b F_{q}), P_{m a t h r m o r t h} (m a t h b b F_{q}) l e q o p e r a t o r n a m e S y m (m a t h b b F_{q})

generated by the complete mappings, respectively the orthomorphisms, of the finite field

m a t h b b F_{q}

-- both are equal to

o p e r a t o r n a m e S y m (m a t h b b F_{q})

unless

q i n 2, 3, 4, 5, 8

. More generally, denote by

P_{m a t h r m c o m p} (G)

, respectively

P_{m a t h r m o r t h} (G)

, the subgroup of

o p e r a t o r n a m e S y m (G)

generated by the complete mappings, respectively the orthomorphisms, of the group

G

. Using recent results of Eberhard-Manners-Mrazovi'c and M"uyesser-Pokrovskiy, we show that for each large enough finite group

G

that has a complete mapping (i.e., whose Sylow

2

-subgroups are trivial or noncyclic),

P_{m a t h r m c o m p} (G) = o p e r a t o r n a m e S y m (G)

and

P_{m a t h r m o r t h} (G) g e q o p e r a t o r n a m e A l t (G)

. We also prove that

P_{m a t h r m o r t h} (G) = o p e r a t o r n a m e S y m (G)

for every large enough finite solvable group

G

that has a complete mapping. Proving these results requires us to study the parities of complete mappings and of orthomorphisms. Some connections with known results in cryptography and with parity types of Latin squares are also discussed.

Mathematics Subject Classification ID

Cryptography (94A60) Orthogonal arrays, Latin squares, Room squares (05B15) Abstract finite groups (20D99) Permutation groups (20B99)

This page was built for publication: Compositions and parities of complete mappings and of orthomorphisms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6405503)