Slopes of modular forms and the Ghost conjecture

Eunsu Hur

REVIEW 3 major objections 4 minor 1 cited by

Slopes of modular forms and the Ghost conjecture

T0 review · 3 major / 4 minor · reviewed 2026-08-06 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Ghost conjecture yields a slope-predicting algorithm

desk verdict A concrete but unverifiable-from-abstract refinement of Buzzard's conjecture; the determinacy question is the load-bearing point. read the letter →

arxiv 2508.02761 v1 pith:IIEMZ5BX submitted 2025-08-03 math.NT

Eunsu Hur This is my paper · ORCID

classification math.NT MSC 11F3311F8011F11

keywords modularformsslopesequenceGhostconjectureoverconvergentColeman-MazureigencurveGaloiscomponentsp-adicslopesalgorithm

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper claims that the full slope sequence of modular forms with fixed Galois components can be computed from a finite initial segment of that sequence. The claim is presented as a refined version of the 2005 conjecture cited as [Buz05], and the computation is carried out by an explicit algorithm. The algorithm relies on the Ghost conjecture and on results from the paper cited as arXiv:2302.07697. If correct, the determinacy behind the algorithm also explains regularities that have been observed in Coleman-Mazur eigencurves.

What carries the argument

The load-bearing object is the Ghost conjecture (from arXiv:1710.01572), which predicts the slopes of $U_p$ through a combinatorial 'ghost series' rather than by direct computation of Hecke eigenvalues. The results of arXiv:2302.07697 supply the structural input the algorithm needs: a determinacy statement that fixes the full slope sequence once a finite prefix is known. The algorithm converts that determinacy into a practical extrapolation rule, producing later entries of the slope sequence from the initial segment.

What would settle it

Compute, for a fixed Galois component, the first $N$ slopes by brute force and run the paper's algorithm: if the algorithm's output disagrees with the true slope at any later index, the refined conjecture fails. Alternatively, exhibit two modular form spaces with the same required finite initial segment of slopes but different later slopes.

Watch

Extended reading notes

Core claim

The paper's central claim is that, for each fixed Galois component, the slope sequence of the operator $U_p$ on modular forms is determined by its first few entries through a structural symmetry. Concretely, the paper gives an algorithm that takes that finite initial segment as input and outputs the rest of the slope sequence. This is a stronger, refined version of the conjecture of [Buz05], and it is derived from the Ghost conjecture together with the results of arXiv:2302.07697. The paper further states that these symmetries have potential implications for unexplained symmetries in many Coleman-Mazur eigencurves.

Load-bearing premise

The full slope sequence is uniquely determined by a finite initial segment, where that determinacy is inherited from the Ghost conjecture; if the cited ghost results do not apply to a given Galois component, the algorithm's later entries may not match the true slopes.

Editorial extensions

If this is right

The full slope sequence for a fixed Galois component can be produced from a finite initial segment, so checking the first few slopes suffices to determine all of them.
The refined conjecture extends the 2005 conjecture of [Buz05], covering cases where slopes are constrained by Galois components.
The same symmetry is proposed as an explanation for regularities observed across many Coleman-Mazur eigencurves.
The algorithm gives a computational shortcut for generating slope sequences that previously required step-by-step computation.

Reading between the lines

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

By analogy, the same finite-prefix determinacy may hold for other families of automorphic forms (for instance Hilbert modular forms or forms on quaternion algebras), giving testable predictions beyond the paper's stated scope.
The algorithm could be run on cases not yet covered by the cited ghost results; mismatches would pinpoint exactly where the Ghost conjecture needs refinement.
The symmetry suggests slope sequences may be governed by a combinatorial structure (such as an automaton or a self-similar sequence) that encodes arithmetic data in a purely combinatorial way.

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

You should know this paper from the abstract alone: it gives an algorithm to recover a slope sequence of modular forms with fixed Galois components from a finite initial segment, and states this as a refined version of Buzzard's conjecture. On its face it is a clean, plausible idea that builds on the Ghost Conjecture and on arXiv:2302.07697. The abstract is honest about the dependency, which I take as a good sign.

What is genuinely new: the algorithm and the refined conjecture itself. If the algorithm works, it gives a computational handle on slope sequences that were previously only conjecturally understood. That is a real step within the active Ghost Conjecture program, though not a paradigm shift.

Where the soft spot sits: the correctness of the algorithm hinges on finite determinacy — that a slope sequence is uniquely fixed by its first few entries. The abstract attributes this to symmetries from the Ghost Conjecture and arXiv:2302.07697, but does not say whether those are unconditional theorems or themselves conditional on the Ghost Conjecture. That is not a flaw in the mathematics, but it is a genuine gap in what the abstract tells us. If those results are conditional, then every computed slope inherits the condition, and the algorithm only produces a conditional prediction. I also do not see how many initial entries are needed or what hypotheses on level, weight, and Galois component are assumed. The full text may very well address all of this.

The reader's low soundness score is fair only because evidence is absent, not because any flaw is apparent. The circularity concern is worth keeping in mind — if the algorithm's output is compared against the very conjectures it relies on, you have to check it is doing independent computation. But that is a specul a

Referee Report

3 major / 4 minor

Summary. The paper (arXiv:2508.02761) claims to give an algorithm that computes the complete slope sequence of modular forms with fixed Galois components from a finite initial segment of that sequence, thereby refining a conjecture of Buzzard (referenced as [Buz05]). The algorithm is said to rely on results from arXiv:2302.07697 concerning the Ghost conjecture of arXiv:1710.01572, and the abstract also suggests potential implications for unexplained symmetries in Coleman-Mazur eigencurves. The manuscript as provided consists only of the abstract; no mathematical formulation, proof, algorithm pseudocode, or computational data is included.

Significance. If the claimed algorithm is correct and its underlying determinacy statement is valid, this would be a valuable contribution to the study of modular form slopes, providing a refined prediction that could guide computational exploration and clarify structural phenomena in eigencurves. The paper builds on substantial prior work, and the proposed refined conjecture is a natural and interesting strengthening of Buzzard's conjecture. The strength of the paper is its direct engagement with a central conjecture in the area. However, the abstract alone provides no verifiable evidence: no theorem statements, no proofs, no algorithm specification, and no data. Consequently, the significance cannot be assessed beyond the general interest of the announced claim.

major comments (3)

[Abstract] The correctness of the algorithm rests on the assertion that the entire slope sequence is uniquely determined by its first few entries, but the abstract does not state this as a theorem or conjecture with precise hypotheses. Specifically, the paper must state whether the cited results (arXiv:2302.07697 on the Ghost conjecture) are unconditional theorems or are themselves conditional on the Ghost conjecture; if they are conditional, then the algorithm's output is conditional, and the claimed refined conjecture would not constitute independent evidence. Please provide a precise finite-determinacy statement, including the required length of the initial segment and the allowed levels, weights, and Galois components, and specify the status (conditional or unconditional) of the results quoted from arXiv:2302.07697.
[Abstract] The abstract provides no description of the algorithm itself. There is no input/output specification, no list of parameters, no description of how the symmetries inherited from the Ghost conjecture are used to extend a finite initial segment, no termination criterion, and no complexity estimate. Without these details, the claim "We give an algorithm" cannot be checked for correctness or reproducibility. At minimum, the paper should include a precise algorithmic procedure and a proof that any two extensions of the given initial segment coincide.
[Abstract] The abstract claims "potential implication to unexplained symmetries in many Coleman-Mazur eigencurves" but provides no illustrative example or computational validation. A single nontrivial example where the algorithm reconstructs a known slope sequence, or a comparison of its predictions with unconditionally computed slopes in a previously unknown case, would materially strengthen the plausibility of the determinacy claim and would give the reader a concrete anchor for the algorithm's behavior.

minor comments (4)

[Abstract] There is a typographical error: "axXiv" should be "arXiv".
[Abstract] The citation "[Buz05]" is mentioned without a corresponding reference entry in the abstract; if the full manuscript contains a bibliography, the reference must be included there.
[Abstract] The phrase "from its first few entries" is vague; the paper should specify the required number of entries and how that number depends on weight, level, and Galois component.
[Abstract] The abstract uses the terms "slope sequence" and "fixed Galois components" without definition; a brief clarification would make the manuscript accessible to a wider number-theoretic audience.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity identifiable from the abstract; no equation-level reduction is shown.

full rationale

The available manuscript is only an abstract, so there are no equations or derivation steps to compare. The abstract announces an algorithm that computes slope sequences from finitely many initial entries and states that it uses results from arXiv:2302.07697 on the Ghost conjecture. This is a citation dependency, but the abstract does not show that the algorithm's output is defined in terms of the very conjecture it refines, nor does it exhibit any fitted parameter being renamed as a prediction. Without access to the paper's internal definitions and proofs, no specific circular step can be quoted and exhibited as required. The reliance on prior work, even by the same author, is not itself circular unless the cited result is shown to be equivalent to the target claim by construction. That demonstration is absent here, so the appropriate finding is no significant circularity.

Assumptions & free parameters 0 free parameters · 3 assumptions · 0 invented entities

Only the abstract was available. The central claim rests on two conjectural frameworks: Buzzard's and the Ghost conjecture. No free parameters or invented entities are visible at the abstract level.

assumptions (3)

domain assumption Buzzard's conjecture [Buz05]
The paper explicitly refines this conjecture; the algorithm's correctness is evaluated relative to this conjecture.
domain assumption Ghost conjecture (arXiv:1710.01572) and the results of arXiv:2302.07697
The paper says it uses these results; if they are unproven or incorrectly interpreted, the algorithm lacks support.
standard math Standard theory of modular forms and Hecke operators
Background assumed without proof in the field.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Slopes of modular forms and the Ghost conjecture." pith.science (2026). https://pith.science/paper/IIEMZ5BX

@misc{pith2026250802761,
  author       = {Pith},
  title        = {Pith review of: Slopes of modular forms and the Ghost conjecture},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/IIEMZ5BX}},
  note         = {Machine review of arXiv:2508.02761}
}

read the original abstract

We give an algorithm to compute the slope sequence of modular forms with fixed Galois components from its first few entries, which is a refined version of the conjecture of [Buz05]. We use the results of arXiv:2302.07697 on the ghost conjecture from axXiv:1710.01572. These symmetries in slope sequences have potential implication to unexplained symmetries in many Coleman-Mazur eigencurves.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

The Architecture of Trust: A Framework for AI-Augmented Real Estate Valuation in the Era of Structured Data
cs.CY 2025-08 unverdicted novelty 4.0 of 10

A framework for AI-augmented real estate valuation built around the 2026 UAD 3.6 data standard, arguing that structured data and AI together can transform appraisal if paired with professional oversight.

Pith tools

Reviewed August 6, 2026 · model on record in the stance chip above.