加载中…
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.

生成讲解博客的中文版本

生成AI智能校验的中文版本