ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let y1,…,yℓ,zy_1,\dots,y_\ell,z be real numbers, with zz outside the rational span of 1,y1,…,yℓ1,y_1,\dots,y_\ell, and let ε,δ>0\varepsilon,\delta>0. For any n0>0n_0>0, there exist positive integers n0<n1<⋯<nMn_0<n_1<\dots<n_M and real numbers w1,…,wℓw_1,\dots,w_\ell. Set

K=∏m=1M(nm+1),km=Knm+1.K=\prod_{m=1}^M(n_m+1),\qquad k_m=\frac{K}{n_m+1}.

Dynamically defined covering-systems conjecture. These choices can satisfy both max⁡i∥nmyi−wi∥≤ε/2\max_i\|n_my_i-w_i\|\leq\varepsilon/2 for every m=1,…,Mm=1,\dots,M, and

∣(⋃m=1MZ+zkm+(−ε2K,ε2K))∩[0,1)∣≥1−δ.\left|\left(\bigcup_{m=1}^M\frac{\mathbb{Z}+z}{k_m}+\left(-\frac{\varepsilon}{2K},\frac{\varepsilon}{2K}\right)\right)\cap[0,1)\right|\geq1-\delta.

Here ∣⋅∣|\cdot| denotes Lebesgue measure and ∥⋅∥\|\cdot\| distance to the nearest integer. The claim strengthens the preceding typicality heuristic by imposing dynamically defined positive-density choices and an arbitrarily small expected uncovered measure; the supplied text gives no resolution evidence.

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.