• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

关于\(\mathbb{Z}^4\)的凯莱图。

On Cayley graphs of {\bb Z}^4.

作者信息

Baburin Igor A

机构信息

Theoretische Chemie, Technische Universität Dresden, Bergstraße 66c, Dresden, 01062, Germany.

出版信息

Acta Crystallogr A Found Adv. 2020 Sep 1;76(Pt 5):584-588. doi: 10.1107/S2053273320007159. Epub 2020 Jul 16.

DOI:10.1107/S2053273320007159
PMID:32869756
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC7459770/
Abstract

The generating sets of {\bb Z}^4 have been enumerated which consist of integral four-dimensional vectors with components -1, 0, 1 and allow Cayley graphs without edge intersections in a straight-edge embedding in a four-dimensional Euclidean space. Owing to computational restrictions the valency of enumerated graphs has been fixed to 10. Up to isomorphism 58 graphs have been found and characterized by coordination sequences, shortest cycles and automorphism groups. To compute automorphism groups, a novel strategy is introduced that is based on determining vertex stabilizers from the automorphism group of a sufficiently large finite ball cut out from an infinite graph. Six exceptional, rather `dense' graphs have been identified which are locally isomorphic to a five-dimensional cubic lattice within a ball of radius 10. They could be built by either interconnecting interpenetrated three- or four-dimensional cubic lattices and therefore necessarily contain Hopf links between quadrangular cycles. As a consequence, a local combinatorial isomorphism does not extend to a local isotopy.

摘要

已经列举出了(\mathbb{Z}^4)的生成集,其由分量为 -1、0、1 的整数四维向量组成,并且允许在四维欧几里得空间的直边嵌入中没有边交叉的凯莱图。由于计算限制,所列举图的价被固定为 10。在同构意义下,已经找到了 58 个图,并通过配位序列、最短圈和自同构群对其进行了刻画。为了计算自同构群,引入了一种新策略,该策略基于从从无限图中切出的足够大的有限球的自同构群确定顶点稳定子。已经识别出六个特殊的、相当“密集”的图,它们在半径为 10 的球内局部同构于五维立方晶格。它们可以通过互连互穿的三维或四维立方晶格来构建,因此必然在四边形圈之间包含霍普夫链。结果,局部组合同构不会扩展为局部同痕。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/e41d/7459770/2eee587691b3/a-76-00584-fig1.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/e41d/7459770/2eee587691b3/a-76-00584-fig1.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/e41d/7459770/2eee587691b3/a-76-00584-fig1.jpg

相似文献

1
On Cayley graphs of {\bb Z}^4.关于\(\mathbb{Z}^4\)的凯莱图。
Acta Crystallogr A Found Adv. 2020 Sep 1;76(Pt 5):584-588. doi: 10.1107/S2053273320007159. Epub 2020 Jul 16.
2
Hamiltonian decompositions of 4-regular Cayley graphs of infinite abelian groups.无限阿贝尔群的4正则凯莱图的哈密顿分解
J Graph Theory. 2022 Nov;101(3):559-571. doi: 10.1002/jgt.22840. Epub 2022 May 9.
3
Circulants and the Characterization of Vertex-Transitive Graphs.循环矩阵与顶点传递图的特征
J Res Natl Bur Stand (1977). 1983 Nov-Dec;88(6):395-402. doi: 10.6028/jres.088.020.
4
On the Decomposition of Vertex-Transitive Graphs into Multicycles.关于顶点传递图分解为多圈图的研究
J Res Natl Bur Stand (1977). 1983 Nov-Dec;88(6):403-410. doi: 10.6028/jres.088.021.
5
Graph-theoretical characterization of periodicity in crystallographic nets and other infinite graphs.晶体学网络及其他无限图中周期性的图论表征
Acta Crystallogr A. 2005 Sep;61(Pt 5):501-11. doi: 10.1107/S0108767305019963. Epub 2005 Aug 19.
6
Bond topology of chain, ribbon and tube silicates. Part I. Graph-theory generation of infinite one-dimensional arrangements of (TO) tetrahedra.链状、带状和管状硅酸盐的键拓扑结构。第一部分。(TO)四面体无限一维排列的图论生成。
Acta Crystallogr A Found Adv. 2022 May 1;78(Pt 3):212-233. doi: 10.1107/S2053273322001747. Epub 2022 Apr 4.
7
Non-crystallographic nets with freely acting, non-abelian local automorphism groups.具有自由作用的非阿贝尔局部自同构群的非晶体学网络。
Acta Crystallogr A. 2011 May;67(Pt 3):240-51. doi: 10.1107/S0108767311006179. Epub 2011 Mar 25.
8
On transitivity and connectedness of Cayley graphs of gyrogroups.关于回转群凯莱图的传递性和连通性
Heliyon. 2021 May 11;7(5):e07049. doi: 10.1016/j.heliyon.2021.e07049. eCollection 2021 May.
9
Presentations for vertex-transitive graphs.顶点传递图的表示
J Algebr Comb (Dordr). 2022;55(3):795-826. doi: 10.1007/s10801-021-01070-6. Epub 2021 Oct 4.
10
Rectangular groupoids and related structures.矩形广群及相关结构。
Discrete Math. 2013 Jul 6;313(13):1409-1418. doi: 10.1016/j.disc.2013.03.012.

本文引用的文献

1
Isotopy classes for 3-periodic net embeddings.3周期网络嵌入的同伦类
Acta Crystallogr A Found Adv. 2020 May 1;76(Pt 3):275-301. doi: 10.1107/S2053273320000625. Epub 2020 Mar 5.
2
Non-crystallographic nets: characterization and first steps towards a classification.非晶体学网络:表征及分类的初步探索
Acta Crystallogr A Found Adv. 2014 May;70(Pt 3):217-28. doi: 10.1107/S2053273314000631. Epub 2014 Mar 12.
3
Euclidian embeddings of periodic nets: definition of a topologically induced complete set of geometric descriptors for crystal structures.
周期网络的欧几里得嵌入:晶体结构拓扑诱导的几何描述符完整集的定义。
Acta Crystallogr A. 2011 Jan;67(Pt 1):68-86. doi: 10.1107/S0108767310042832. Epub 2010 Dec 15.
4
Edge-transitive lattice nets.边传递格网
Acta Crystallogr A. 2009 Sep;65(Pt 5):360-3. doi: 10.1107/S0108767309026270. Epub 2009 Jul 30.
5
Identification of and symmetry computation for crystal nets.晶体网络的识别与对称性计算
Acta Crystallogr A. 2003 Jul;59(Pt 4):351-60. doi: 10.1107/s0108767303012017. Epub 2003 Jun 26.
6
Corrections to Crystallographic Groups of Four-Dimensional Space by Brown et al. (1978) [New York: Wiley and Sons].布朗等人(1978年)[纽约:威利父子出版公司]对《四维空间的晶体学群》的勘误
Acta Crystallogr A. 2002 May;58(Pt 3):301. doi: 10.1107/s0108767302001368. Epub 2002 Apr 18.