English

Polynomial analogues of restricted multicolor b-ary partition functions

Number Theory 2019-08-13 v1

Abstract

Given an integer base b2b\geq 2, a number ρ1\rho\geq 1 of colors, and a finite sequence Λ=(λ1,,λρ)\Lambda=(\lambda_1,\ldots,\lambda_\rho) of positive integers, we introduce the concept of a Λ\Lambda-restricted ρ\rho-colored bb-ary partition of an integer n1n\geq 1. We also define a sequence of polynomials in λ1++λρ\lambda_1+\cdots+\lambda_\rho variables, and prove that the nnth polynomial characterizes all Λ\Lambda-restricted ρ\rho-colored bb-ary partitions of nn. In the process we define a recurrence relation for the polynomials in question, obtain explicit formulas and identify a factorization theorem.

Keywords

Cite

@article{arxiv.1908.03751,
  title  = {Polynomial analogues of restricted multicolor b-ary partition functions},
  author = {Karl Dilcher and Larry Ericksen},
  journal= {arXiv preprint arXiv:1908.03751},
  year   = {2019}
}
R2 v1 2026-06-23T10:44:21.113Z