ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GnG_n be the multiple Gamma functions of order nn, defined by G1(z)=Γ(z)G_1(z)=\Gamma(z) and the recurrence

Gn+1(z+1)=Gn+1(z)Gn(z),Gn(1)=1,G_{n+1}(z+1)=G_{n+1}(z)G_n(z),\qquad G_n(1)=1,

for z∈Cz\in\mathbb{C} and n∈Nn\in\mathbb{N}. For z∈C∖(−∞,0]z\in\mathbb{C}\setminus(-\infty,0], define

fn(z)=log⁡Gn(z+1)znLog⁡z.f_n(z)=\frac{\log G_n(z+1)}{z^n\operatorname{Log}z}.

Pick-function conjecture. For every n∈Nn\in\mathbb{N}, fnf_n is a Pick function with Stieltjes representation

log⁡Gn(z+1)znLog⁡z=1n!−∫0∞d~n(−t)t+z dt,\frac{\log G_n(z+1)}{z^n\operatorname{Log}z}=\frac{1}{n!}-\int_0^\infty\frac{\tilde d_n(-t)}{t+z}\,dt,

where

d~n(t)={−(−1)n−1Nn(∣t∣)log⁡∣t∣+log⁡∣Gn(t+1)∣tn((log⁡∣t∣)2+π2),t<0,0,t≥0,\tilde d_n(t)=\begin{cases}-\dfrac{(-1)^{n-1}N_n(|t|)\log|t|+\log|G_n(t+1)|}{t^n\bigl((\log|t|)^2+\pi^2\bigr)},&t<0,\\0,&t\geq0,\end{cases}

and, for t>0t>0,

Nn(t)=[t]([t]+1)([t]+2)⋯([t]+n−1)n!.N_n(t)=\frac{[t]([t]+1)([t]+2)\cdots([t]+n-1)}{n!}.

The cases n=1n=1 and n=2n=2 are known: the corresponding functions are Pick functions and their Stieltjes representations have been established. The conjecture asks for the analogous result for all orders nn; establishing it is described as challenging.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.