Polynomiality of some hook-content summations for doubled distinct and   self-conjugate partitions
  In 2009, the first author proved the Nekrasov-Okounkov formula on hook lengths for integer partitions by using an identity of Macdonald in the framework of type $\widetilde A$ affine root systems, and conjectured that some summations over the set of all partitions of size $n$ are always polynomials in $n$. This conjecture was generalized and proved by Stanley. Recently, P\'etr\'eolle derived two Nekrasov-Okounkov type formulas for $\widetilde C$ and $\widetilde C\,\check{}$ which involve doubled distinct and self-conjugate partitions. Inspired by all those previous works, we establish the polynomiality of some hook-content summations for doubled distinct and self-conjugate partitions. 
Guo-Niu Han and Huan Xiong
math.CO