Pith. sign in

REVIEW 4 minor 11 references

The Redheffer Matrix Parity Problem

T0 review · 0 major / 4 minor · reviewed 2026-07-13 · grok-4.5

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

Pith's one-line read The parity of unit entries in an n-by-n Redheffer matrix is completely settled by closed-form membership in two offset sets.

desk verdict Correct elementary re-packaging of a known parity rule that cleanly recovers the Mendelsohn/Connell closed forms and their OEIS links. read the letter →

arxiv 2607.08962 v1 pith:5KNR3YKG submitted 2026-07-09 math.CO

Anthony Hernandez This is my paper · ORCID
classification math.CO MSC 05A1511A2511B83
keywords RedheffermatrixparityofunitentriesoffsetpartitiongeneratingfunctionsConnellsequenceMendelsohndivisorfunction
topics The Collatz Conjecture
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 solves the Redheffer Matrix Parity Problem: decide for which n the number of 1s in the n-by-n Redheffer matrix is even or odd. The count U(n) is first reduced, via the known fact that the divisor function is odd only on squares, to a simple congruence that depends only on the offset j of n above the largest square m^{2} ≤ n. Even offsets form a set J and odd offsets form a complementary set K; U(n) is odd precisely on J and even on K. The author constructs these sets from a trivariate generating function that tracks n, the block index m, and the offset j, then projects the series by a linear functional that extracts the parity of j. Partial-sum analysis of the resulting one-variable series yields an explicit indicator for membership in J or K, and closed-form formulas for the successive elements of each set. The same formulas recover the classical Connell and Mendelsohn sequences and their OEIS entries, giving a uniform generating-function explanation of both the parity rule and those sequences.

What carries the argument

The trivariate generating function F(x;z,w)=∑ x^{n} z^{m} w^{j} together with the linear projection φ that applies the functional L_w(P)=P(0)-P(-1) to the w-variable; the resulting series G(x) and its partial-sum series H(x) serve as membership indicators for the parity classes J and K.

What would settle it

Compute U(n) directly for successive n by counting 1s in the Redheffer matrix and check whether the resulting parities match the closed-form lists j(n) and k(n) for all n up to a few thousand; any single mismatch falsifies the claim.

Watch

Extended reading notes

Core claim

U(n) is odd if and only if n belongs to the even-offset class J, and even if and only if n belongs to the odd-offset class K; the successive elements of these classes are given by the closed forms j(n)=2n-⌊(√(8n+1)-1)/2⌋ and k(n)=2n+1+⌈(√(8n+9)-1)/2⌉. Consequently the parity of every Redheffer matrix is completely determined by evaluating one of these two formulas.

Load-bearing premise

The argument treats one particular linear functional that annihilates squares and alternates on positive offsets as the unique canonical parity extractor; any other functional with the same annihilation and alternation properties would produce an isomorphic but differently scaled series.

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.

Referee Report

0 major / 4 minor

Summary. The paper determines the parity of the number U(n) of unit entries in the n imes n Redheffer matrix. After recalling that U(n)=n-1+∑_{s=1}^n d(s) and that ∑ d(s)≡⌊√n⌋ (mod 2), it obtains the Offset Rule U(n)≡j+1 (mod 2) where n=m^{2}+j with m=⌊√n⌋ and 0≤j≤2m. The natural numbers are partitioned into blocks I_m={m^{2},…,(m+1)^{2}-1} via the bijection f(n)=(⌊√n⌋,n-m^{2}). A trivariate generating function F(x;z,w) packages (n,m,j); a linear projection φ that extracts the parity of j produces a univariate series G(x) whose coefficients a(n) vanish on squares and equal (-1)^{j-1} otherwise. Partial sums H(n)=∑_{k=0}^n a(k) take only the values 0 or 1 according as the offset is even or odd, and satisfy U(n)≡1-H(n) (mod 2). The sets J (even offsets) and K (odd offsets) are thereby identified with the zero and one sets of H; closed forms for their enumerating sequences j(n) and k(n) are obtained by counting elements of J and K up to x and inverting the resulting triangular-number inequalities. The same sequences recover the classical Connell and Mendelsohn sequences, yielding an OEIS interpretation of the parity classes.

Significance. The parity conclusion itself is elementary and already known; the paper’s contribution is a self-contained generating-function construction that derives the offset classes J and K rather than postulating them, supplies explicit closed forms for their enumerators, and recovers the Connell/Mendelsohn sequences as corollaries. All steps are formal power-series identities or direct block-wise counting; there are no free parameters, no numerical fitting, and no external tables. The explicit formulae j(n)=2n-⌊(√(8n+1)-1)/2⌋ and k(n)=2n+1+⌈(√(8n+9)-1)/2⌉ together with the congruence U(n)≡1-H(n) (mod 2) give a complete, elementary solution of the stated problem and a clean link to classical integer sequences.

minor comments (4)
  1. The lengthy analytic discussion of absolute convergence and the degeneracy locus of F (Lemmas 5.2–5.4 and Remarks 5.5–5.6) is not used in the subsequent combinatorial arguments; a short remark that the series is formal would suffice and would improve readability.
  2. The claim that L_w(P)=P(0)-P(-1) is “the canonical” parity extractor (Lemma 6.1 and surrounding text) is stronger than needed; any functional that annihilates squares and alternates on positive offsets yields an isomorphic indicator of the same partition. Softening the language would avoid an unnecessary uniqueness assertion.
  3. Several typographical inconsistencies appear (e.g., “Provenance” vs. “provenance”, missing spaces around operators, and the arXiv date “9 Jul 2026”). A careful copy-edit pass is recommended.
  4. The OEIS links and the historical remarks on Connell’s problem are welcome, but the precise relation “Connell = K ∪ {squares}” could be stated more prominently in the abstract or introduction for readers primarily interested in the sequence connection.

Circularity Check

1 steps flagged · score 1.0 of 10

No significant circularity: parity of U(n) follows from elementary divisor parity and block counting; J/K and closed forms are constructed, not assumed or fitted.

  1. self definitional [Section 6, Lemma 6.1 and surrounding prose (pp. 4–5, 12)]
    "The linear functional L_w(P)=P(0)-P(-1) is the canonical parity extractor in the w–coordinate: it annihilates the square (j=0) and maps even/odd offsets to -1/+1, respectively. Thus φ is not an ad hoc maneuver; it is the natural projection…"

    The paper asserts uniqueness/canonicity of L_w by listing the values it must take on the monomial basis (annihilate j=0, alternate on j≥1). Those values are precisely the parity indicators already fixed by the Offset Rule; any other functional with the same values produces the identical a(n). The claim of canonicity is therefore definitional packaging rather than an independent derivation, but it is not load-bearing for the final closed forms or the parity characterization of U(n).

full rationale

The derivation is self-contained and elementary. From the classical fact that d(s) is odd iff s is square one obtains U(n) ≡ n-1+m (mod 2) with m=⌊√n⌋; the offset decomposition n=m^{2}+j then yields the Offset Rule U(n)≡j+1 (mod 2) by direct case analysis on the parity of m. The sets J and K are defined from that rule (even/odd j) and refined from the bijective partition I_m. The trivariate series F and the functional L_w(P)=P(0)-P(-1) merely package the same offset parity into coefficients a(n); the partial sums H(n) recover the indicator of K by block-wise geometric summation of the alternating sequence, and the closed forms for j(n),k(n) are obtained by counting |J_≤x| (resp. |K_≤x|) and solving the resulting quadratic inequalities for the triangular-number index m. No parameter is fitted to data, no external uniqueness theorem is imported, and the Connell/Mendelsohn sequences appear only as OEIS corollaries after the closed forms are already derived. The sole minor self-referential note is the author’s remark that L_w is “canonical,” which is not load-bearing: any other functional annihilating squares and alternating on positive offsets yields an isomorphic partition. Score 1 reflects that cosmetic claim only.

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

The paper rests entirely on standard formal power series, the elementary arithmetic of the divisor function, and the unique writing of each natural number as m^{2}+j. No free parameters are fitted; the only ‘invented’ objects are the auxiliary series and the two sets that the paper itself constructs and then enumerates.

assumptions (3)
  • standard math d(s) is odd if and only if s is a perfect square
    Classical pairing of divisors; used in the Introduction to reduce U(n) mod 2 to the number of squares ≤ n.
  • standard math Every n admits a unique writing n=m^{2}+j with m=⌊√n⌋ and 0≤j≤2m
    Immediate from the definition of the floor function; defines the blocks Im and the map f.
  • standard math The ring of formal power series C[[x,z,w]] admits the usual algebraic operations and coefficient extraction
    Background for the entire generating-function apparatus of Sections 5–9.
invented entities (3)
  • trivariate generating function F(x;z,w)
    purpose: Packages the triple (n,m,j) so that a linear projection can extract offset parity
    Defined in equation (4); the subsequent analysis lives inside this series.
  • linear functional Lw and projection φ
    purpose: Canonical parity extractor that collapses F to the univariate series G whose partial sums detect membership in J versus K
    Introduced in Lemma 6.1; uniqueness is claimed relative to the listed values on monomials.
  • sets J and K (even- and odd-offset classes) independent evidence
    purpose: The two sets whose membership decides the parity of U(n)
    Defined in (3) and refined in Section 9; their ordered enumerations are the main output.

how reviews work

0 comments
Cite this review

Pith. "Pith review of The Redheffer Matrix Parity Problem." pith.science (2026). https://pith.science/paper/5KNR3YKG

@misc{pith2026260708962,
  author       = {Pith},
  title        = {Pith review of: The Redheffer Matrix Parity Problem},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/5KNR3YKG}},
  note         = {Machine review of arXiv:2607.08962}
}
read the original abstract

A solution determining the parity of unit entries in Redheffer matrices is given. The solution solves the problem by enumerating two disjoint sets from which set membership determines parity. The solution framework uses generating functions.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

11 extracted references

  1. [1]

    L. V. Ahlfors,Complex Analysis, 2nd ed., McGraw-Hill, 1979

    1979

  2. [2]

    Mikl´ os B´ ona,Introduction to Enumerative and Analytic Combinatorics, Chap- man and Hall/CRC, 2015

    2015

  3. [3]

    Reidel Publishing Company, 1974

    Louis Comtet,Advanced Combinatorics: The Art of Finite and Infinite Ex- pansions, D. Reidel Publishing Company, 1974

    1974

  4. [4]

    Connell,Elementary Problem E1382, Amer

    Ian G. Connell,Elementary Problem E1382, Amer. Math. Monthly,66(1959), no. 8, 724

    1959

  5. [5]

    Connell and Andrew Korsak,Solution to Elementary Problem E1382, Amer

    Ian G. Connell and Andrew Korsak,Solution to Elementary Problem E1382, Amer. Math. Monthly,67(1960), no. 4, 380

    1960

  6. [6]

    Philippe Flajolet and Robert Sedgewick,Analytic Combinatorics, Cambridge University Press, 2009

    2009

  7. [7]

    D. E. Iannucci and D. Mills-Taylor,On Generalizing the Connell Sequence, Journal of Integer Sequences,2(1999), Article 99.1.7

    1999

  8. [8]

    OEIS Foundation Inc.,The On-Line Encyclopedia of Integer Sequences, pub- lished electronically athttps://oeis.org, 2026

    2026

Show all 11 references
  1. [9]

    Eine explizit l¨ osbare Optimierungsaufgabe

    R. Redheffer, “Eine explizit l¨ osbare Optimierungsaufgabe” (in German), in Numerische Methoden bei Optimierungsaufgaben, Band 3 (Tagung, Math. Forschungsinst., Oberwolfach, 1976), pp. 213–216, Internat. Ser. Numer. Math., Vol. 36, Birkh¨ auser, Basel, 1977. THE REDHEFFER MATR...

    1976

  2. [10]

    Stanley,Enumerative Combinatorics, Volume 1, 2nd ed., Cam- bridge University Press, 2011

    Richard P. Stanley,Enumerative Combinatorics, Volume 1, 2nd ed., Cam- bridge University Press, 2011

    2011

  3. [11]

    G. E. Stevens,A Connell-Like Sequence, Journal of Integer Sequences,1 (1998), Article 98.1.4. Email address:anthony@anthony-hernandez.com

    1998

Pith tools

Reviewed July 13, 2026 · model on record in the stance chip above.