arXiv:2606.18674v1

Generalization of Selberg's 3/163/16 theorem for geometrically finite thin subgroups of SO(n,1)\operatorname{SO}(n, 1)

Pratyush Sarkar

math.DSmath.NTmath.SP37A1722E4037A2537C30

Abstract

Let ΓΓ be a geometrically finite thin subgroup of an arithmetic lattice Γ0<G:=SO(n,1)Γ_0 < G := \operatorname{SO}(n, 1) and consider the congruence covers of Γ\GΓ\backslash G. In the breakthrough work of Bourgain-Gamburd-Sarnak, the expansion machinery was used to establish a uniform spectral gap in the setting (G,Γ0)=(SL2(R),SL2(Z))(G, Γ_0) = (\operatorname{SL}_2(\mathbb{R}), \operatorname{SL}_2(\mathbb{Z})) when the critical exponent satisfies δΓ>12δ_Γ> \frac{1}{2}. The main applications are affine sieve for ΓΓ-orbits and uniform resonance-free half-planes for the resolvent of the Laplacian. These results were generalized in subsequent works by Mohammadi-Oh, Oh-Winter, the author, and Edwards-Oh. Yet, the region δΓ(12,n2]δ_Γ\in \bigl(\frac{1}{2}, n - 2\bigr] for n3n \geq 3 remains to be treated when there are cusps. The purpose of this paper is to fill in this gap in the literature. The difficulty lies in working with a countably infinite coding due to the presence of cusps. In particular, we incorporate new tools to prove the Zariski density and full trace field properties of the return trajectory subgroups.

AI-generated audit

Audit summary

Audited against arXiv v1

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 18, 2026
01Statements3 reported findingsCorrect

The uniform spectral-gap and exponential-mixing theorems over congruence covers, together with the affine-sieve and resonance-free applications, are correct under the explicit trace-field and expansion assumptions.

Theorems 1.1 and 1.4Correct

Uniform exponential mixing follows from the stated congruence transfer-operator estimates

Pages 3–7 and Sections 4–9 · Theorems 1.1, 1.4, 4.3, 4.4, and 5.1 · arXiv:2606.18674v1

The symbolic coding separates the finite congruence extension from the countable return dynamics. Expansion of the return-trajectory subgroup controls the small-frequency operators, while the Dolgopyat construction controls large imaginary parameters. The two regimes overlap and give the uniform spectral bounds stated in Theorems 4.3 and 4.4; the renewal/correlation reduction then yields Theorem 1.4 with the dependencies and field restriction printed in its hypotheses.

Theorem 1.6Correct

Affine-sieve bounds over the thin orbit

Page 4 · Section 1.3 · arXiv:2606.18674v1

The uniform congruence mixing estimate supplies the level of distribution required by the cited orbit-counting theorem of Mohammadi–Oh. With the factorization and integrality hypotheses on FF, the combinatorial sieve gives the printed prime-value upper bound and an almost-prime lower bound with a finite saturation number. The external-parabolic exclusion in dimension two and all local conditions remain in the statement.

Theorem 1.7Correct

Uniform resonance-free half-planes

Pages 4–5 · Section 1.3 · arXiv:2606.18674v1

The renewal estimate obtained from Theorem 1.4 enters the Li–Pan resolvent argument with constants uniform over the permitted congruence ideals. The exceptional simple pole at δΓ\delta_\Gamma is retained in the discrete exceptional case, and the separate high-critical-exponent input is invoked only in its stated range. The number-field and square-free restrictions match those in the uniform expansion theorem.

02Proofs1 reported findingCorrect

The coding, algebraic expansion, and Dolgopyat parts supply the two complementary operator estimates, and the final reduction accurately imports the previously established renewal argument.

Theorems 5.1 and 4.4Correct and complete

Expansion and oscillatory cancellation cover all spectral parameters

Sections 5–9 · arXiv:2606.18674v1

The return-trajectory subgroup is shown to be Zariski dense with the required trace field before expansion is invoked. The Dolgopyat proof constructs the contraction operators on the same symbolic Banach spaces and verifies non-local integrability and distortion uniformly. The paper explicitly identifies the earlier renewal theorem used for the nearly verbatim final conversion, and all of that theorem's inputs are established here.

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:2606.18674v1
Authors listed
Pratyush Sarkar
Audit date
August 18, 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.