1987
DOI: 10.1016/s0195-6698(87)80041-0
|View full text |Cite
|
Sign up to set email alerts
|

Partitions with Prescribed Hook Differences

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
102
0
1

Year Published

1989
1989
2010
2010

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 61 publications
(103 citation statements)
references
References 9 publications
0
102
0
1
Order By: Relevance
“…The polynomials (1.12) generalize the polynomials used by Schur [2] in connection with difference two partitions and is the finitization we use in this paper. They satisfy a simple recursion relation in L and can be interpreted as the generating functions for partitions with prescribed hook differences [35].…”
Section: Introductionmentioning
confidence: 99%
“…The polynomials (1.12) generalize the polynomials used by Schur [2] in connection with difference two partitions and is the finitization we use in this paper. They satisfy a simple recursion relation in L and can be interpreted as the generating functions for partitions with prescribed hook differences [35].…”
Section: Introductionmentioning
confidence: 99%
“…Following Atkin, Andrews [8] and Bressoud [13] studied partitions with prescribed bounds for successive ranks. In [10] the notion of successive ranks was generalized to hook differences, with the hook vertices not necessarily on the diagonal of the Durfee square. Also in [10] the succesive rank theorem of Andrews [8] and Bressoud [13] was revised as follows: …”
Section: Successive Ranks With Prescribed Boundsmentioning
confidence: 99%
“…Theorem R is a consequence of Theorem 5 of [10], but we stress here that if A 2k,k (n) is to be interpreted as the number of partitions of n into parts ≡ 0, ±k (mod 2k), then this has to be in the sense of (7.1), where the residue class k (mod 2k) is "deleted twice" because it occurs as both k and −k (mod 2k).…”
Section: Then For 1 ≤ I < K/2 We Havementioning
confidence: 99%
See 1 more Smart Citation
“…Applying C 4 to λ = (9, 8, 8, 7, 7, 6, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1) gives C 4 (λ) = (9,9,8,7,7,6,5,4,4,3,3,3,3, 2, 2, 2, 2, 1, 1). Intermediate steps are ν 1 , ν 2 , ν 3 , ν 4 , α ′ , and β ′ as shown.…”
mentioning
confidence: 99%