Pith. sign in

REVIEW

The Briggs inequality for partitions and overpartitions

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2408.16185 v1 pith:TDDFXIHO submitted 2024-08-29 math.CO

classification math.CO
keywords overlinebriggsfunctioninequalityalignoverpartitionpartitionregular
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

A sequence of $\{a_n\}_{n\ge 0}$ satisfies the Briggs inequality if \begin{align*} a_n^2(a_n^2-a_{n-1}a_{n+1})>a_{n-1}^2(a_{n+1}^2-a_na_{n+2}) \end{align*} holds for any $n\ge 1$. In this paper we show that both the partition function $\{p(n+N_0)\}_{n\geq 0}$ and the overpartition function $\{\overline{p}(n+\overline{N}_0)\}_{n\ge 0}$ satisfy the Briggs inequality for some $N_0$ and $\overline{N}_{0}$. Based on Chern's formula for $\eta$-quotients, we further prove that the $k$-regular partition function $\{p_k(n+N_{k})\}_{n\geq 0}$ and the $k$-regular overpartition function $\{\overline{p}_k(n+\overline{N}_k)\}_{n\ge 0}$ also satisfy the Briggs inequality for $2\le k\le 9$ and some $N_k,\overline{N}_{k}$.

Discussion (0). Continue with ORCID to comment.

Pith tools