English

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

Combinatorics 2026-01-15 v2

Abstract

We prove new formulas for pd(n)p_d(n), the number of dd-ary partitions of nn, and, also, for its polynomial part. Given a partition λ=(λ1,,λ)\lambda=(\lambda_1,\ldots,\lambda_{\ell}), its associated jj-th symmetric elementary partition, prej(λ)pre_{j}(\lambda), is the partition whose parts are {λi1λij  :  1i1<<ij}\{\lambda_{i_1}\cdots\lambda_{i_j}\;:\;1\leq i_1 < \cdots < i_j\leq \ell\}. We prove that if λ\lambda and μ\mu are two dd-ary partitions of length \ell such that prej(λ)=prej(μ)pre_j(\lambda)=pre_j(\mu) and λi1λij=μi1μij\lambda_{i_1}\cdots \lambda_{i_j} = \mu_{i_1}\cdots \mu_{i_j}, for all 1i1<<ij1\leq i_1 < \cdots < i_j\leq \ell, then λ=μ\lambda=\mu.

Keywords

Cite

@article{arxiv.2506.04459,
  title  = {Remarks on $d$-ary partitions and an application to elementary symmetric partitions},
  author = {Mircea Cimpoeas and Roxana Tanase},
  journal= {arXiv preprint arXiv:2506.04459},
  year   = {2026}
}

Comments

We found a gap in the proof of Theorem 4.2, in the previous version. In order do correct it, we added a supplementary condition in the statement of Theorem 4.2; 8 pages