Maximizing-pattern conjecture for numerical ranges of cyclic shift matrices
Let S(a1,…,an)S(a_1,\dots,a_n)S(a1,…,an) denote the n×nn\times nn×n cyclic shift matrix with weights a1,…,ana_1,\dots,a_na1,…,an. For n≥2n\geq 2n≥2, let 0≤a1≤⋯≤an0\leq a_1\leq\cdots\leq a_n0≤a1≤⋯≤an and set … For a permutation…