REVIEW 2 major objections 5 minor 1 references
The Pulsar Sequence
T0 review · 2 major / 5 minor · reviewed 2026-08-06 · deepseek-v4-flash
Pith's one-line read The paper establishes that the n×n Pulsar puzzle has a unique solution for every n, built explicitly from the Pulsar sequence and its dual.
desk verdict A charming recreational paper with a genuine new sequence, but the uniqueness proof is incomplete: the induction needs a restriction lemma the paper never states. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The central object is the Pulsar sequence, arranged in blocks of sizes 1,2,3,...; the i-th block is a permutation of 1,...,i with the symmetric-sum property that its first and last terms sum to i+1, as do the second and second-to-last, and so on. The induction deletes the first row and the lower part of the first column to obtain an (n−1)×(n−1) puzzle, adds 1 to all circled entries, and uses the sequence's block symmetry to fill the top row so that the grid becomes a Latin square and the circle-count rule continues to hold.
What would settle it
Exhaustively enumerate all valid completions of the 8×8 or 10×10 Pulsar puzzle under the circle rule; if any completion differs from the Pulsar/dual filling described in Theorem 1, the uniqueness claim is false.
Extended reading notes
Core claim
Theorem 1 states that the n×n Pulsar puzzle has one and only one solution. In that solution, the circled cells, read as a spiral from the center outward, contain the dual of the Pulsar sequence (each term x replaced by n+1−x), and the uncircled cells, also read from the center, contain the Pulsar sequence itself. A stronger property holds as well: in every row and column, every circled digit is larger than every uncircled digit. The proof is by induction, building the n×n solution from the (n−1)×(n−1) solution by adding 1 to the circled entries and completing the removed row according to the symmetric-sum rule of the sequence.
Load-bearing premise
The induction assumes that deleting the first row and the remainder of the first column from any solution of the n×n puzzle leaves a smaller puzzle that still obeys the same circle-count rule; the paper constructs a completion but does not prove that a hypothetical other solution must reduce this way.
Editorial extensions
If this is right
- For every n≥2, a Pulsar puzzle of size n exists and has exactly one solution, so the family of such puzzles is infinite and uniformly solvable.
- A solution can be written down directly from the first n(n+1)/2 terms of the sequence, without any search or backtracking.
- Every solution inherits the circled-exceeds-uncircled dominance in each row and column, a structural feature stronger than the bare Latin-square rule.
- The n×n solution embeds the (n−1)×(n−1) solution as a subgrid, with circled entries shifted upward by one, showing the whole family nests self-similarly.
Reading between the lines
- If the theorem is correct, the Pulsar sequence may be characterizable purely by its block-symmetric-sum definition, independent of puzzles; proving that such a sequence is unique would settle the sequence's own structure.
- The paired-spiral construction suggests a general pattern for building Latin squares from any sequence whose blocks have the symmetric-sum property, not just this particular one.
- A natural next step is to test the unique-solution claim computationally for moderately large n (for example n=10 or n=12) to check the induction's restriction assumption before seeking a full proof of it.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper introduces the Pulsar sequence, a sequence of positive integers presented in blocks of increasing length, and claims that it governs the unique solutions of an infinite family of n×n Latin-square puzzles (“Pulsar puzzles”). The main result (Theorem 1) asserts that for every n, the n×n Pulsar puzzle has a unique solution, in which the circled spiral contains the dual of the Pulsar sequence and the uncircled spiral contains the Pulsar sequence, and every circled entry exceeds every uncircled entry in the same row or column. The proof is by induction on n, constructing the n-solution from the (n−1)-solutions of two reduced subpuzzles.
Significance. If the theorem is correct, the paper presents a charming and unexpected connection between a self-similar spiral puzzle and a sequence with a symmetric-sum structure. The manuscript is clearly written, and the construction is explicit and easy to follow. The claimed result is falsifiable and the proof is mostly self-contained. However, the uniqueness part of the proof has a load-bearing gap, so the central claim is not yet established as written.
major comments (2)
- [Proof of Theorem 1, paragraph beginning “Removing those gives us an (n − 1) × (n − 1) Pulsar puzzle P′”] The induction hypothesis is applied to P′ as an independent puzzle, but the manuscript does not prove that an arbitrary solution of P restricts to a solution of P′ on the subgrid obtained by deleting the first row and the remainder of the first column. Although the deleted first row is all circled and contains each digit 1,...,n exactly once, the remaining subgrid need not be a Latin square of order n−1: its uncircled cells may contain the value n, and subtracting 1 from circled entries (the inverse of the construction's step) can introduce duplicate values in a row or column. Thus the circle-count condition alone does not make the restricted grid a valid P_{n−1} puzzle, and the IH cannot be applied to an arbitrary solution. The induction as written only proves uniqueness among solutions that agree with the constructed solution on this interior subgrid.
- [Proof of Theorem 1, paragraph beginning “Removing instead P’s first and last rows”] The same restriction issue afflicts the second reduction P′′. The manuscript uses the IH on P′′ without proving that every solution of P induces a solution of P′′ after the stated deletion and circled/uncircled swap. Without restriction lemmas for both reductions, the uniqueness claim of Theorem 1 is not proven for arbitrary Latin-square solutions of P.
minor comments (5)
- [Block display of the Pulsar sequence] The displayed 8th block of the Pulsar sequence, “8, 2, 6, 5, 6, 3, 7, 1”, contains two 6's and omits 4, and it violates the stated symmetric sum property (a4+a5 = 11, not 9); this appears to be a typo, but it should be corrected in both the abstract and the block display.
- [n = 5 example] In the n=5 example, the uncircled spiral is filled with a list of 15 terms, but the 5×5 puzzle has only 10 uncircled cells; the uncircled spiral should contain only the first n−1 blocks of the Pulsar sequence (10 terms), not the first n blocks.
- [Definition of the Pulsar sequence] The Pulsar sequence is never formally defined independently of the puzzle; the property that the i-th block satisfies a1+ai = a2+a_{i-1} = ... = i+1 does not determine a unique sequence. The induction proof implicitly supplies a recursive definition, and the manuscript would benefit from stating it explicitly.
- [Proof of Theorem 1, circled-entry transformation] In the proof, the chain “(((x_i)_{n-1})_{n-1})_n = (x_i)_{n-1}+1” is needlessly complex; the identity (x_i)_n = (x_i)_{n-1}+1 is immediate from the definitions and should be written directly.
- [Description of the second reduction P′′] The description of P′′ as obtained by “removing P's first and last rows” does not, by itself, yield an (n−1)×(n−1) grid; the exact deletion (including any column removal) should be specified in the text or the figure.
Circularity Check
No circularity: the induction constructs the Pulsar sequence rather than presupposing it.
full rationale
The derivation is an inductive construction, not a fit or a self-citation chain. Theorem 1 is proved by taking the unique (n-1)-solution, adding 1 to circled entries, filling the uncircled spiral from the corresponding Pulsar block, and showing the top row is forced by Latin-square completion; the symmetric-sum property is then verified. The Pulsar sequence is introduced with explicit initial terms and a block property, and the proof builds each new block instead of assuming it, so the description of the solution in terms of the sequence is not equivalent to an input by construction. There are no load-bearing self-citations (the only reference is a YouTube video) and no fitted parameter called a prediction. Two non-circular correctness issues are noted for completeness. First, the displayed eighth block '8,2,6,5,6,3,7,1' repeats 6 and omits 4, so the infinite sequence as written is not well-defined; the induction, if repaired, would determine the correct block. Second, the uniqueness argument's step 'Removing those gives us an (n-1)x(n-1) Pulsar puzzle P′' does not by itself prove that an arbitrary solution of P restricts to a solution of P′; the standalone uniqueness of P′ does not force the restriction of an arbitrary solution to satisfy the circle-count rule. These gaps affect the soundness of the induction, but they are logical gaps rather than circular reductions, so they do not change the circularity score.
Assumptions & free parameters
assumptions (3)
- domain assumption The rule of the Pulsar puzzle: a digit in a circled cell equals the total number of circled cells in the grid containing that digit.
- standard math A Latin square of order n contains each integer 1 through n exactly once in every row and column.
- ad hoc to paper Deleting the first row and the remainder of the first column from an n×n Pulsar puzzle yields an (n-1)×(n-1) Pulsar puzzle rotated 90 degrees; a second deletion involving first and last rows yields another (n-1)×(n-1) puzzle.
invented entities (1)
-
Pulsar sequence
Cite this review
Pith. "Pith review of The Pulsar Sequence." pith.science (2026). https://pith.science/paper/QTA6SNJ4
@misc{pith2026250714701,
author = {Pith},
title = {Pith review of: The Pulsar Sequence},
year = {2026},
howpublished = {\url{https://pith.science/paper/QTA6SNJ4}},
note = {Machine review of arXiv:2507.14701}
}
read the original abstract
A sequence of positive integers is introduced, that is proved to simultaneously solve an infinite family of related puzzles, one of which was recently featured on the popular YouTube sudoku channel \emph{Cracking the Cryptic}.
Reference graph
Works this paper leans on
-
[1]
[1] The Sudoku Discovery Of The Decade: The Sequel!!!, published 7/17/2025, https://www.youtube.com/watch?v=uymIHULB12c. 4
work page 2025
Reviewed August 6, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.