ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let dd be the integer parameter in the transfer-operator construction, let q>0q>0, and let hnh_n denote the functions introduced in the paper. For k=1,…,dk=1,\ldots,d, define

Qk={(2(k−1),2k)if k=1,…,d−1,(2(d−1),∞)if k=d.Q_k=\begin{cases} \big(2(k-1),2k\big) & \text{if } k=1,\ldots,d-1,\\ \big(2(d-1),\infty\big) & \text{if } k=d.\end{cases}

Sign-pattern conjecture. Lemma (b) is true for every hnh_n, n∈Nn\in\mathbb{N}; that is, for q∈Qkq\in Q_k and 0<t<1/20<t<1/2, one has (−1)k−1hn′(t)>0(-1)^{k-1}h_n'(t)>0.

This is proposed on the basis of computer experiments as an extension of the proved statement for h1h_1.

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.