On the number of even and odd strings along the overpartitions of n
From MaRDI portal
Publication:2453485
Abstract: Recently, Andrews, Chan, Kim and Osburn introduced the even strings and the odd strings in the overpartitions. We show that their conjecture 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.
Recommendations
Cites work
- Asymptotic Partition Formulae: (II) Weighted Partitions
- Asymptotic inequalities for positive crank and rank moments
- 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)- 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
- Integer partitions, probabilities and quantum modular forms
- Ramanujan-type partial theta identities and rank differences for special unimodal sequences
- On spt-crank-type functions
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)