Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Infinite families of crank functions, Stanton-type conjectures, and unimodality

Infinite families of crank functions, Stanton-type conjectures, and unimodality Dyson’s rank function and the Andrews–Garvan crank function famously give combinatorial witnesses for Ramanujan’s partition function congruences modulo 5, 7, and 11. While these functions can be used to show that the corresponding sets of partitions split into 5, 7, or 11 equally sized sets, one may ask how to make the resulting bijections between partitions organized by rank or crank combinatorially explicit. Stanton recently made conjectures which aim to uncover a deeper combinatorial structure along these lines, where it turns out that minor modifications of the rank and crank are required. Here, we prove two of these conjectures. We also provide abstract criteria for quotients of polynomials by certain cyclotomic polynomials to have non-negative coefficients based on unimodality and symmetry. Furthermore, we extend Stanton’s conjecture to an infinite family of cranks. This suggests further applications to other combinatorial objects. We also discuss numerical evidence for our conjectures, connections with other analytic conjectures such as the distribution of partition ranks. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Research in the Mathematical Sciences Springer Journals

Infinite families of crank functions, Stanton-type conjectures, and unimodality

Download PDF
16 pages

Loading next page...
 
/lp/springer-journals/infinite-families-of-crank-functions-stanton-type-conjectures-and-1zicaGmV72
Publisher
Springer Journals
Copyright
Copyright © The Author(s), under exclusive licence to Springer Nature Switzerland AG 2022
eISSN
2197-9847
DOI
10.1007/s40687-022-00333-3
Publisher site
See Article on Publisher Site

Abstract

Dyson’s rank function and the Andrews–Garvan crank function famously give combinatorial witnesses for Ramanujan’s partition function congruences modulo 5, 7, and 11. While these functions can be used to show that the corresponding sets of partitions split into 5, 7, or 11 equally sized sets, one may ask how to make the resulting bijections between partitions organized by rank or crank combinatorially explicit. Stanton recently made conjectures which aim to uncover a deeper combinatorial structure along these lines, where it turns out that minor modifications of the rank and crank are required. Here, we prove two of these conjectures. We also provide abstract criteria for quotients of polynomials by certain cyclotomic polynomials to have non-negative coefficients based on unimodality and symmetry. Furthermore, we extend Stanton’s conjecture to an infinite family of cranks. This suggests further applications to other combinatorial objects. We also discuss numerical evidence for our conjectures, connections with other analytic conjectures such as the distribution of partition ranks.

Journal

Research in the Mathematical Sciences – Springer Journals

Published: Sep 1, 2022

References

  • Distribution of the partition function modulo composite integers M
    Ahlgren, S
  • Arithmetic properties of the partition function
    Ahlgren, S; Boylan, M
  • An infinite family of congruences for ℓ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\ell $$\end{document}-regular overpartitions
    Alanazi, A; Munagi, A; Sellers, J
  • Multiplicative congruence properties and density problems for p(n)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$p(n)$$\end{document}
    Atkin, A
  • Some properties of partitions
    Atkin, A; Swinnerton-Dyer, P
  • Exceptional congruences for powers of the partition function
    Boylan, M
  • Congruences for powers of the partition function
    Dawsey, M; Wagner, I
  • Asymptotic formulae for partition ranks
    Dousse, J; Mertens, M
  • Some guesses in the theory of partitions
    Dyson, F
  • The crank of partitions mod 8, 9 and 10
    Garvan, F
  • Cranks and t\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$t$$\end{document}-cores
    Garvan, F; Kim, D; Stanton, D
  • Congruences in ordered pairs of partitions
    Hammond, P; Lewis, R
  • Efficient implementation of the Hardy-Ramanujan-Rademacher formula
    Johansson, F
  • Distribution of the partition function modulo m
    Ono, K
  • Congruence properties of partitions
    Ramanujan, S
  • Congruence properties of partitions
    Ramanujan, S
  • New congruences for the partition function
    Weaver, R