The Partition Method for a Power Series Expansion 2017
DOI: 10.1016/b978-0-12-804466-7.00005-x
|View full text |Cite
|
Sign up to set email alerts
|

Programming the Partition Method for a Power Series Expansion

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
10
0

Year Published

2017
2017
2018
2018

Publication Types

Select...
1
1

Relationship

2
0

Authors

Journals

citations
Cited by 2 publications
(10 citation statements)
references
References 18 publications
0
10
0
Order By: Relevance
“…Then one equates like powers of x. For the special case of n = 1, the numbers are related to the cosecant-squared numbers discussed in [25] and [28]. As a consequence, we find that…”
Section: Generalized Cosecant Numbersmentioning
confidence: 78%
See 3 more Smart Citations
“…Then one equates like powers of x. For the special case of n = 1, the numbers are related to the cosecant-squared numbers discussed in [25] and [28]. As a consequence, we find that…”
Section: Generalized Cosecant Numbersmentioning
confidence: 78%
“…This method first appeared in [31]. Then, Table 2.1: Multiplicities of the partitions summing to 5 and the sums of the parts it was developed further in a series of articles [26,[28][29][30], culminating in [25]. In particular, [25] not only provides the most comprehensive account of the method by including most of the existing material from the other articles, but also introduces more intricate applications and derivations.…”
Section: Generalized Cosecant Numbersmentioning
confidence: 99%
See 2 more Smart Citations
“…Generally, when k is large, most of the multiplicities for a partition vanish as we shall see shortly. Using (2) one finds that c 0 = 1, c 1 = 1/6, c 2 = 7/360, c 4 = 31/3•7! and so on.…”
Section: Introductionmentioning
confidence: 99%