English

A crank for bipartitions with designated summands

Combinatorics 2021-02-26 v1

Abstract

Andrews, Lewis and Lovejoy introduced the partition function PD(n)PD(n) as the number of partitions of nn with designated summands. A bipartition of nn is an ordered pair of partitions (π1,π2)(\pi_1, \pi_2) with the sum of all of the parts being nn. In this paper, we introduce a generalized crank named the pdpd-crank for bipartitions with designated summands and give some inequalities for the pdpd-crank of bipartitions with designated summands modulo 2 and 3. We also define the pdpd-crank moments weighted by the parity of pdpd-cranks μ2k,bd(1,n)\mu_{2k,bd}(-1,n) and show the positivity of (1)nμ2k,bd(1,n)(-1)^n\mu_{2k,bd}(-1,n). Let Mbd(m,n)M_{bd}(m,n) denote the number of bipartitions of nn with designated summands with pdpd-crank mm. We prove a monotonicity property of pdpd-cranks of bipartitions with designated summands and find that the sequence {Mbd(m,n)}mn\{M_{bd}(m,n)\}_{|m|\leq n} is unimodal for n1,5,7n\not= 1,5,7.

Keywords

Cite

@article{arxiv.2102.12753,
  title  = {A crank for bipartitions with designated summands},
  author = {R. X. J. Hao and E. Y. Y. Shen},
  journal= {arXiv preprint arXiv:2102.12753},
  year   = {2021}
}

Comments

17 pages

R2 v1 2026-06-23T23:29:56.022Z