SearcharxivSearch

arXiv · 1304.6234

The group generated by the gamma functions $Γ(ax+1)$, and its subgroup of the elements converging to constants

Abstract

Let $G$ be the multiplicative group generated by the gamma functions $Γ(ax+1)$ $(a=1,2,\dots)$, and $H$ be the subgroup of all elements of $G$ that converge to nonzero constants as $x\rightarrow\infty$. The quotient group $G/H$ is the group of equivalence classes of $G$, where $f$ and $g$ are equivalent $\iff f\sim Cg$ $(x\rightarrow\infty)$ for some $C\not=0$. We show that $G/H\simeq\mathbb{Q}^+$. A similar consideration is possible for the case that the gamma functions $Γ(ax+1)$ with $a\in\mathbb{R}^+$ are concerned, and we show that $G/H\simeq\mathbb{Z}\times\mathbb{R}\times\mathbb{R}$. Also, several concrete examples of the elements of $H$ are constructed, e.g., it holds that $\frac{\binom{18n}{12n,3n,3n}}{\binom{18n}{9n,8n,n}}\longrightarrow\sqrt{\frac{2}{3}}$ $(n\rightarrow\infty)$, where $\binom{*}{*,\dots,*}$ denotes a multinomial coefficient.

Explore related subjects

Keep this discovery

BibTeXRIS

Kazuto Asai. 2013-11-25. The group generated by the gamma functions $Γ(ax+1)$, and its subgroup of the elements converging to constants. https://arxiv.org/abs/1304.6234

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