SearcharxivSearch

arXiv · 1902.10809

Means Compatible with Semigroup Laws

Abstract

A binary mean operation m(x,y) is said to be compatible with a semigroup law *, if * satisfies the Gauss' functional equation m(x,y) * m(x,y) = x * y for all x, y. Thus the arithmetic mean is compatible with the group addition in the set of real numbers, while the geometric mean is compatible with the group multiplication in the set of all positive real numbers. Using one of Jacobi's theta functions, Tanimoto has constructed a novel binary operation * corresponding to the arithmetic-geometric mean agm(x,y) of Gauss. Tanimoto shows that it is only a loop operation, but not associative. A natural question is to ask if there exist a group law * compatible with arithmetic-geometric mean. In this paper we prove that there is no semigroup law compatible with agm and hence, in particular, no group law either. Among other things, this explains why Tanimoto's novel operation * using theta functions must be non-associative.

Explore related subjects

Keep this discovery

BibTeXRIS

R. Padmanabhan, Alok Shukla. 2019-02-27. Means Compatible with Semigroup Laws. https://arxiv.org/abs/1902.10809

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