Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Halarrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
Hal
Article . 2002
Data sources: Hal
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
zbMATH Open
Article
Data sources: zbMATH Open
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
HAL Descartes
Article . 2002
Data sources: HAL Descartes
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
Mathematical Research Letters
Article . 2002 . Peer-reviewed
Data sources: Crossref
versions View all 6 versions
addClaim

Lacunary partition functions

Authors: Lovejoy, J.;

Lacunary partition functions

Abstract

A function \(f(q)\) is lacunary if \(f(q)= \sum_{n\geq 0} a(n)q^n\) and \(a(n)\) is almost always \(0\). It is known by the work of J.-P. Serre, B. Gordon and S. Robins that there are approximately 60 pairs \((r,s)\) for which \[ \prod_{n=1}^\infty (1-q^n)^r(1-q^{2n})^s \] is lacunary. In this article, the author first establishes, using the theory of Bailey pairs, identities expressing multi-sum Rogers-Ramanujan type expressions in terms of Hecke type functions. An example is \[ \begin{split} &\sum_{n\geq 0}\sum_{j=-n}^n(-1)^{n+j}q^{((2k+3)n^2+(2k+1)n)/2-j(3j+1)/2}(1-q^{2n+1}) \\ &\qquad = \sum_{n_k\geq n_{k-1}\geq\cdots \geq n_1\geq 0} \frac{(q;q)_{n_k}(-1)^{n_k}q^{n_k(n_k+1)/2+n_{k-1}(n_{k-1}+1)+\cdots +n_1(n_1+1)}}{(q;q)_{n_k-n_{k-1}}\cdots (q;q)_{n_2-n_1}},\end{split}\tag{1} \] where as usual \[ (a;q)_n = (1-a)(1-aq)\cdots (1-aq^{n-1}). \] Using a result due to P. Bernays, the author deduces that the left hand side of (1) is lacunary. He then gives a partition-theoretic interpretation of the right hand side of (1) and explains why the difference of certain partition functions is almost always 0. Such results are analogous to Euler's result, which states that if \(E(n)\) and \(O(n)\) denote respectively the number of partitions of \(n\) into an even and odd number of distinct parts, then \(E(n)-O(n)=0\) for almost all \(n\).

Country
France
Keywords

[INFO.INFO-OH] Computer Science [cs]/Other [cs.OH], Combinatorial aspects of partitions of integers, Basic hypergeometric functions in one variable, \({}_r\phi_s\), Bailey pairs, Analytic theory of partitions, lacunary series, Power series (including lacunary series) in one complex variable

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    14
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Top 10%
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Top 10%
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
14
Top 10%
Top 10%
Average
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!