On the enumeration of partitions with summands in arithmetic progression

Nyblom, M and Evans, C 2003, 'On the enumeration of partitions with summands in arithmetic progression', Australasian Journal of Combinatorics, vol. 28, pp. 149-159.


Document type: Journal Article
Collection: Journal Articles

Title On the enumeration of partitions with summands in arithmetic progression
Author(s) Nyblom, M
Evans, C
Year 2003
Journal name Australasian Journal of Combinatorics
Volume number 28
Start page 149
End page 159
Total pages 10
Publisher Centre for Discrete Mathematics and Computing
Abstract Enumerating formulae are constructed which count the number of partitions of a positive integer into positive summands in arithmetic progression with common difference D. These enumerating formulae (denoted pD(n)) which are given in terms of elementary divisor functions together with auxiliary arithmetic functions (to be defined) are then used to establish a known characterisation for an integer to possess a partition of the form in question.
Subject Algebra and Number Theory
ISSN 1034-4942
Versions
Version Filter Type
Access Statistics: 82 Abstract Views  -  Detailed Statistics
Created: Mon, 04 Oct 2010, 13:29:39 EST by Catalyst Administrator
© 2014 RMIT Research Repository • Powered by Fez SoftwareContact us