Hook length biases and general linear partition inequalities
Hook length biases and general linear partition inequalities
复制标题
DOI:
10.1007/s40687-023-00402-1
复制
发表时间:
2023-03
影响因子:
1.2
通讯作者:
C. Ballantine;Hannah E. Burson;William Craig;A. Folsom;Boya Wen
中科院分区:
文献类型:
--
作者:
C. Ballantine;Hannah E. Burson;William Craig;A. Folsom;Boya Wen
Motivated in part by hook-content formulas for certain restricted partitions in representation theory, we consider the total number of hooks of fixed length in odd versus distinct partitions. We show that there are more hooks of length 2, respectively 3, in all odd partitions ofnthan in all distinct partitions ofn, and make the analogous conjecture for arbitrary hook length. We also establish additional bias results on the number of gaps of size 1, respectively 2, in all odd versus distinct partitions ofn. We conjecture similar biases and asymptotics, as well as congruences for the number of hooks of fixed length in odd distinct partitions versus self-conjugate partitions. An integral component of the proof of our bias result for hooks of length 3 is a linear inequality involvingq(n), the number of distinct partitions ofn. In this article we also establish effective linear inequalities forq(n) in great generality, a result which is of independent interest. Our methods are both analytic and combinatorial, and our results and conjectures intersect the areas of representation theory, analytic number theory, partition theory, andq-series. In particular, we use a Rademacher-type exact formula forq(n), Wright’s circle method, modularity,q-series transformations, asymptotic methods, and combinatorial arguments.