Journal of Algebraic Combinatorics最新文献

筛选
英文 中文
Bi-primitive 2-arc-transitive bi-Cayley graphs 双元 2-弧-直角双 Cayley 图形
IF 0.8 3区 数学
Journal of Algebraic Combinatorics Pub Date : 2024-03-02 DOI: 10.1007/s10801-024-01297-z
Jing Jian Li, Xiao Qian Zhang, Jin-Xin Zhou
{"title":"Bi-primitive 2-arc-transitive bi-Cayley graphs","authors":"Jing Jian Li, Xiao Qian Zhang, Jin-Xin Zhou","doi":"10.1007/s10801-024-01297-z","DOIUrl":"https://doi.org/10.1007/s10801-024-01297-z","url":null,"abstract":"<p>A bipartite graph <span>(Gamma )</span> is a <i>bi-Cayley graph</i> over a group <i>H</i> if <span>(Hleqslant textrm{Aut}Gamma )</span> acts regularly on each part of <span>(Gamma )</span>. A bi-Cayley graph <span>(Gamma )</span> is said to be a <i>normal bi-Cayley graph over H</i> if <span>(Hunlhd textrm{Aut}Gamma )</span>, and <i>bi-primitive</i> if the bipartition preserving subgroup of <span>(textrm{Aut}Gamma )</span> acts primitively on each part of <span>(Gamma )</span>. In this paper, a classification is given for 2-arc-transitive bi-Cayley graphs which are bi-primitive and non-normal.</p>","PeriodicalId":14926,"journal":{"name":"Journal of Algebraic Combinatorics","volume":"177 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2024-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140018431","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On regular sets in Cayley graphs 关于 Cayley 图中的规则集合
IF 0.8 3区 数学
Journal of Algebraic Combinatorics Pub Date : 2024-03-02 DOI: 10.1007/s10801-024-01298-y
Xiaomeng Wang, Shou-Jun Xu, Sanming Zhou
{"title":"On regular sets in Cayley graphs","authors":"Xiaomeng Wang, Shou-Jun Xu, Sanming Zhou","doi":"10.1007/s10801-024-01298-y","DOIUrl":"https://doi.org/10.1007/s10801-024-01298-y","url":null,"abstract":"<p>Let <span>(Gamma = (V, E))</span> be a graph and <i>a</i>, <i>b</i> nonnegative integers. An (<i>a</i>, <i>b</i>)-regular set in <span>(Gamma )</span> is a nonempty proper subset <i>D</i> of <i>V</i> such that every vertex in <i>D</i> has exactly <i>a</i> neighbours in <i>D</i> and every vertex in <span>(V{setminus }D)</span> has exactly <i>b</i> neighbours in <i>D</i>. A (0, 1)-regular set is called a perfect code, an efficient dominating set, or an independent perfect dominating set. A subset <i>D</i> of a group <i>G</i> is called an (<i>a</i>, <i>b</i>)-regular set of <i>G</i> if it is an (<i>a</i>, <i>b</i>)-regular set in some Cayley graph of <i>G</i>, and an (<i>a</i>, <i>b</i>)-regular set in a Cayley graph of <i>G</i> is called a subgroup (<i>a</i>, <i>b</i>)-regular set if it is also a subgroup of <i>G</i>. In this paper, we study (<i>a</i>, <i>b</i>)-regular sets in Cayley graphs with a focus on (0, <i>k</i>)-regular sets, where <span>(k ge 1)</span> is an integer. Among other things, we determine when a non-trivial proper normal subgroup of a group is a (0, <i>k</i>)-regular set of the group. We also determine all subgroup (0, <i>k</i>)-regular sets of dihedral groups and generalized quaternion groups. We obtain necessary and sufficient conditions for a hypercube or the Cartesian product of <i>n</i> copies of the cycle of length <i>p</i> to admit (0, <i>k</i>)-regular sets, where <i>p</i> is an odd prime. Our results generalize several known results from perfect codes to (0, <i>k</i>)-regular sets.</p>","PeriodicalId":14926,"journal":{"name":"Journal of Algebraic Combinatorics","volume":"261 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2024-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140018476","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Power graphs of a class of completely 0-simple semigroups 一类完全 0 简单半群的幂图
IF 0.8 3区 数学
Journal of Algebraic Combinatorics Pub Date : 2024-02-26 DOI: 10.1007/s10801-024-01306-1
Yanliang Cheng, Yong Shao, Lingli Zeng
{"title":"Power graphs of a class of completely 0-simple semigroups","authors":"Yanliang Cheng, Yong Shao, Lingli Zeng","doi":"10.1007/s10801-024-01306-1","DOIUrl":"https://doi.org/10.1007/s10801-024-01306-1","url":null,"abstract":"<p>We first determine the structure of the power digraphs of completely 0-simple semigroups, and then some properties of their power graphs are given. As the main result in this paper, using Cameron and Ghosh’s theorem about power graphs of abelian groups, we obtain a characterization that two <span>(G^{0})</span>-normal completely 0-simple orthodox semigroups <i>S</i> and <i>T</i> with abelian group <span>(mathcal {H})</span>-classes are isomorphic based on their power graphs. We also present an algorithm to determine that <i>S</i> and <i>T</i> are isomorphic or not.</p>","PeriodicalId":14926,"journal":{"name":"Journal of Algebraic Combinatorics","volume":"22 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2024-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140006981","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Alternating groups as products of cycle classes - II 作为周期类乘积的交替群 - II
IF 0.8 3区 数学
Journal of Algebraic Combinatorics Pub Date : 2024-02-26 DOI: 10.1007/s10801-024-01305-2
Harish Kishnani, Rijubrata Kundu, Sumit Chandra Mishra
{"title":"Alternating groups as products of cycle classes - II","authors":"Harish Kishnani, Rijubrata Kundu, Sumit Chandra Mishra","doi":"10.1007/s10801-024-01305-2","DOIUrl":"https://doi.org/10.1007/s10801-024-01305-2","url":null,"abstract":"<p>Given integers <span>(k,lge 2)</span>, where either <i>l</i> is odd or <i>k</i> is even, let <i>n</i>(<i>k</i>, <i>l</i>) denote the largest integer <i>n</i> such that each element of <span>(A_n)</span> is a product of <i>k</i> many <i>l</i>-cycles. M. Herzog, G. Kaplan and A. Lev conjectured that <span>(lfloor frac{2kl}{3} rfloor le n(k,l)le lfloor frac{2kl}{3}rfloor +1)</span> [Herzog et al. in J Combin Theory Ser A, 115:1235-1245 2008]. It is known that the conjecture holds when <span>(k=2,3,4)</span>. Moreover, it is also true when <span>(3mid l)</span>. In this article, we determine the exact value of <i>n</i>(<i>k</i>, <i>l</i>) when <span>(3not mid l)</span> and <span>(kge 5)</span>. As an immediate consequence, we get that <span>(n(k,l)&lt;lfloor frac{2kl}{3}rfloor )</span> when <span>(kge 5)</span> and <span>(3not mid l)</span>, which shows that the above conjecture is not true in general. In fact in this case, the difference between the exact value of <i>n</i>(<i>k</i>, <i>l</i>) and the conjectured value grows linearly in terms of <i>k</i>. Our results complete the determination of <i>n</i>(<i>k</i>, <i>l</i>) for all values of <i>k</i> and <i>l</i>.</p>","PeriodicalId":14926,"journal":{"name":"Journal of Algebraic Combinatorics","volume":"41 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2024-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139969121","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Anti-dendriform algebras, new splitting of operations and Novikov-type algebras 反树枝形代数、新拆分运算和诺维科夫型代数
IF 0.8 3区 数学
Journal of Algebraic Combinatorics Pub Date : 2024-02-26 DOI: 10.1007/s10801-024-01303-4
{"title":"Anti-dendriform algebras, new splitting of operations and Novikov-type algebras","authors":"","doi":"10.1007/s10801-024-01303-4","DOIUrl":"https://doi.org/10.1007/s10801-024-01303-4","url":null,"abstract":"<h3>Abstract</h3> <p>We introduce the notion of an anti-dendriform algebra as a new approach of splitting the associativity. It is characterized as the algebra with two multiplications giving their left and right multiplication operators, respectively, such that the opposites of these operators define a bimodule structure on the sum of these two multiplications, which is associative. This justifies the terminology due to a closely analogous characterization of a dendriform algebra. The notions of anti-<span> <span>({mathcal {O}})</span> </span>-operators and anti-Rota–Baxter operators on associative algebras are introduced to interpret anti-dendriform algebras. In particular, there are compatible anti-dendriform algebra structures on associative algebras with nondegenerate commutative Connes cocycles. There is an important observation that there are correspondences between certain subclasses of dendriform and anti-dendriform algebras in terms of <em>q</em>-algebras. As a direct consequence, we give the notion of Novikov-type dendriform algebras as an analogue of Novikov algebras for dendriform algebras, whose relationship with Novikov algebras is consistent with the one between dendriform and pre-Lie algebras. Finally, we extend to provide a general framework of introducing the notions of analogues of anti-dendriform algebras, which interprets a new splitting of operations.</p>","PeriodicalId":14926,"journal":{"name":"Journal of Algebraic Combinatorics","volume":"7 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2024-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140006966","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Resistance diameters and critical probabilities of Cayley graphs on irreducible complex reflection groups 不可还原复反射群上 Cayley 图的电阻直径和临界概率
IF 0.8 3区 数学
Journal of Algebraic Combinatorics Pub Date : 2024-02-25 DOI: 10.1007/s10801-024-01302-5
Maksim Vaskouski, Hanna Zadarazhniuk
{"title":"Resistance diameters and critical probabilities of Cayley graphs on irreducible complex reflection groups","authors":"Maksim Vaskouski, Hanna Zadarazhniuk","doi":"10.1007/s10801-024-01302-5","DOIUrl":"https://doi.org/10.1007/s10801-024-01302-5","url":null,"abstract":"<p>We consider networks on minimal Cayley graphs of irreducible complex reflection groups <i>G</i>(<i>m</i>, <i>p</i>, <i>n</i>). We show that resistance diameters of these graphs have asymptotic <span>(Theta (1/n))</span> as <span>(nrightarrow infty )</span> under fixed <i>m</i>, <i>p</i>. Non-trivial lower and upper asymptotic bounds for critical probabilities of percolation for there appearing a giant connected component have been obtained.</p>","PeriodicalId":14926,"journal":{"name":"Journal of Algebraic Combinatorics","volume":"26 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2024-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139947189","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Multi-part cross-intersecting families 多部分交叉族
IF 0.8 3区 数学
Journal of Algebraic Combinatorics Pub Date : 2024-02-25 DOI: 10.1007/s10801-024-01301-6
Yuanxiao Xi, Xiangliang Kong, Gennian Ge
{"title":"Multi-part cross-intersecting families","authors":"Yuanxiao Xi, Xiangliang Kong, Gennian Ge","doi":"10.1007/s10801-024-01301-6","DOIUrl":"https://doi.org/10.1007/s10801-024-01301-6","url":null,"abstract":"<p>Let <span>({mathcal {A}}subseteq {[n]atopwithdelims ()a})</span> and <span>({mathcal {B}}subseteq {[n]atopwithdelims ()b})</span> be two families of subsets of [<i>n</i>], we say <span>({mathcal {A}})</span> and <span>({mathcal {B}})</span> are cross-intersecting if <span>(Acap Bne emptyset )</span> for all <span>(Ain {mathcal {A}})</span>, <span>(Bin {mathcal {B}})</span>. In this paper, we study cross-intersecting families in the multi-part setting. By characterizing the independent sets of vertex-transitive graphs and their direct products, we determine the sizes and structures of maximum-sized multi-part cross-intersecting families. This generalizes the results of Hilton’s (J Lond Math Soc 15(2):369–376, 1977) and Frankl–Tohushige’s (J Comb Theory Ser A 61(1):87–97, 1992) on cross-intersecting families in the single-part setting.</p>","PeriodicalId":14926,"journal":{"name":"Journal of Algebraic Combinatorics","volume":"35 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2024-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139969217","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Common transversals and complements in abelian groups 无边群中的公共横截面和补集
IF 0.8 3区 数学
Journal of Algebraic Combinatorics Pub Date : 2024-02-24 DOI: 10.1007/s10801-024-01299-x
{"title":"Common transversals and complements in abelian groups","authors":"","doi":"10.1007/s10801-024-01299-x","DOIUrl":"https://doi.org/10.1007/s10801-024-01299-x","url":null,"abstract":"<h3>Abstract</h3> <p>Given a finite abelian group <em>G</em> and cyclic subgroups <em>A</em>, <em>B</em>, <em>C</em> of <em>G</em> of the same order, we find necessary and sufficient conditions for <em>A</em>, <em>B</em>, <em>C</em> to admit a common transversal for the cosets they afford. For an arbitrary number of cyclic subgroups, we give a sufficient criterion when there exists a common complement. Moreover, in several cases where a common transversal exists, we provide concrete constructions. </p>","PeriodicalId":14926,"journal":{"name":"Journal of Algebraic Combinatorics","volume":"1 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2024-02-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139947110","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Using mixed dihedral groups to construct normal Cayley graphs and a new bipartite 2-arc-transitive graph which is not a Cayley graph 利用混合二面群构建正常的 Cayley 图和一种新的非 Cayley 图的双方形 2 弧形传递图
IF 0.8 3区 数学
Journal of Algebraic Combinatorics Pub Date : 2024-02-23 DOI: 10.1007/s10801-024-01300-7
Daniel R. Hawtin, Cheryl E. Praeger, Jin-Xin Zhou
{"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":"https://doi.org/10.1007/s10801-024-01300-7","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>(Xcup Y)</span>, and <span>(H/H'cong Xtimes Y)</span>. In this paper, we give a sufficient condition such that the automorphism group of the Cayley graph <span>(textrm{Cay}(H,(Xcup Y){setminus }{1}))</span> is equal to <span>(Hrtimes 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>(Xcup 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.8,"publicationDate":"2024-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139947111","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A note on “Largest independent sets of certain regular subgraphs of the derangement graph” 关于 "错乱图的某些规则子图的最大独立集 "的说明
IF 0.8 3区 数学
Journal of Algebraic Combinatorics Pub Date : 2024-02-23 DOI: 10.1007/s10801-024-01304-3
Yuval Filmus, Nathan Lindzey
{"title":"A note on “Largest independent sets of certain regular subgraphs of the derangement graph”","authors":"Yuval Filmus, Nathan Lindzey","doi":"10.1007/s10801-024-01304-3","DOIUrl":"https://doi.org/10.1007/s10801-024-01304-3","url":null,"abstract":"<p>Let <span>(D_{n,k})</span> be the set of all permutations of the symmetric group <span>(S_n)</span> that have no cycles of length <i>i</i> for all <span>(1 le i le k)</span>. In the paper mentioned above, Ku, Lau, and Wong prove that the set of all the largest independent sets of the Cayley graph <span>(text {Cay}(S_n,D_{n,k}))</span> is equal to the set of all the largest independent sets in the derangement graph <span>(text {Cay}(S_n,D_{n,1}))</span>, provided <i>n</i> is sufficiently large in terms of <i>k</i>. We give a simpler proof that holds for all <i>n</i>, <i>k</i> and also applies to the alternating group.</p>","PeriodicalId":14926,"journal":{"name":"Journal of Algebraic Combinatorics","volume":"174 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2024-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139947020","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书