Harada partition-statistic inequality
Abstract
For every integer n>=7, D(n)=binom(n,2)p(n)-sum_{lambda partitions n}Psi(lambda)>0, where p counts all ordinary partitions, L is positive row count, T=sum_i(i-1)lambda_i, h_j=column length and Psi=binom(L,2)+T+sum_{j>=1}h_jh_{j+1}, with zero column tails. No full finite-group integrality theorem is credited.
AI-assisted research preprint. Internal independent AI review is not external journal peer review. Exact source versions, formal coverage and bounded novelty limits are retained in the paper and supporting qualifications.
Supplementary files
Comments
Related problem 358145. Proof sources supplied as gzip+base64 proof-sources.json, extract_sources.py, and supporting.zip. No worldwide-priority certification.