具有六边形和三角形面的多面体,每个顶点周围有三个面

IF 0.7 4区 数学 Q4 MATHEMATICS, APPLIED
Linda Green, Stellen Li
{"title":"具有六边形和三角形面的多面体,每个顶点周围有三个面","authors":"Linda Green,&nbsp;Stellen Li","doi":"10.1007/s00026-024-00722-1","DOIUrl":null,"url":null,"abstract":"<div><p>We analyze polyhedra composed of hexagons and triangles with three faces around each vertex, and their 3-regular planar graphs of edges and vertices, which we call “trihexes”. Trihexes are analogous to fullerenes, which are 3-regular planar graphs whose faces are all hexagons and pentagons. Every trihex can be represented as the quotient of a hexagonal tiling of the plane under a group of isometries generated by <span>\\(180^\\circ \\)</span> rotations. Every trihex can also be described with either one or three “signatures”: triples of numbers that describe the arrangement of the rotocenters of these rotations. Simple arithmetic rules relate the three signatures that describe the same trihex. We obtain a bijection between trihexes and equivalence classes of signatures as defined by these rules. Labeling trihexes with signatures allows us to put bounds on the number of trihexes for a given number of vertices <i>v</i> in terms of the prime factorization of <i>v</i> and to prove a conjecture concerning trihexes that have no “belts” of hexagons.</p></div>","PeriodicalId":50769,"journal":{"name":"Annals of Combinatorics","volume":"29 2","pages":"461 - 490"},"PeriodicalIF":0.7000,"publicationDate":"2024-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00026-024-00722-1.pdf","citationCount":"0","resultStr":"{\"title\":\"Polyhedra with Hexagonal and Triangular Faces and Three Faces Around Each Vertex\",\"authors\":\"Linda Green,&nbsp;Stellen Li\",\"doi\":\"10.1007/s00026-024-00722-1\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>We analyze polyhedra composed of hexagons and triangles with three faces around each vertex, and their 3-regular planar graphs of edges and vertices, which we call “trihexes”. Trihexes are analogous to fullerenes, which are 3-regular planar graphs whose faces are all hexagons and pentagons. Every trihex can be represented as the quotient of a hexagonal tiling of the plane under a group of isometries generated by <span>\\\\(180^\\\\circ \\\\)</span> rotations. Every trihex can also be described with either one or three “signatures”: triples of numbers that describe the arrangement of the rotocenters of these rotations. Simple arithmetic rules relate the three signatures that describe the same trihex. We obtain a bijection between trihexes and equivalence classes of signatures as defined by these rules. Labeling trihexes with signatures allows us to put bounds on the number of trihexes for a given number of vertices <i>v</i> in terms of the prime factorization of <i>v</i> and to prove a conjecture concerning trihexes that have no “belts” of hexagons.</p></div>\",\"PeriodicalId\":50769,\"journal\":{\"name\":\"Annals of Combinatorics\",\"volume\":\"29 2\",\"pages\":\"461 - 490\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2024-10-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://link.springer.com/content/pdf/10.1007/s00026-024-00722-1.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Annals of Combinatorics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s00026-024-00722-1\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annals of Combinatorics","FirstCategoryId":"100","ListUrlMain":"https://link.springer.com/article/10.1007/s00026-024-00722-1","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

摘要

我们分析由六边形和三角形组成的多面体,每个顶点周围有三个面,以及它们的边和顶点的3个正平面图,我们称之为“三面体”。三六边形类似于富勒烯,它们是三规则的平面图形,其面都是六边形和五边形。每个三边形都可以表示为平面在\(180^\circ \)旋转生成的一组等距下的六边形平铺的商。每个三十六进制也可以用一个或三个“特征”来描述:描述这些旋转中心排列的数字三元组。简单的算术规则将描述相同三十六进制的三个签名联系起来。我们得到了由这些规则定义的签名的等价类和三hexes之间的一个双射。用签名标记三边形允许我们根据v的质因数分解为给定顶点v的三边形数量设定界限,并证明一个关于没有六边形“带”的三边形的猜想。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Polyhedra with Hexagonal and Triangular Faces and Three Faces Around Each Vertex

We analyze polyhedra composed of hexagons and triangles with three faces around each vertex, and their 3-regular planar graphs of edges and vertices, which we call “trihexes”. Trihexes are analogous to fullerenes, which are 3-regular planar graphs whose faces are all hexagons and pentagons. Every trihex can be represented as the quotient of a hexagonal tiling of the plane under a group of isometries generated by \(180^\circ \) rotations. Every trihex can also be described with either one or three “signatures”: triples of numbers that describe the arrangement of the rotocenters of these rotations. Simple arithmetic rules relate the three signatures that describe the same trihex. We obtain a bijection between trihexes and equivalence classes of signatures as defined by these rules. Labeling trihexes with signatures allows us to put bounds on the number of trihexes for a given number of vertices v in terms of the prime factorization of v and to prove a conjecture concerning trihexes that have no “belts” of hexagons.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Annals of Combinatorics
Annals of Combinatorics 数学-应用数学
CiteScore
1.00
自引率
0.00%
发文量
56
审稿时长
>12 weeks
期刊介绍: Annals of Combinatorics publishes outstanding contributions to combinatorics with a particular focus on algebraic and analytic combinatorics, as well as the areas of graph and matroid theory. Special regard will be given to new developments and topics of current interest to the community represented by our editorial board. The scope of Annals of Combinatorics is covered by the following three tracks: Algebraic Combinatorics: Enumerative combinatorics, symmetric functions, Schubert calculus / Combinatorial Hopf algebras, cluster algebras, Lie algebras, root systems, Coxeter groups / Discrete geometry, tropical geometry / Discrete dynamical systems / Posets and lattices Analytic and Algorithmic Combinatorics: Asymptotic analysis of counting sequences / Bijective combinatorics / Univariate and multivariable singularity analysis / Combinatorics and differential equations / Resolution of hard combinatorial problems by making essential use of computers / Advanced methods for evaluating counting sequences or combinatorial constants / Complexity and decidability aspects of combinatorial sequences / Combinatorial aspects of the analysis of algorithms Graphs and Matroids: Structural graph theory, graph minors, graph sparsity, decompositions and colorings / Planar graphs and topological graph theory, geometric representations of graphs / Directed graphs, posets / Metric graph theory / Spectral and algebraic graph theory / Random graphs, extremal graph theory / Matroids, oriented matroids, matroid minors / Algorithmic approaches
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信