ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let nn be an odd prime. For 1≤κ≤n−11\leq\kappa\leq n-1, define

Tn(κ):=∑q=1(n−1)/21q ∣r(qκ,n)∣,T_n(\kappa):=\sum_{q=1}^{(n-1)/2}\frac{1}{q\,|r(q\kappa,n)|},

where r(j,n)r(j,n) is the unique integer congruent to jj modulo nn in {−(n−1)/2,…,(n−1)/2}\{-(n-1)/2,\ldots,(n-1)/2\}. Kazashi and Sloan's conjecture. There exist constants C1,C2>0C_1,C_2>0 and α≥2\alpha\geq 2, all independent of nn, such that

Tn(κ)>C1(log⁡n)αnT_n(\kappa)>C_1\frac{(\log n)^\alpha}{n}

holds for at most C2(log⁡n)αC_2(\log n)^\alpha values of κ\kappa among {1,…,n−1}\{1,\ldots,n-1\}. The conjecture would improve the averaged worst-case error bound for unshifted rank-1 lattice rules to O(1/n)O(1/n) up to a dimension-independent logarithmic factor; its resolution 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.