Na minha lista:
| Autor principal: | |
|---|---|
| Formato: | Recurso digital |
| Idioma: | inglês |
| Publicado em: |
Zenodo
2025
|
| Assuntos: | |
| Acesso em linha: | https://doi.org/10.5281/zenodo.16993372 |
| Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|
Sumário:
- <p><strong>SUPERSEDED VERSION:</strong> This is an early, exploratory version of this research based on empirical fitting and contained minor errors in the code. This work has been entirely superseded by a new paper that provides a full theoretical derivation. Check it out at <a href="https://zenodo.org/records/17110539">https://zenodo.org/records/17110539</a><br><br>This paper presents a novel computational method for approximating the integer partition function p(n) using central binomial coefficients. The approach is based on systematic analysis of the cube root ratio ∛(C(n,⌊n/2⌋)/p(n)), which reveals underlying polynomial structure amenable to empirical modeling.</p> <p>Key contributions include:</p> <ul> <li>Consistent 0.4-2% accuracy across n ∈ [4, 80,000] spanning five orders of magnitude</li> <li>Discovery of empirical coefficients corresponding to fundamental mathematical constants ln(2)/3, π√6/9, and 1/6 with 99.98-99.996% agreement</li> <li>Superior performance compared to Hardy-Ramanujan approximation, with improvement factors of 13-87× for n ≤ 70,000 (covering 99.9% of practical applications)</li> <li>Numerical stability and implementation simplicity using only elementary functions</li> </ul> <p>The work demonstrates how systematic computational exploration can reveal hidden mathematical structure in classical combinatorial problems while providing practical approximation tools with predictable error characteristics. The remarkable correspondence between fitted coefficients and established mathematical constants suggests deep theoretical relationships warranting further investigation.</p> <p><strong>Keywords</strong>: integer partitions, binomial coefficients, approximation algorithms, mathematical constants, Hardy-Ramanujan formula, computational mathematics</p> <p>---</p> <h3><strong>Files</strong></h3> <p>This upload contains the following files:</p> <ul> <li><em>PartitionFormsPerformanceComparison.py -</em> Python script comparing performance of all our approximation methods against the Hardy-Ramanujan formula</li> <li><em>error_summary.csv</em> - Comprehensive error rate comparison data across all tested ranges</li> <li><em>fig_performance_charts.png</em> - High-resolution performance visualization chart from Figure 1 in the paper.</li> <li><em>cube-root-partition-approximation.pdf</em> - Complete research paper with mathematical framework and results</li> </ul> <h3><strong>Licensing</strong></h3> <ul> <li>Source code (Python script): MIT License </li> <li>All other files): CC Attribution 4.0 International </li> </ul>