ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let ω\omega be the golden rotation number, let FsF_s denote the Fibonacci numbers, and write an integer k≥1k\ge1 in Fibonacci form k=∑s=1mbsFsk=\sum_{s=1}^{m}b_sF_s, with bs∈{0,1}b_s\in\{0,1\}, bm=1b_m=1, and br+1=1⇒br=0b_{r+1}=1\Rightarrow b_r=0. Define ks=∑u=s+1mbuFuk_s=\sum_{u=s+1}^{m}b_uF_u for 0≤s≤m−10\le s\le m-1 and km=0k_m=0. Uniform block-product assumption. There exist real constants C1,C2C_1,C_2 with 0<C1<C20<C_1<C_2, and with C1≤1≤C2C_1\le1\le C_2 to include empty products, such that

C1≤∏r=1bsFs∣2sin⁡π(rω+ksω)∣≤C2C_1\le\prod_{r=1}^{b_sF_s}|2\sin\pi(r\omega+k_s\omega)|\le C_2

for each 1≤s≤m1\le s\le m. This assumption is introduced as a step toward proving power-law bounds for the Sudler product, not as a named conjecture, and the supplied text gives no resolution.

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.