Algorithms for enumeration problem of linear congruence modulo \(m\) as sum of restricted partition numbers

DOI10.1007/s11464-014-0394-2zbMath1311.05014OpenAlexW1968520873MaRDI QIDQ2258125

Peter Jau-Shyong Shiue, Tian-Xiao He

Publication date: 2 March 2015

Published in: Frontiers of Mathematics in China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11464-014-0394-2

zbMATH Keywords

congruencemultiset congruence solutionrestricted integer partition

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Partitions; congruences and congruential restrictions (11P83) Elementary theory of partitions (11P81)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Enumeration problems for a linear congruence equation
• A unified approach to algorithms generating unrestricted and restricted integer compositions and integer partitions
• Parker's Permutation Problem Involves the Catalan Numbers
• Binomial Coefficients Modulo a Prime