A Cayley graph on the symmetric group is said to have the Aldous property if its strictly second largest eigenvalue (that is, the largest eigenvalue strictly smaller than the degree) is attained by the standard representation of . For , let be the set of -cycles of moving every point in . Recently, Siemons and Zalesski [J. Algebraic Combin. 55 (2022) 989–1005] posed a conjecture which is equivalent to saying that for any and the nonnormal Cayley graph on with connection set has the Aldous property. Solving this conjecture, we prove that all these graphs have the Aldous property except when (i) or (ii) is odd, , and . Along the way we determine all irreducible representations of that can achieve the strictly second largest eigenvalue of as well as the smallest eigenvalue of this graph.

生成讲解博客的中文版本

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