On the average size of an \((\overline{s},\overline{t})\)-core partition (Q2332974)

By considering a bijection between the lattice paths in \((s,t)\) a yin-yang diagram and \((\overline{s},\overline{t})\)-cores, \textit{C. Bessenrodt} and \textit{J. B. Olsson} [J. Algebra 306, No. 1, 3--16 (2006; Zbl 1105.20009)] obtained an explicit formula for the number of \((\overline{s},\overline{t})\)-cores, where \(s\) and \(t\) are two coprime odd integers. In the present paper, the authors extend the aforementioned combinatorial structures to all possible coprime pairs \((s,t)\), then they obtain a unified formula for the number of \((\overline{s},\overline{t})\)-cores. Moreover, based on similar techniques of \textit{W. Y. C. Chen} et al. [Proc. Am. Math. Soc. 144, No. 4, 1391--1399 (2016; Zbl 1331.05030)], the authors also derive two formulas for the average size of an \((\overline{s},\overline{t})\)-core, which depend on the parity of \(s\).