Number Theory and Discrete Mathematics 2002
DOI: 10.1007/978-3-0348-8223-1_6
|View full text |Cite
|
Sign up to set email alerts
|

Rogers-Ramanujan Type Identities for Burge’s Restricted Partition Pairs Via Restricted Frobenius Partitions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
5
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(5 citation statements)
references
References 3 publications
0
5
0
Order By: Relevance
“…p(n) = #P (n). For instance, we have that p(4) = 5 with (4), (3,1), (2,2), (2, 1, 1) and (1, 1, 1, 1).…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…p(n) = #P (n). For instance, we have that p(4) = 5 with (4), (3,1), (2,2), (2, 1, 1) and (1, 1, 1, 1).…”
Section: Introductionmentioning
confidence: 99%
“…Therefore, there is a plethora of literature devoted to its analytic, arithmetic and combinatorial properties. We refer the reader to [1,5,6,20,32] for a comprehensive introduction to the theory of partitions. Now, let us recall that a sequence (c n ) ∞ n=0 of real numbers is said to be logconcave if it fulfills c 2 n > c n−1 c n+1 for every n ⩾ 1.…”
Section: Introductionmentioning
confidence: 99%
“…The numbers λ i are called parts of the partition λ. The partition function p(n) enumerates all partitions of n. For instance, there are 5 partitions of 4, namely, (4), (3,1), (2,2), (2, 1, 1) and (1, 1, 1, 1) -in other words p(4) = 5. We do not know any easy formula for p(n).…”
Section: Introductionmentioning
confidence: 99%
“…There is a plethora of works devoted to the theory of partitions. For a general introduction to the topic, we encourage the reader to see Andrews' books [4,5] as well as [1,31,45]. Now, let us assume that A = {a 1 , a 2 , .…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation