arXiv:0906.4209v2

On Larcher's theorem concerning good lattice points and multiplicative subgroups modulo p

Nikolay G. Moshchevitin, Dmitrii M. Ushanov

math.NT11K3111K38

Abstract

We prove the existence of two-dimensional good lattice points in thick multiplicative subgroups modulo pp.

AI-generated audit

Audit summary

Audited against arXiv v2

Not a correctness certificate. A “Correct” result may include yellow typos or minor formal corrections that do not affect substantive soundness. It means this audit found no unresolved substantive error under the stated criteria; it does not replace expert scrutiny or formal verification.

Current report

Detailed mathematical audit

Generated August 20, 2026
01Statements2 reported findingsCorrect

The partial-quotient and discrepancy existence results for thick multiplicative cosets are correct.

Theorem 1Correct

Uniform partial-quotient bound on more than half of the coset

Page 1 · Theorem 1 · arXiv:0906.4209v2

For R105p7/8(logp)3/2|R|\geq10^5p^{7/8}(\log p)^{3/2}, the character-sum estimate makes the average number of forbidden short congruences less than 1/21/2. Hence more than half of aRa\in R have none, and the continued-fraction criterion gives bj(a)<16logpb_j(a)<16\log p for every partial quotient.

Theorem 2 and corollaryCorrect

Small total partial quotient and low discrepancy

Pages 1–2 · Theorem 2 and Corollary · arXiv:0906.4209v2

The layer-cake count for the functions faf_a and the subgroup character estimate yield an aRa\in R with bi(a)500logploglogp\sum b_i(a)\leq500\log p\log\log p. The standard discrepancy–continued-fraction inequality then gives the stated Dp(a)logploglogpD_p(a)\ll\log p\log\log p.

02Proofs4 reported findingsCorrect

The Burgess estimate, orthogonality calculation, and continued-fraction counting argument are correct; one subgroup symbol is misprinted.

Lemma 1Correct and complete

Character sum over the hyperbolic cover

Pages 2–3 · Lemma 1 · arXiv:0906.4209v2

Each rectangle factors into two interval character sums. Burgess with r=2r=2 bounds their product by 900kp3/8logp900k p^{3/8}\log p, and summing over at most 2log2p2\log_2p rectangles gives the stated 10000p7/8(logp)2/c10000p^{7/8}(\log p)^2/\sqrt c estimate.

Proof of Theorem 1Correct and complete

Character orthogonality and the continued-fraction criterion

Pages 3–4 · Equations (3)–(6) and proof of Theorem 1 · arXiv:0906.4209v2

Absence of a counted congruence gives ax/p>1/(xt)\lVert ax/p\rVert>1/(xt). Lemma B then forces every partial quotient below tt. Averaging the nonnegative count over the coset leaves only characters trivial on UU; the principal term is at most R/4|R|/4 and Lemma 1 makes the nonprincipal contribution smaller than R/4|R|/4 under the stated size hypothesis.

Equation (7)Typo

The coset notation should refer to UU and R=vUR=vU

Page 5 · Equation (7) and the following paragraph · arXiv:0906.4209v2

In the count of B(c)B(c), replace the undefined KK in bxKb\in xK by the coset RR, and replace “characters trivial on RR” by “characters trivial on UU.” Since aR=vUa\in R=vU, multiplication by xx puts the residue in xRxR, while the orthogonality relation is over the subgroup UU. The following factors χ(v)\chi(v) and R=U|R|=|U| confirm the unique intended notation.

Proof of Theorem 2Correct and complete

Partial summation and averaging

Pages 4–6 · proof of Theorem 2 · arXiv:0906.4209v2

For aa from the good half-coset, fa(x)<16logpf_a(x)<16\log p. Summing its level sets reduces the mean of SaS_a to ctB(c)\sum_{c\leq t}|B(c)|. The principal harmonic sum and the c1/2c^{-1/2} nonprincipal sum give the displayed bound, and the hypothesis R108p7/8(logp)5/2|R|\geq10^8p^{7/8}(\log p)^{5/2} leaves an element with the required total partial quotient.

03Novelty0 reported findingsNo non-novelty findings

No non-novelty findings.

Detailed audit reportFull reasoning, manuscript locations, and references.
Open report PDF ↗

Author response

Challenge an audit finding

Local workflow preview

A listed author may submit formal evidence that an audit is inaccurate. The response would be considered in a fresh AI re-evaluation; it would not edit the audit automatically.

Paper
arXiv:0906.4209v2
Authors listed
Nikolay G. Moshchevitin, Dmitrii M. Ushanov
Audit date
August 20, 2026
  1. 01Establish identityMatch an authenticated scholarly identity to this paper.
  2. 02Submit evidenceIdentify the finding and give a formal mathematical response.
  3. 03Re-evaluateA separate agent checks the response and records a disposition.
Recommended production method

Authenticate with ORCID, then require an exact arXiv match

MathAudit should accept the identity only when ORCID OAuth authenticates the claimant's iD and this exact arXiv paper appears in arXiv's public authority feed for that iD. A matching name alone is not sufficient.

ORCID OAuth and arXiv authority-record lookup are not connected in this local prototype.

Email fallback for papers without a linked ORCID

A production fallback could send a one-time link only when the submitted address matches an independently maintained author-contact allowlist for this paper. MathAudit must return the same message for every address so the form cannot reveal which contacts are on that list.

This demonstration does not send, store, or compare the address.

Structured response preview

This form remains unavailable until production identity verification succeeds. Nothing entered here is submitted.

This panel never establishes authorship in the local prototype. A production result should be described narrowly as an authenticated ORCID match or control of a separately allowlisted author-contact mailbox.