Strict log-concavity of <i>k</i> -coloured partitions

In recent years, there has been extensive work on inequalities among partition functions. In particular, Nicolas, and independently DeSalvo–Pak, proved that the partition function dollar sign p left parenthesis n right parenthesis dollar sign $p(n)$ <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content" display="inline"> <mml:mrow> <mml:mi>p</mml:mi> <mml:mo stretchy="false">(</mml:mo> <mml:mi>n</mml:mi> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> </mml:math> is eventually log-concave. Inspired by this and other results, Chern–Fu–Tang first conjectured the log-concavity of dollar sign k dollar sign $k$ <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content" display="inline"> <mml:mrow> <mml:mi>k</mml:mi> </mml:mrow> </mml:math> -coloured partitions. Three of the authors and Tripp later proved this conjecture by introducing recursive sequences and a strict inequality for fractional partition functions, giving explicit errors. In this paper, we show that the log-concavity is, in fact, strict for dollar sign k greater than or equals 2 dollar sign $k\geq 2$ <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content" display="inline"> <mml:mrow> <mml:mi>k</mml:mi> <mml:mo>≥</mml:mo> <mml:mn>2</mml:mn> </mml:mrow> </mml:math> . We shed further light on this phenomenon by utilizing Hardy–Littlewood–Pólya’s notion of majorizing. We prove that for partitions dollar sign a comma b dollar sign $\boldsymbol{a},\boldsymbol{b}$ <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content" display="inline"> <mml:mrow> <mml:mrow> <mml:mi mathvariant="bold-italic">a</mml:mi> </mml:mrow> <mml:mo>,</mml:mo> <mml:mrow> <mml:mi mathvariant="bold-italic">b</mml:mi> </mml:mrow> </mml:mrow> </mml:math> of dollar sign n element of upper N dollar sign $n\in{\mathbb N}$ <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content" display="inline"> <mml:mrow> <mml:mi>n</mml:mi> <mml:mo>∈</mml:mo> <mml:mrow> <mml:mi mathvariant="double-struck">N</mml:mi> </mml:mrow> </mml:mrow> </mml:math> , if dollar sign b dollar sign $\boldsymbol b$ <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content" display="inline"> <mml:mrow> <mml:mi mathvariant="bold-italic">b</mml:mi> </mml:mrow> </mml:math> majorizes dollar sign a dollar sign $\boldsymbol a$ <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content" display="inline"> <mml:mrow> <mml:mi mathvariant="bold-italic">a</mml:mi> </mml:mrow> </mml:math> , then dollar sign pk left p

Authors

Institutions

Publication Details

Journal
Proceedings of the Royal Society of Edinburgh Section A Mathematics
Published
2026-05-18
DOI
https://doi.org/10.1017/prm.2026.10154
Primary Topic
Advanced Mathematical Identities
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Strict log-concavity of k -coloured partitions

Ben Kane, Larry Rolen, Anubhab Pahari, Kathrin Bringmann
Proceedings of the Royal Society of Edinburgh Section A Mathematics
Advanced Mathematical Identities
article

Strict log-concavity of k -coloured partitions

Ben Kane, Larry Rolen, Anubhab Pahari, Kathrin Bringmann
article en

Abstract

In recent years, there has been extensive work on inequalities among partition functions. In particular, Nicolas, and independently DeSalvo–Pak, proved that the partition function dollar sign p left parenthesis n right parenthesis dollar sign $p(n)$ <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content" display="inline"> <mml:mrow> <mml:mi>p</mml:mi> <mml:mo stretchy="false">(</mml:mo> <mml:mi>n</mml:mi> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> </mml:math> is eventually log-concave. Inspired by this and other results, Chern–Fu–Tang first conjectured the log-concavity of dollar sign k dollar sign $k$ <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content" display="inline"> <mml:mrow> <mml:mi>k</mml:mi> </mml:mrow> </mml:math> -coloured partitions. Three of the authors and Tripp later proved this conjecture by introducing recursive sequences and a strict inequality for fractional partition functions, giving explicit errors. In this paper, we show that the log-concavity is, in fact, strict for dollar sign k greater than or equals 2 dollar sign $k\geq 2$ <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content" display="inline"> <mml:mrow> <mml:mi>k</mml:mi> <mml:mo>≥</mml:mo> <mml:mn>2</mml:mn> </mml:mrow> </mml:math> . We shed further light on this phenomenon by utilizing Hardy–Littlewood–Pólya’s notion of majorizing. We prove that for partitions dollar sign a comma b dollar sign $\boldsymbol{a},\boldsymbol{b}$ <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content" display="inline"> <mml:mrow> <mml:mrow> <mml:mi mathvariant="bold-italic">a</mml:mi> </mml:mrow> <mml:mo>,</mml:mo> <mml:mrow> <mml:mi mathvariant="bold-italic">b</mml:mi> </mml:mrow> </mml:mrow> </mml:math> of dollar sign n element of upper N dollar sign $n\in{\mathbb N}$ <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content" display="inline"> <mml:mrow> <mml:mi>n</mml:mi> <mml:mo>∈</mml:mo> <mml:mrow> <mml:mi mathvariant="double-struck">N</mml:mi> </mml:mrow> </mml:mrow> </mml:math> , if dollar sign b dollar sign $\boldsymbol b$ <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content" display="inline"> <mml:mrow> <mml:mi mathvariant="bold-italic">b</mml:mi> </mml:mrow> </mml:math> majorizes dollar sign a dollar sign $\boldsymbol a$ <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content" display="inline"> <mml:mrow> <mml:mi mathvariant="bold-italic">a</mml:mi> </mml:mrow> </mml:math> , then dollar sign pk left p

Proceedings of the Royal Society of Edinburgh Section A Mathematics
University of Cologne (DE), Vanderbilt University (US), Indian Institute of Technology Madras (IN), University of Hong Kong (HK)
Reduced inequalities
Openalex Percentile: Top 2%
Advanced Mathematical Identities
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.