The Briggs inequality for partitions and overpartitions

Abstract

A sequence of \an\n 0 satisfies the Briggs inequality if align* an2(an2-an-1an+1)>an-12(an+12-anan+2) align* holds for any n 1. In this paper we show that both the partition function \p(n+N0)\n≥ 0 and the overpartition function \p(n+N0)\n 0 satisfy the Briggs inequality for some N0 and N0. Based on Chern's formula for η-quotients, we further prove that the k-regular partition function \pk(n+Nk)\n≥ 0 and the k-regular overpartition function \pk(n+Nk)\n 0 also satisfy the Briggs inequality for 2 k 9 and some Nk,Nk.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…