ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let V(1,1)V(1,1) be the visibility set considered in the paper. For 1⩽a,b⩽N1\leqslant a,b\leqslant N, let b1<b2<⋯<bkab_1<b_2<\dots<b_{k_a} be the values of bb such that (a,lbi)∉V(1,1)(a,lb_i)\notin V(1,1) for every l∈Nl\in\mathbb{N} with 1⩽l⩽N/bi1\leqslant l\leqslant N/b_i, and define

c(a):=n(a,N)N,c(a):=\frac{n(a,N)}{N},

where n(a,N)n(a,N) is the number of bb with (a,b)∉V(1,1)(a,b)\notin V(1,1). Set

c1(a):=∑i=1ka1bi.c_1(a):=\sum_{i=1}^{k_a}\frac{1}{b_i}.

Full-density criterion for V(1,1)V(1,1). If

∑a=1Nc1(a)=o(N),\sum_{a=1}^N c_1(a)=o(N),

then dens⁡(V(1,1))=1\operatorname{dens}(V(1,1))=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.