A Bailey lattice
By Jeremy Lovejoy. 2003
91 citations recorded by the source corpus.
Subfields: Algebra and Number Theory, Discrete Mathematics and Combinatorics
View Paper: https://www.semanticscholar.org/paper/139d03d514c1e1ab5a8803884d6c766ac29ede5c
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Algebra and Number Theory
- V. Spiridonov
- S. Ole Warnaar
- Jeremy Lovejoy
- Eric M. Rains
- G. Vartanov
- Hjalmar Rosengren
- Robert Osburn
- Kathrin Bringmann
In Discrete Mathematics and Combinatorics
- V. Spiridonov
- S. Ole Warnaar
- Jeremy Lovejoy
- Robert Osburn
- Kathrin Bringmann
- George E. Andrews
- Frank G. Garvan
- Chris Jennings-Shaffer
Citations in the corpus
- RANK AND CONGRUENCES FOR OVERPARTITION PAIRS (2008, unknown): “11) in [22]: 4 (1 + z)(1 + z−1) + ∑”
- A Bailey Tree for Integrals (2003, background): “In this case one gets a more complicated structure of the derived set of identities, which is called as the Bailey lattice [16] or tree [1].”
- 50 Years of Bailey’s Lemma (2009, background): “Moreover, many of the Bailey pairs of Rogers and Slater (as well as later pairs found in [4, 44, 1]) are included as special cases.”
- Overpartitions and real quadratic fields (2004, background): “In [9] it is observed that if (αn, βn) is a Bailey with respect to a/q, then (α∗ n, β∗ n) is a Bailey pair with respect to a, where α∗ n = (a/b)n(−b)nqn(n−1)/2(1− aq2n) (bq)n(1− a) n ∑”