Layered Recursive Compression as a Structural Proof of the Collatz Conjecture (Version 92)

Λεπτομέρειες βιβλιογραφικής εγγραφής
Τίτλος: Layered Recursive Compression as a Structural Proof of the Collatz Conjecture (Version 92)
Συγγραφείς: Kawanishi, Yoshihito
Στοιχεία εκδότη: Zenodo
Έτος έκδοσης: 2025
Συλλογή: Zenodo
Θεματικοί όροι: Collatz Conjecture, Structural Proof, Recursive Compression, Arithmetic Logic, Induction, Number Theory, finite-cover certificate, Lyapunov
Περιγραφή: Update 29/Aug/2025(v94.8-2) Unified notation: accelerated map as “C”, compression map as “D”. Aligned short-window thresholds and documented the minimal vs. sufficient settings. Added the “terminal valuation inheritance” lemma to carry bounds to actual trajectories. Clarified the proof narrative (from sufficient window to monotone envelope to termination). Standardized references (label-based) and cleaned up formatting. Curated artifacts: CSV certificate, verifier script, and published SHA256 for integrity. Update 19/Aug/2025(v94.7.20) Title: Short-Window Anchors and a Finite-Cover Certificate for Collatz (Unconditional) Authors: Yoshihito Kawanishi Version: V94-7-20 Description:“Using short-window thresholds (Θ₂=5, Θ₃=6), a finite-cover certificate at M=8192 (H=27), and a distance potential φ(r)=0.60·d(r), this package provides the paper and machine-checkable artifacts certifying unconditional anchor hitting and subsequent termination. Includes CSV/LP/PNG, verification scripts, and SHA256 checksums.” Update August 2025(v93.2): This update strengthens the structural proof with: Clear formulation of strong induction for all odd integers (Theorem 7) Improved theorem structure and logical flow Enhanced visual diagrams (e.g., Z = 27 compression tree) Expanded glossary and refined definitions Sharper ZFC-based loop exclusion This version replaces V92.3 with a clearer and more rigorous presentation. --- Update July 2025 (v92.3): This version presents the proof in a clearer and more reader-friendly structure, aligned with the expectations of top mathematical journals. --- [Update July 2025] The updated version (v92.1.2) is titled: **"A Structural Proof of the Collatz Conjecture via Recursive Compression"** This reflects the refined formulation and educational emphasis in the final version.- Added full section numbering for journal submission- Improved Glossary (Appendix E) with alphabetized terms- Enhanced structural clarity and notation consistency --- This document presents a complete structural proof of the Collatz ...
Τύπος εγγράφου: report
Γλώσσα: English
Relation: https://zenodo.org/communities/advancedtheoreticalphysicsandmathematics/; https://zenodo.org/records/16991608; oai:zenodo.org:16991608; https://doi.org/10.5281/zenodo.16991608
DOI: 10.5281/zenodo.16991608
Διαθεσιμότητα: https://doi.org/10.5281/zenodo.16991608
https://zenodo.org/records/16991608
Rights: Creative Commons Attribution 4.0 International ; cc-by-4.0 ; https://creativecommons.org/licenses/by/4.0/legalcode
Αριθμός Καταχώρησης: edsbas.AEF91A32
Βάση Δεδομένων: BASE
FullText Text:
  Availability: 0
CustomLinks:
  – Url: https://doi.org/10.5281/zenodo.16991608#
    Name: EDS - BASE (ns324271)
    Category: fullText
    Text: View record from BASE
Header DbId: edsbas
DbLabel: BASE
An: edsbas.AEF91A32
RelevancyScore: 955
AccessLevel: 3
PubType: Report
PubTypeId: report
PreciseRelevancyScore: 954.935607910156
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Layered Recursive Compression as a Structural Proof of the Collatz Conjecture (Version 92)
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Kawanishi%2C+Yoshihito%22">Kawanishi, Yoshihito</searchLink>
– Name: Publisher
  Label: Publisher Information
  Group: PubInfo
  Data: Zenodo
– Name: DatePubCY
  Label: Publication Year
  Group: Date
  Data: 2025
– Name: Subset
  Label: Collection
  Group: HoldingsInfo
  Data: Zenodo
– Name: Subject
  Label: Subject Terms
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Collatz+Conjecture%22">Collatz Conjecture</searchLink><br /><searchLink fieldCode="DE" term="%22Structural+Proof%22">Structural Proof</searchLink><br /><searchLink fieldCode="DE" term="%22Recursive+Compression%22">Recursive Compression</searchLink><br /><searchLink fieldCode="DE" term="%22Arithmetic+Logic%22">Arithmetic Logic</searchLink><br /><searchLink fieldCode="DE" term="%22Induction%22">Induction</searchLink><br /><searchLink fieldCode="DE" term="%22Number+Theory%22">Number Theory</searchLink><br /><searchLink fieldCode="DE" term="%22finite-cover+certificate%22">finite-cover certificate</searchLink><br /><searchLink fieldCode="DE" term="%22Lyapunov%22">Lyapunov</searchLink>
– Name: Abstract
  Label: Description
  Group: Ab
  Data: Update 29/Aug/2025(v94.8-2) Unified notation: accelerated map as “C”, compression map as “D”. Aligned short-window thresholds and documented the minimal vs. sufficient settings. Added the “terminal valuation inheritance” lemma to carry bounds to actual trajectories. Clarified the proof narrative (from sufficient window to monotone envelope to termination). Standardized references (label-based) and cleaned up formatting. Curated artifacts: CSV certificate, verifier script, and published SHA256 for integrity. Update 19/Aug/2025(v94.7.20) Title: Short-Window Anchors and a Finite-Cover Certificate for Collatz (Unconditional) Authors: Yoshihito Kawanishi Version: V94-7-20 Description:“Using short-window thresholds (Θ₂=5, Θ₃=6), a finite-cover certificate at M=8192 (H=27), and a distance potential φ(r)=0.60·d(r), this package provides the paper and machine-checkable artifacts certifying unconditional anchor hitting and subsequent termination. Includes CSV/LP/PNG, verification scripts, and SHA256 checksums.” Update August 2025(v93.2): This update strengthens the structural proof with: Clear formulation of strong induction for all odd integers (Theorem 7) Improved theorem structure and logical flow Enhanced visual diagrams (e.g., Z = 27 compression tree) Expanded glossary and refined definitions Sharper ZFC-based loop exclusion This version replaces V92.3 with a clearer and more rigorous presentation. --- Update July 2025 (v92.3): This version presents the proof in a clearer and more reader-friendly structure, aligned with the expectations of top mathematical journals. --- [Update July 2025] The updated version (v92.1.2) is titled: **"A Structural Proof of the Collatz Conjecture via Recursive Compression"** This reflects the refined formulation and educational emphasis in the final version.- Added full section numbering for journal submission- Improved Glossary (Appendix E) with alphabetized terms- Enhanced structural clarity and notation consistency --- This document presents a complete structural proof of the Collatz ...
– Name: TypeDocument
  Label: Document Type
  Group: TypDoc
  Data: report
– Name: Language
  Label: Language
  Group: Lang
  Data: English
– Name: NoteTitleSource
  Label: Relation
  Group: SrcInfo
  Data: https://zenodo.org/communities/advancedtheoreticalphysicsandmathematics/; https://zenodo.org/records/16991608; oai:zenodo.org:16991608; https://doi.org/10.5281/zenodo.16991608
– Name: DOI
  Label: DOI
  Group: ID
  Data: 10.5281/zenodo.16991608
– Name: URL
  Label: Availability
  Group: URL
  Data: https://doi.org/10.5281/zenodo.16991608<br />https://zenodo.org/records/16991608
– Name: Copyright
  Label: Rights
  Group: Cpyrght
  Data: Creative Commons Attribution 4.0 International ; cc-by-4.0 ; https://creativecommons.org/licenses/by/4.0/legalcode
– Name: AN
  Label: Accession Number
  Group: ID
  Data: edsbas.AEF91A32
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsbas&AN=edsbas.AEF91A32
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.5281/zenodo.16991608
    Languages:
      – Text: English
    Subjects:
      – SubjectFull: Collatz Conjecture
        Type: general
      – SubjectFull: Structural Proof
        Type: general
      – SubjectFull: Recursive Compression
        Type: general
      – SubjectFull: Arithmetic Logic
        Type: general
      – SubjectFull: Induction
        Type: general
      – SubjectFull: Number Theory
        Type: general
      – SubjectFull: finite-cover certificate
        Type: general
      – SubjectFull: Lyapunov
        Type: general
    Titles:
      – TitleFull: Layered Recursive Compression as a Structural Proof of the Collatz Conjecture (Version 92)
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Kawanishi, Yoshihito
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Type: published
              Y: 2025
          Identifiers:
            – Type: issn-locals
              Value: edsbas
            – Type: issn-locals
              Value: edsbas.oa
ResultId 1