{"title":"利用混合二面群构建正常的 Cayley 图和一种新的非 Cayley 图的双方形 2 弧形传递图","authors":"Daniel R. Hawtin, Cheryl E. Praeger, Jin-Xin Zhou","doi":"10.1007/s10801-024-01300-7","DOIUrl":null,"url":null,"abstract":"<p>A <i>mixed dihedral group</i> is a group <i>H</i> with two disjoint subgroups <i>X</i> and <i>Y</i>, each elementary abelian of order <span>\\(2^n\\)</span>, such that <i>H</i> is generated by <span>\\(X\\cup Y\\)</span>, and <span>\\(H/H'\\cong X\\times Y\\)</span>. In this paper, we give a sufficient condition such that the automorphism group of the Cayley graph <span>\\(\\textrm{Cay}(H,(X\\cup Y){\\setminus }\\{1\\})\\)</span> is equal to <span>\\(H\\rtimes A(H,X,Y)\\)</span>, where <i>A</i>(<i>H</i>, <i>X</i>, <i>Y</i>) is the setwise stabiliser in <span>\\({{\\,\\textrm{Aut}\\,}}(H)\\)</span> of <span>\\(X\\cup Y\\)</span>. We use this criterion to resolve a question of Li et al. (J Aust Math Soc 86:111-122, 2009), by constructing a 2-arc-transitive normal cover of order <span>\\(2^{53}\\)</span> of the complete bipartite graph <span>\\({{\\textbf {K}}}_{16,16}\\)</span> and prove that it is <i>not</i> a Cayley graph.</p>","PeriodicalId":14926,"journal":{"name":"Journal of Algebraic Combinatorics","volume":"27 1","pages":""},"PeriodicalIF":0.6000,"publicationDate":"2024-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Using mixed dihedral groups to construct normal Cayley graphs and a new bipartite 2-arc-transitive graph which is not a Cayley graph\",\"authors\":\"Daniel R. Hawtin, Cheryl E. Praeger, Jin-Xin Zhou\",\"doi\":\"10.1007/s10801-024-01300-7\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>A <i>mixed dihedral group</i> is a group <i>H</i> with two disjoint subgroups <i>X</i> and <i>Y</i>, each elementary abelian of order <span>\\\\(2^n\\\\)</span>, such that <i>H</i> is generated by <span>\\\\(X\\\\cup Y\\\\)</span>, and <span>\\\\(H/H'\\\\cong X\\\\times Y\\\\)</span>. In this paper, we give a sufficient condition such that the automorphism group of the Cayley graph <span>\\\\(\\\\textrm{Cay}(H,(X\\\\cup Y){\\\\setminus }\\\\{1\\\\})\\\\)</span> is equal to <span>\\\\(H\\\\rtimes A(H,X,Y)\\\\)</span>, where <i>A</i>(<i>H</i>, <i>X</i>, <i>Y</i>) is the setwise stabiliser in <span>\\\\({{\\\\,\\\\textrm{Aut}\\\\,}}(H)\\\\)</span> of <span>\\\\(X\\\\cup Y\\\\)</span>. We use this criterion to resolve a question of Li et al. (J Aust Math Soc 86:111-122, 2009), by constructing a 2-arc-transitive normal cover of order <span>\\\\(2^{53}\\\\)</span> of the complete bipartite graph <span>\\\\({{\\\\textbf {K}}}_{16,16}\\\\)</span> and prove that it is <i>not</i> a Cayley graph.</p>\",\"PeriodicalId\":14926,\"journal\":{\"name\":\"Journal of Algebraic Combinatorics\",\"volume\":\"27 1\",\"pages\":\"\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2024-02-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Algebraic Combinatorics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s10801-024-01300-7\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Algebraic Combinatorics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10801-024-01300-7","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
摘要
混合二面群是一个群 H,它有两个互不相交的子群 X 和 Y,每个子群都是阶为 \(2^n\) 的初等无常群,这样 H 由 \(X\cup Y\) 和 \(H/H'\cong X\times Y\) 生成。在本文中,我们给出了一个充分条件,即 Cayley 图的自(textrm{Cay}(H、(X\cup Y){\setminus }\{1\})\) 等于 \(H\rtimes A(H,X,Y)\),其中 A(H,X,Y)是 \(X\cup Y\) 的 \({{\,\textrm{Aut}\,}}(H)\) 中的集合稳定器。我们利用这个标准解决了 Li 等人(J Aust Math Soc 86:111-122, 2009)提出的一个问题,即构造了完整双向图 \({{\textbf {K}}}_{16,16}\) 的一个阶为 \(2^{53}) 的 2-arc-transitive normal cover,并证明它不是一个 Cayley 图。
Using mixed dihedral groups to construct normal Cayley graphs and a new bipartite 2-arc-transitive graph which is not a Cayley graph
A mixed dihedral group is a group H with two disjoint subgroups X and Y, each elementary abelian of order \(2^n\), such that H is generated by \(X\cup Y\), and \(H/H'\cong X\times Y\). In this paper, we give a sufficient condition such that the automorphism group of the Cayley graph \(\textrm{Cay}(H,(X\cup Y){\setminus }\{1\})\) is equal to \(H\rtimes A(H,X,Y)\), where A(H, X, Y) is the setwise stabiliser in \({{\,\textrm{Aut}\,}}(H)\) of \(X\cup Y\). We use this criterion to resolve a question of Li et al. (J Aust Math Soc 86:111-122, 2009), by constructing a 2-arc-transitive normal cover of order \(2^{53}\) of the complete bipartite graph \({{\textbf {K}}}_{16,16}\) and prove that it is not a Cayley graph.
期刊介绍:
The Journal of Algebraic Combinatorics provides a single forum for papers on algebraic combinatorics which, at present, are distributed throughout a number of journals. Within the last decade or so, algebraic combinatorics has evolved into a mature, established and identifiable area of mathematics. Research contributions in the field are increasingly seen to have substantial links with other areas of mathematics.
The journal publishes papers in which combinatorics and algebra interact in a significant and interesting fashion. This interaction might occur through the study of combinatorial structures using algebraic methods, or the application of combinatorial methods to algebraic problems.