Greedy cyclic products are maximal
Let mmm be a positive integer, let am=(a0,a1,…,am−1)∈(0,∞)m\boldsymbol{a}_m=(a_0,a_1,\dots,a_{m-1})\in(0,\infty)^mam=(a0,a1,…,am−1)∈(0,∞)m have non-increasing entries, let Sm\mathcal{S}_mSm be the set of permutations of…