On a phenomenon of Turán concerning the summands of partitions (Q1677519)

In a sequence of papers published in 1970's P. Turán established a surprising phenomenon related to integer partitions: if we select at random \(k\) partitions of a large integer \(n\) then in almost all selections with at most \(o(p(n)^k)\) exceptions the proportion of the parts common to all these \(k\) partitions is greater than \(\frac{1}{k}-\delta\), where \(\delta>0\) can be arbitrarily small and \(p(n)\) denotes the total number of integer partitions of \(n\). For a partition of \(n\) into parts \(\lambda_1\geq\dots\geq\lambda_m\), let \(\overline{\Pi(n)}=\{\lambda_1,\dots,\lambda_m\}\) be the multiset formed by these parts. \textit{P. Turán}'s result [Colloq. int. Teorie comb., Roma 1973, Tomo II, 181--200 (1976; Zbl 0359.10041)] is in fact more general. He has proved that, for almost all \(k\)-tuples \((n_1,\dots,n_k)\) satisfying \(n(1+o(1))\leq n_1\leq\dots\leq n_k\leq n(1+o(1))\) and for any \(\delta>0\), we have \(\mid\overline{\Pi(n_1)}\cap\dots\cap\overline{\Pi(n_k)}\mid\geq\left(\frac{1}{k}-\delta\right) \max{(\mid\overline{\Pi(n_1)}\mid,\dots,\mid\overline{\Pi(n_k)}\mid)}\). In this present paper, the authors examine whether this property is still valid whenever the parts belong to a given arithmetic progression. Extending Turán's notations, they study multisets of the form \(\overline{(\Pi(n),a,d)}\) whose parts are \(\equiv\) mod \(d\), where \(1\leq a\leq d\).