The conjecture that a gamma-function expression is logarithmically completely monotonic

Let ψ\psi denote the digamma function, let γ\gamma denote the Euler–Mascheroni constant, and define

q(t):=tt(ψ(t)logt)γ.q(t):=t^{t(\psi(t)-\log t)-\gamma}.

Logarithmic complete monotonicity conjecture. The function qq is logarithmically completely monotonic on (0,)(0,\infty); that is,

(1)n[logq(t)](n)0(-1)^n[\log q(t)]^{(n)}\geq 0

for every t>0t>0 and every integer n1n\geq 1. This conjecture concerns the relationship between completely monotonic and logarithmically completely monotonic functions, with the latter forming a subclass of the former. The supplied text attributes the conjecture to an earlier work but gives no evidence of a resolution.

Sources & referencesView supporting material

Primary source

Valmir Krasniqi and Armend Sh. Shabani, “On a conjecture of a logarithmically completely monotonic function”, arXiv:1601.00124 (2016).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.