math.CA — Classical Analysis and ODEs
A Proof of McLeod's 1959 Conjecture on Complete Homogeneous Symmetric Ratios
We prove McLeod's (1959) conjecture that is subadditive for all and , where is the complete homogeneous symmetric polynomial of degree (J. B. McLeod, "On four inequalities in symmetric functions", Proc. Edinburgh Math. Soc., 1959). We first prove that the ratio is convex, and our proof takes an unexpected detour through queuing theory. The geometric mean of consecutive such ratios equals McLeod's conjectured function, but geometric means of convex functions need not be convex. Our second and decisive step is a tensorization trick that couples neighboring ratios tightly enough to make their geometric mean convex.
A mix of human-written and AI-generated textHuman understanding: all partsMcLeod inequalityclosed queuing networkcomplete homogeneous symmetric polynomialconvexitydiscrete Poincare inequality