ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let ϵ>0\epsilon>0. For rational positive numbers a1,…,ana_1,\dots,a_n and integers b1,…,bnb_1,\dots,b_n, define

Bj=max⁡{∣bj∣,1},Aj=max⁡{eh(aj),1},B=max⁡1≤j≤nBj.B_j=\max\{|b_j|,1\},\qquad A_j=\max\{\mathrm e^{\mathrm h(a_j)},1\},\qquad B=\max_{1\le j\le n}B_j.

Assume that b1log⁡a1+⋯+bnlog⁡an≠0b_1\log a_1+\cdots+b_n\log a_n\ne0. Lang's conjecture. There exists a constant C(ϵ)>0C(\epsilon)>0 depending only on ϵ\epsilon such that

∣b1log⁡a1+⋯+bnlog⁡an∣>C(ϵ)nB(B1⋯BnA12⋯An2)1+ϵ.|b_1\log a_1+\cdots+b_n\log a_n|>\frac{C(\epsilon)^nB}{(B_1\cdots B_nA_1^2\cdots A_n^2)^{1+\epsilon}}.

This is a conjectural lower bound for nonzero linear forms in logarithms of rational numbers. In the paper it is discussed as an input that would yield stronger estimates for values of binomial forms; its resolution status is not established in the supplied text.

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.