Remarks on d-ary partitions and an application to elementary symmetric partitions

Abstract

We prove new formulas for pd(n), the number of d-ary partitions of n, and, also, for its polynomial part. Given a partition λ=(λ1,…,λ), its associated j-th symmetric elementary partition, prej(λ), is the partition whose parts are \λi1·sλij\;:\;1≤ i1 < ·s < ij≤ \. We prove that if λ and μ are two d-ary partitions of length such that prej(λ)=prej(μ) and λi1·s λij = μi1·s μij, for all 1≤ i1 < ·s < ij≤ , then λ=μ.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…