Asymptotic Briggs inequalities for regular partitions and overpartitions

From papers

Let pk(n)p_k(n) and pk(n)\overline{p}_k(n) denote the kk-regular partition and kk-regular overpartition functions, respectively, and let the inequalities referred to in the source as (p_kmain) and (opk-main) be the corresponding Briggs inequalities. The conjecture. For every positive integer k2k\geq 2, there exists N(k)N(k) such that both inequalities hold for all nN(k)n\geq N(k). The paper proves the claim in certain ranges of kk and discusses computational evidence for 2k1002\leq k\leq 100, but the supplied text does not establish the conjecture for every kk.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Xin-Bei Liu and Zhong-Xue Zhang, “The Briggs inequality for partitions and overpartitions”, arXiv:2408.16185 (2024).

Solutions 0

No solutions have been posted yet.