On the number of even and odd strings along the overpartitions of n

DOI10.1007/S00013-014-0636-2MaRDI QIDQ2453485zbMATH OpenOpenAlexWikidataFDO

Authors Byungchan Kim, Eunmi Kim, Jeehyeon Seo

Publication date 6 June 2014

Published in Archiv der Mathematik (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1309.3669

zbMATH Keywords

circle methodcranksoverpartitionspartial theta functionspositive momentsranksstrings

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Analytic theory of partitions (11P82)

Abstract: Recently, Andrews, Chan, Kim and Osburn introduced the even strings and the odd strings in the overpartitions. We show that their conjecture $A_k(n)geq{B}_k(n)$ holds for large enough positive integers n, where A_k(n) (resp. B_k(n)) is the number of odd (resp. even) strings along the overpartitions of n. We introduce m-strings and show that how this new combinatorial object is related with another positivity conjecture of Andrews, Chan, Kim, and Osburn. Finally, we confirm that the positivity conjecture is also true for large enough integers.

Review text

Let \(A_k(n)\) (resp. \(B_k(n)\)) denote the number of odd (resp. even) strings starting from \(2k-1\) along the overpartitions of \(n\). In a recent preprint (see reference [4] [``The first positive rank and crank moments for overpartitions, Preprint, \url{arXiv:1309.0381}], \textit{G.E. Andrews} et al. showed that for all \(n \geq 1\), \[ \sum_{k=1}^{\lfloor (n+1)/2 \rfloor} (A_k(n) - B_k(n)) \] has positive coefficients, and they conjectured that \[ A_k(n) - B_k(n) \geq 0 \] for all \(k,n \geq 1\). The first main result in the paper under review is that for \(k \geq 1\) and for large enough \(n\), \[ A_k(n) - B_k(n) > 0. \] This result is established by applying the circle method to the partial theta functions which generate the numbers \(A_k(n) - B_k(n)\). Next define \(h(q)\) by \[ h(q) := \sum_{n \geq 1} \frac{(-1)^{n+1}q^{n(n+1)/2}}{1-q^n}. \] Andrews et al. in [loc. cit.] also conjectured that for any \(m \geq 2\), \[ \frac{1}{(q)_{\infty}}(h(q) - mh(q^m)) \] has positive coefficients, where \[ (q)_{\infty} := (1-q)(1-q^2)(1-q^3) \cdots \] The second main result in the present paper is that this conjecture is true asymptotically. The proof is similar to the proof of the first main result. The authors also provide a combinatorial interpretation for the coefficients of \(h(q^m)/(q)_{\infty}\).

Recommendations

• On the number of overpartitions into odd parts
• A positivity conjecture related first positive rank and crank moments for overpartitions
• Overpartitions and Bressoud's conjecture. I
• Parity biases in partitions and restricted partitions
• Overpartitions as sums over partitions

Cites work

• Asymptotic inequalities for positive crank and rank moments
• Asymptotic Partition Formulae: (II) Weighted Partitions
• Dyson’s crank of a partition
• Higher order spt-functions
• Overpartitions
• Rank and crank moments for overpartitions
• Relations between the ranks and cranks of partitions
• The first positive rank and crank moments for overpartitions
• The number of smallest parts in the partitions of n
• The odd moments of ranks and cranks

Cited in

(6)

• On spt-crank-type functions
• Integer partitions, probabilities and quantum modular forms
• Inequalities for ranks of partitions and the first moment of ranks and cranks of partitions
• Asymptotics of higher order ospt-functions for overpartitions
• The first positive rank and crank moments for overpartitions
• Ramanujan-type partial theta identities and rank differences for special unimodal sequences

This page was built for publication: On the number of even and odd strings along the overpartitions of \(n\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2453485)