Proofs of two conjectures of Berkovich and Dhar on hook lengths
Rong Chen
Source abstract
We prove stronger forms of two conjectures of Berkovich and Dhar concerning a coefficientwise inequality and pairs of hooks of length two in bounded partitions. The coefficientwise inequality implies the corresponding inequality for hook pairs. In particular, for each fixed size and common bound on the largest part, the total number of such pairs in odd partitions is at least that in distinct partitions. We give combinatorial proofs by explicit weight-preserving injections based on Glaisher's bijection and analytic proofs using finite product identities and known hook generating functions.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.