SearcharxivSearch

arXiv · 1707.03790

The multiplicative loops of Jha-Johnson semifields

Abstract

The multiplicative loops of Jha-Johnson semifields are non-automorphic finite loops whose left and right nuclei are the multiplicative groups of a field extension of their centers. They yield examples of finite loops with non-trivial automorphism group and non-trivial inner mappings. Upper bounds are given for the number of non-isotopic multiplicative loops of order $q^{nm}-1$ that are defined using the twisted polynomial ring $K[t;σ]$ and a twisted irreducible polynomial of degree $m$, when the automorphism $σ$ has order $n$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

S Pumpluen. 2018-01-11. The multiplicative loops of Jha-Johnson semifields. https://doi.org/10.1090/conm%2F721%2F14508

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR