Colorful Rings of Partition

2024/09/13 by Oliver Knill, Knill, Oliver
Computer Science · Engineering · #00A35 #11P81 #97A30 #Coding theory and cryptography #FOS: Mathematics #Graph Labeling and Dimension Problems #History and Overview (math.HO) #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.2410.03672

openalex publication_date 2024/09/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We visualize the identity p(n) = sum s(k) p(n-k)/n for the integer partition function p(n) involving the divisor function s, add comments on the history of visualizations of numbers, illustrate how different mathematical fields play together when proving lim p(n)^(1/n)=1 and introduce finite or infinite rings of partitions.

Related

• Elementary formulas for integer partitions
• A combinatorial proof of an identity for the divisor generating function
• Arithmetic Properties of Partitions with 1-colored Even Parts and r-colored Odd Parts
• On the fractal nature of the partition function p(n) and the divisor functions d_i(n)
• The Algorithm Z and Ramanujan's ₁ψ₁ Summation