Pith. Sign in

REVIEW

Explicit bounds for the number of solutions to Roth-type inequalities over adelic curves

Number Theory · Submitted 4 Nov 2026 · 16 references

Pith's verdict: Theorem 1.2 is a clean, well-supported bound that removes height restrictions; the constructive part (Section 5) depends on an unverified claim about adelic curves and is not established in full generality.

T0 · AI review

How this review was made: An AI referee (deepseek/deepseek-v4-flash) read the paper on November 6, 2026 and answered a fixed list of questions about it. T0 is the starting level every paper gets. The levels describe how deeply Pith has checked the paper, never the authors.

  1. T0 AI review An AI read the paper and answered a fixed list of questions.
  2. T1 Audit Automatic checks that the references and files the paper relies on exist and match.
  3. T2 Compute The paper's code or calculations re-run with the same results.
  4. T3 Formal statement The claims written out in a formal math language a computer can read.
  5. T4 Proof Those claims proved, and the proof checked by computer.

How Pith checks papers →

· 2 major objections · 3 minor · Ask about this paper · The compiled record · Read the full review →
Challenge this review Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID2611.06973 (version 1)
Pith IDF7G5D5BN, Pith's permanent record of this paper and its review
CitationGuanHeng Zhao, Yuxi Li. "Explicit bounds for the number of solutions to Roth-type inequalities over adelic curves." arXiv:2611.06973 (2026). https://pith.science/paper/F7G5D5BN
Cite this reviewBibTeX for Pith's review of this paper
Claim paper

Why Pith says this

Highlight any text to comment on it.

Referee report
The paper

The paper claims

This paper proves explicit upper bounds on the number of solutions to Roth-type inequalities over proper adelic curves, eliminating the need for a large-height restriction and providing a constructive quantitative version.

The reading

The paper studies Roth-type Diophantine inequalities over adelic curves, a general framework unifying number fields, function fields, and arithmetic function fields. It establishes two main results. First, Theorem 1.2 provides an explicit upper bound on the number of solutions to a system of Roth-type inequalities, without requiring the solutions to have large height, a restriction present in earlier work. Second, Proposition 5.4 gives a constructive quantitative version of a related inequality system (the Vojta-Dolce-Zucconi system) by replacing a non-constructive compactness extraction with a discrete pigeonhole argument and a finite grid partition, yielding an explicit bound on the number of solutions. These results extend and strengthen previous work by Dolce and others.

What carries the argument

The key machinery consists of three gap principles that give lower bounds on the difference or ratio of heights of solutions: the particle-state gap principle (Corollary 3.3), the wave-state gap principle (Corollary 3.2), and the large-scale gap principle (Proposition 3.11), which relies on the \(h\)-gap property and a theorem of Dolce-Zucconi. The constructive part replaces the compactness-based extraction lemma (Lemma 1.5, due to Vojta) by a discrete pigeonhole argument on a finite grid derived from median values, yielding an explicit finite capacity bound.

Extended reading notes

Core claim

The central discovery is that by combining three gap principles—particle-state, wave-state, and large-scale—with a bootstrapping argument, one can eliminate the large-height condition that previously bounded the admissible range of the parameter \(A\) in the inequality. Theorem 1.2 bounds the number of solutions \(\$\beta$\in K^\times\) to the system (1) by an explicit expression in terms of \(n\), \(\varepsilon\), the heights of the \(\alpha_i\), and the parameter \(A\), with no restriction on \(A\) except \(A\ge 2\). Furthermore, the constructive Proposition 5.4 provides a finite grid on the space of median vectors such that every box contains at most \(N-1\) elements of any \(r\)-separated subsequence, leading to an explicit bound that depends on measure-theoretic covering, equicontinuity, and uniform integrability parameters.

Load-bearing premise

The constructive Proposition 5.4 assumes that the adelic curve satisfies the µ-equicontinuity condition and the uniform integrability condition, and that the functions λ_{β,i} satisfy hypotheses (H1)-(H3). The paper claims that these hold for proper adelic curves by a direct generalization from arithmetic function fields, but the justification is sketchy and does not provide a detailed proof or specific citation.

Editorial extensions

If this is right

  • The explicit bound in Theorem 1.2 applies uniformly to all proper adelic curves, including number fields, function fields, and arithmetic function fields, without case-by-case treatment.
  • The removal of the large-height restriction means that the bound covers all solutions, not just those above an artificial threshold, making the result truly quantitative.
  • The constructive method in Proposition 5.4 shows that finiteness can be proved without invoking compactness, giving a computationally accessible (though potentially large) bound.
  • The technique of combining complementary gap principles may be adaptable to other quantitative Diophantine problems, such as the Schmidt subspace theorem.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The explicit bound in Theorem 1.2, while explicit, depends on constants like \(B(\varepsilon/2)\) that grow rapidly as \(\varepsilon\to 0\); the practical numerical size of the bound is not discussed, but it is likely extremely large for small \(\varepsilon\).
  • The constructive bound from Proposition 5.4 depends on the finite grid size \(M\), which is itself defined in terms of the covering and equicontinuity parameters; the paper does not give a concrete estimate for these parameters for any specific adelic curve, so the bound remains somewhat theoretical.
  • The assumption that the adelic curve satisfy the \(\mu\)-equicontinuity and uniform integrability conditions is known to hold for arithmetic function fields, but for general adelic curves these conditions require verification; the paper's justification that the proof is identical is sketchy and could be considered the weakest link.
Original abstract

In this paper, we provide an upper bound on the number of a special system of Roth-type Diophantine inequalities over proper adelic curves. By refining the technique from previous work, we successfully eliminate the large-height restriction on the solutions. Furthermore, the constraints on the parameters within the inequality are further relaxed. We also give a constructive quantitative generalization of the Vojta-Dolce-Zucconi system, replacing compactness-based extraction by a discrete pigeonhole argument and a finite grid partition, so that the resulting bound has explicit dependence on the relevant parameters.

The compiled record

The paper's own sentences, arranged, kept beside the review and separate from it. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-11-06: 1 request, 3,585 input tokens.

What the abstract itself states, as probabilities: claims first 0.05 · states limitation 0.10 · human participants 0.01 · controlled comparison 0.02 · randomized assignment 0.01 · states quantitative result 0.78 · compares with prior results 0.87 · mentions code or data availability 0.02.

The abstract, sentence by sentence

arXiv listing abstract v1. Results and the main claim are underlined; .

In this paper, we provide an upper bound on the number of a special system of Roth-type Diophantine inequalities over proper adelic curves. By refining the technique from previous work, we successfully eliminate the large-height restriction on the solutions. Furthermore, the constraints on the parameters within the inequality are further relaxed. We also give a constructive quantitative generalization of the Vojta-Dolce-Zucconi system, replacing compactness-based extraction by a discrete pigeonhole argument and a finite grid partition, so that the resulting bound has explicit dependence on the relevant parameters.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 In this paper, we provide an upper bound on the number of a special system of Roth-type Diophantine inequalities over proper adelic curves. contribution 0.73 0.96 0.84 asserted 1.00
s1 By refining the technique from previous work, we successfully eliminate the large-height restriction on the solutions. contribution 0.78 0.95 0.10 asserted 1.00
s2 Furthermore, the constraints on the parameters within the inequality are further relaxed. contribution 0.80 0.87 0.08 asserted 1.00
s3 We also give a constructive quantitative generalization of the Vojta-Dolce-Zucconi system, replacing compactness-based extraction by a discrete pigeonhole argument and a finite grid partition, so that the resulting bound has explicit dependence on the relevant parameters. contribution 0.86 0.95 0.37 asserted 1.00

What kind of paper the classifier reports this is: theoretical result 1.00 · evidence from proof or derivation 1.00.

What was examined, and what was not

sources read
  • arXiv listing abstract v1
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

References

Discussion

Disagree with the review, or know something it missed? Leave a comment, highlight any passage above to comment on it, or challenge this review formally.