On the minimization of multinomial tails and the Gupta-Nagel conjecture

This paper is primarily concerned with the open problem of minimizing the lower tail of the multinomial distribution. During the study of that specific problem, we have developed an approach which reveals itself useful for solving a general class of problems involving multinomial probabilities. Concerning the main problem, we provide a self-contained proof that the minimum of the multinomial lower tail is reached, as conjectured by Gupta and Nagel (Sankhya Ser. B 29 (1967) 1) (within the framework of subset-selection problems) at the equal probability configuration, i.e., when the cell probabilities are equal to one another. We also point out some novel inequalities and general properties involving multinomial probabilities and multinomial coefficients.