{"title":"The second largest eigenvalue of some nonnormal Cayley graphs on symmetric groups","authors":"Yuxuan Li, Binzhou Xia, Sanming Zhou","doi":"10.1016/j.jcta.2025.106097","DOIUrl":null,"url":null,"abstract":"A Cayley graph on the symmetric group <mml:math altimg=\"si1.svg\"><mml:msub><mml:mrow><mml:mi>S</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math> 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 <mml:math altimg=\"si1.svg\"><mml:msub><mml:mrow><mml:mi>S</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math>. For <mml:math altimg=\"si2.svg\"><mml:mn>1</mml:mn><mml:mo>≤</mml:mo><mml:mi>r</mml:mi><mml:mo linebreak=\"goodbreak\" linebreakstyle=\"after\"><</mml:mo><mml:mi>k</mml:mi><mml:mo linebreak=\"goodbreak\" linebreakstyle=\"after\"><</mml:mo><mml:mi>n</mml:mi></mml:math>, let <mml:math altimg=\"si267.svg\"><mml:mi>C</mml:mi><mml:mo stretchy=\"false\">(</mml:mo><mml:mi>n</mml:mi><mml:mo>,</mml:mo><mml:mi>k</mml:mi><mml:mo>;</mml:mo><mml:mi>r</mml:mi><mml:mo stretchy=\"false\">)</mml:mo></mml:math> be the set of <ce:italic>k</ce:italic>-cycles of <mml:math altimg=\"si1.svg\"><mml:msub><mml:mrow><mml:mi>S</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math> moving every point in <mml:math altimg=\"si4.svg\"><mml:mo stretchy=\"false\">{</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>…</mml:mo><mml:mo>,</mml:mo><mml:mi>r</mml:mi><mml:mo stretchy=\"false\">}</mml:mo></mml:math>. Recently, Siemons and Zalesski (2022) <ce:cross-ref ref>[26]</ce:cross-ref> posed a conjecture which is equivalent to saying that for any <mml:math altimg=\"si5.svg\"><mml:mi>n</mml:mi><mml:mo>≥</mml:mo><mml:mn>5</mml:mn></mml:math> and <mml:math altimg=\"si2.svg\"><mml:mn>1</mml:mn><mml:mo>≤</mml:mo><mml:mi>r</mml:mi><mml:mo linebreak=\"goodbreak\" linebreakstyle=\"after\"><</mml:mo><mml:mi>k</mml:mi><mml:mo linebreak=\"goodbreak\" linebreakstyle=\"after\"><</mml:mo><mml:mi>n</mml:mi></mml:math> the nonnormal Cayley graph <mml:math altimg=\"si6.svg\"><mml:mrow><mml:mi mathvariant=\"normal\">Cay</mml:mi></mml:mrow><mml:mo stretchy=\"false\">(</mml:mo><mml:msub><mml:mrow><mml:mi>S</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mi>C</mml:mi><mml:mo stretchy=\"false\">(</mml:mo><mml:mi>n</mml:mi><mml:mo>,</mml:mo><mml:mi>k</mml:mi><mml:mo>;</mml:mo><mml:mi>r</mml:mi><mml:mo stretchy=\"false\">)</mml:mo><mml:mo stretchy=\"false\">)</mml:mo></mml:math> on <mml:math altimg=\"si1.svg\"><mml:msub><mml:mrow><mml:mi>S</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math> with connection set <mml:math altimg=\"si267.svg\"><mml:mi>C</mml:mi><mml:mo stretchy=\"false\">(</mml:mo><mml:mi>n</mml:mi><mml:mo>,</mml:mo><mml:mi>k</mml:mi><mml:mo>;</mml:mo><mml:mi>r</mml:mi><mml:mo stretchy=\"false\">)</mml:mo></mml:math> has the Aldous property. Solving this conjecture, we prove that all these graphs have the Aldous property except when (i) <mml:math altimg=\"si7.svg\"><mml:mo stretchy=\"false\">(</mml:mo><mml:mi>n</mml:mi><mml:mo>,</mml:mo><mml:mi>k</mml:mi><mml:mo>,</mml:mo><mml:mi>r</mml:mi><mml:mo stretchy=\"false\">)</mml:mo><mml:mo linebreak=\"goodbreak\" linebreakstyle=\"after\">=</mml:mo><mml:mo stretchy=\"false\">(</mml:mo><mml:mn>6</mml:mn><mml:mo>,</mml:mo><mml:mn>5</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy=\"false\">)</mml:mo></mml:math> or (ii) <ce:italic>n</ce:italic> is odd, <mml:math altimg=\"si8.svg\"><mml:mi>k</mml:mi><mml:mo linebreak=\"goodbreak\" linebreakstyle=\"after\">=</mml:mo><mml:mi>n</mml:mi><mml:mo linebreak=\"goodbreak\" linebreakstyle=\"after\">−</mml:mo><mml:mn>1</mml:mn></mml:math>, and <mml:math altimg=\"si9.svg\"><mml:mn>1</mml:mn><mml:mo>≤</mml:mo><mml:mi>r</mml:mi><mml:mo linebreak=\"goodbreak\" linebreakstyle=\"after\"><</mml:mo><mml:mfrac><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:mfrac></mml:math>. Along the way we determine all irreducible representations of <mml:math altimg=\"si1.svg\"><mml:msub><mml:mrow><mml:mi>S</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math> that can achieve the strictly second largest eigenvalue of <mml:math altimg=\"si10.svg\"><mml:mrow><mml:mi mathvariant=\"normal\">Cay</mml:mi></mml:mrow><mml:mo stretchy=\"false\">(</mml:mo><mml:msub><mml:mrow><mml:mi>S</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mi>C</mml:mi><mml:mo stretchy=\"false\">(</mml:mo><mml:mi>n</mml:mi><mml:mo>,</mml:mo><mml:mi>n</mml:mi><mml:mo linebreak=\"badbreak\" linebreakstyle=\"after\">−</mml:mo><mml:mn>1</mml:mn><mml:mo>;</mml:mo><mml:mi>r</mml:mi><mml:mo stretchy=\"false\">)</mml:mo><mml:mo stretchy=\"false\">)</mml:mo></mml:math> as well as the smallest eigenvalue of this graph.","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"22 1","pages":"106097"},"PeriodicalIF":1.2000,"publicationDate":"2025-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Theory Series A","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1016/j.jcta.2025.106097","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
A Cayley graph on the symmetric group Sn 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 Sn. For 1≤r<k<n, let C(n,k;r) be the set of k-cycles of Sn moving every point in {1,…,r}. Recently, Siemons and Zalesski (2022) [26] posed a conjecture which is equivalent to saying that for any n≥5 and 1≤r<k<n the nonnormal Cayley graph Cay(Sn,C(n,k;r)) on Sn with connection set C(n,k;r) has the Aldous property. Solving this conjecture, we prove that all these graphs have the Aldous property except when (i) (n,k,r)=(6,5,1) or (ii) n is odd, k=n−1, and 1≤r<n2. Along the way we determine all irreducible representations of Sn that can achieve the strictly second largest eigenvalue of Cay(Sn,C(n,n−1;r)) as well as the smallest eigenvalue of this graph.
期刊介绍:
The Journal of Combinatorial Theory publishes original mathematical research concerned with theoretical and physical aspects of the study of finite and discrete structures in all branches of science. Series A is concerned primarily with structures, designs, and applications of combinatorics and is a valuable tool for mathematicians and computer scientists.