SearcharxivSearch

arXiv · 2105.09117

The groups $G$ satisfying a functional equation $f(xk) = xf(x)$ for some $k \in G$

Abstract

We study the groups $G$ with the curious property that there exists an element $k\in G$ and a function $f\colon G\to G$ such that $f(xk)=xf(x)$ holds for all $x\in G$. This property arose from the study of near-rings and input-output automata on groups. We call a group with this property a $J$-group. Finite $J$-groups must have odd order, and hence are solvable. We prove that every finite nilpotent group of odd order is a $J$-group if its nilpotency class $c$ satisfies $c\le6$. If $G$ is a finite $p$-group, with $p>2$ and $p^2>2c-1$, then we prove that $G$ is $J$-group. Finally, if $p>2$ and $G$ is a regular $p$-group or, more generally, a power-closed one (i.e., in each section and for each $m\geq1$ the subset of $p^m$-th powers is a subgroup), then we prove that $G$ is a $J$-group.

Explore related subjects

Keep this discovery

BibTeXRIS

Dominik Bernhardt, Tim Boykett, Alice Devillers, Johannes Flake, S. P. Glasby. 2021-05-19. The groups $G$ satisfying a functional equation $f(xk) = xf(x)$ for some $k \in G$. https://arxiv.org/abs/2105.09117

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