Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2024 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

Positivity of the determinants of the partition function and the overpartition function
HTML articles powered by AMS MathViewer

by Larry X. W. Wang and Neil N. Y. Yang;
Math. Comp. 92 (2023), 1383-1402
DOI: https://doi.org/10.1090/mcom/3810
Published electronically: January 31, 2023

Abstract:

In this paper, we give an iterated approach to concern with the positivity of \begin{equation*} \det \ (p(n-i+j))_{1\leq i,j\leq k}, \end{equation*} where $p(n)$ is the partition function. We first apply a general method to prove that for given $k_1,k_2,m_1,m_2$, one can find a threshold $N(k_1,k_2,m_1,m_2)$ such that for $n>N(k_1,k_2,m_1,m_2)$, \begin{equation*} \begin {vmatrix} p(n-k_1+m_1) & p(n+m_1) & p(n+m_1+m_2)\\ p(n-k_1) & p(n) & p(n+m_2)\\ p(n-k_1-k_2) & p(n-k_2) & p(n-k_2+m_2) \end{vmatrix}>0. \end{equation*} Based on this result, we will prove that for $n\geq 656$, $\det \ (p(n-i+j))_{1\leq i,j\leq 4}>0$. Employing the same technique, we will show that determinants $({\bar p}(n-i+j))_{1\leq i,j\leq k}$ are positive for $k=3 \text { and } 4$ for overpartition ${\bar p}(n)$. Furthermore, we will give an outline of how to prove the positivity of $\det \ (p(n-i+j))_{1\leq i,j\leq k}$ for general $k$.
References
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC (2020): 05A20, 11P82
  • Retrieve articles in all journals with MSC (2020): 05A20, 11P82
Bibliographic Information
  • Larry X. W. Wang
  • Affiliation: Center for Combinatorics, LPMC, Nankai University, Tianjin 300071, People’s Republic of China; and Department of Mathematics, Nankai University, Tianjin 300071, People’s Republic of China
  • MR Author ID: 845775
  • Email: wsw82@nankai.edu.cn
  • Neil N. Y. Yang
  • Affiliation: Department of Mathematics, Nankai University, Tianjin 300071, People’s Republic of China
  • Email: 1910132@mail.nankai.edu.cn
  • Received by editor(s): December 24, 2021
  • Received by editor(s) in revised form: August 14, 2022
  • Published electronically: January 31, 2023
  • Additional Notes: This work was supported by the National Natural Science Foundation of China (grant number 12171254) and the Natural Science Foundation of Tianjin (grant number 19JCYBJC30100).
  • © Copyright 2023 American Mathematical Society
  • Journal: Math. Comp. 92 (2023), 1383-1402
  • MSC (2020): Primary 05A20, 11P82
  • DOI: https://doi.org/10.1090/mcom/3810
  • MathSciNet review: 4550331