Three Simple Reduction Formulas for the Denumerant Functions

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Liu, Feihu, Xin, Guoce, Zhang, Chen
Formato: Preprint
Publicado: 2024
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866912007899316224
author Liu, Feihu
Xin, Guoce
Zhang, Chen
author_facet Liu, Feihu
Xin, Guoce
Zhang, Chen
contents Let $A$ be a nonempty set of positive integers. The restricted partition function $p_A(n)$ denotes the number of partitions of $n$ with parts in $A$. When the elements in $A$ are pairwise relatively prime positive integers, Ehrhart, Sertöz-Özlük, and Brown-Chou-Shiue derived three reduction formulas for $p_A(n)$ for $A$ with three parameters. We extend their findings for general $A$ using the Bernoulli-Barnes polynomials.
format Preprint
id arxiv_https___arxiv_org_abs_2404_13989
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Three Simple Reduction Formulas for the Denumerant Functions
Liu, Feihu
Xin, Guoce
Zhang, Chen
Combinatorics
Number Theory
Let $A$ be a nonempty set of positive integers. The restricted partition function $p_A(n)$ denotes the number of partitions of $n$ with parts in $A$. When the elements in $A$ are pairwise relatively prime positive integers, Ehrhart, Sertöz-Özlük, and Brown-Chou-Shiue derived three reduction formulas for $p_A(n)$ for $A$ with three parameters. We extend their findings for general $A$ using the Bernoulli-Barnes polynomials.
title Three Simple Reduction Formulas for the Denumerant Functions
topic Combinatorics
Number Theory
url https://arxiv.org/abs/2404.13989