Generating New Partition Identities via a Generalized Continued Fraction Algorithm

2022/12/05 by Wael Baalbaki, Baalbaki, Wael, Thomas F. Garrity +1
Computer Science · Mathematics · #11J70 #11P81 #37E05 #Advanced Combinatorial Mathematics #Combinatorics (math.CO) #FOS: Mathematics #Mathematical Dynamics and Fractals #Number Theory (math.NT) #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.2212.02369

openalex publication_date 2022/12/05 · openalex created_date 2022/12/19 · openalex updated_date 2026/07/28

Abstract

Using the slow triangle map (a type of multi-dimensional continued fraction algorithm), we exhibit a method for generating any number of new identities for subsets of integer partitions.

Related

• On integer partitions and continued fraction type algorithms
• Continued Fractions for partition generating functions
• Shift-plethysm, Hydra continued fractions, and m-distinct partitions
• Computation of invariant densities for continued fraction algorithms
• N-graphs, modular Sidon and sum-free sets, and partition identities