SearcharxivSearch

arXiv · 1103.5955

Jensen's functional equation on the symmetric group $\bold{S_n}$

Abstract

Two natural extensions of Jensen's functional equation on the real line are the equations $f(xy)+f(xy^{-1}) = 2f(x)$ and $f(xy)+f(y^{-1}x) = 2f(x)$, where $f$ is a map from a multiplicative group $G$ into an abelian additive group $H$. In a series of papers \cite{Ng1}, \cite{Ng2}, \cite{Ng3}, C. T. Ng has solved these functional equations for the case where $G$ is a free group and the linear group $GL_n(R)$, $R=\z,\r$, a quadratically closed field or a finite field. He has also mentioned, without detailed proof, in the above papers and in \cite{Ng4} that when $G$ is the symmetric group $S_n$ the group of all solutions of these functional equations coincides with the group of all homomorphisms from $(S_n,\cdot)$ to $(H,+)$. The aim of this paper is to give an elementary and direct proof of this fact.

Explore related subjects

Keep this discovery

BibTeXRIS

Công-Trình Lê, Trung-Hiêu Thái. 2011-06-15. Jensen's functional equation on the symmetric group $\bold{S_n}$. https://doi.org/10.1007/s00010-011-0089-7

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