Skip to content
DraconiticResearch
Search Sources API
197,768 studies31 sourcesUpdated 11 min ago
PreprintCC BY 4.0arXiv

The Mirror Theorem: Central Incidence Saturation in Keith Recurrences

Abstract

Keith numbers are integers that reappear in sliding-window recurrences generated from their own digits. We introduce Keith mirrors, a subclass defined by saturation at the center of the recurrence's incidence profile. For an even index m, let C_d(m) denote the sum of the two central incidence counts. We prove that the central deficit m-C_d(m) is exactly the distance from m to the interval [2d,2d+2], which forces every Keith mirror of order d>=3 in base B>=3 to return at 2d+2. A digit identity and analytic capacity bounds then reduce the classification to finitely many cases. Exact enumeration, independently checked against the original recurrence and incidence definition, yields precisely 35 mirrors of order at least three, while order two consists of two explicit infinite families. We also classify exactly eight cross-base triple alignments satisfying R=C=x_1+x_d and record the conditional reconstruction property induced by incidence symmetry.

Related

  1. Saturation on compact manifolds via Stone-Weierstrass type theorem, and forced nonlinear PDEs
    Rémi Buffe, Alessandro Duca, Hugo Parada
    HALPreprintCC BY 4.0Full textAnalysis & PDEsOptimisation & controlHALarXiv
  2. Lower bounds for some value sets over finite fields: incidence geometry and Bourgain's group expansion theorem
    Xiyu Hu
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
  3. A Functional Central Limit Theorem For A Rank-Killed Particle System With Persistent Copies
    Ewan Cameron
    HALPreprintPublisher termsFull textStatisticsHAL
  4. A central limit theorem for the degree of a random product of Cremona transformations
    Nguyen-Bac Dang, Giulio Tiozzo
    Indiana University Mathematics JournalPeer-reviewedHAL deposit licenceFull textDynamical systemsHAL
  5. A Central Limit Theorem for Coprime Pair Counts in Randomly Translated Disks
    Xin Hang Ji
    arXivPreprintarXiv licenceFull textAlgebra & number theoryProbabilityarXiv
BibTeX
@misc{zamponi2026mirror,
  title = {{The Mirror Theorem: Central Incidence Saturation in Keith Recurrences}},
  author = {Federico Ignacio Zamponi},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.10557},
  eprint = {2610.10557},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.10557},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - The Mirror Theorem: Central Incidence Saturation in Keith Recurrences
AU  - Federico Ignacio Zamponi
PY  - 2026
DA  - 2026/10/01
PB  - arXiv
DO  - 10.48550/arxiv.2610.10557
UR  - https://arxiv.org/abs/2610.10557
AB  - Keith numbers are integers that reappear in sliding-window recurrences generated from their own digits. We introduce Keith mirrors, a subclass defined by saturation at the center of the recurrence's incidence profile. For an even index m, let C_d(m) denote the sum of the two central incidence counts. We prove that the central deficit m-C_d(m) is exactly the distance from m to the interval [2d,2d+2], which forces every Keith mirror of order d>=3 in base B>=3 to return at 2d+2. A digit identity and analytic capacity bounds then reduce the classification to finitely many cases. Exact enumeration, independently checked against the original recurrence and incidence definition, yields precisely 35 mirrors of order at least three, while order two consists of two explicit infinite families. We also classify exactly eight cross-base triple alignments satisfying R=C=x_1+x_d and record the conditional reconstruction property induced by incidence symmetry.
ER  -