首页/论文/2005.14285

arXiv 2005.142852020-05math.MG

The Edge-transitive Polytopes that are not Vertex-transitive

Frank Göring, Martin Winter

英文摘要：

In 3-dimensional Euclidean space there exist two exceptional polyhedra, the rhombic dodecahedron and the rhombic triacontahedron, the only known polytopes (besides polygons) that are edge-transitive without being vertex-transitive. We show that these polyhedra do not have higher-dimensional analogues, that is, that in dimension $d\ge 4$, edge-transitivity of convex polytopes implies vertex-transitivity. More generally, we give a classification of all convex polytopes which at the same time have all edges of the same length, an edge in-sphere and a bipartite edge-graph. We show that any such polytope in dimension $d\ge 4$ is vertex-transitive.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Eigenpolytopes, Spectral Polytopes and Edge-Transitivity

Starting from a finite simple graph $G$, for each eigenvalue $θ$ of its adjacency matrix one can construct a convex polytope $P_G(θ)$, the so called $θ$-eigenpolytop of $G$. For some polytopes this technique can be used to reconstruct the polytopes from its edge-graph. Such polytopes (we shall call them spectral) are still badly understood. We give an overview of the literature for eigenpolytopes and spectral polytopes. We introduce a geometric condition by which to prove that a given polytope is spectral (more exactly, $θ_2$-spectral). We apply this criterion to the edge-transitive polytopes.…

2020-09-04math.MG

多面体的半对称图

Semisymmetric Graphs from Polytopes

每一个有限的、自对偶的、正则（或手征）的{3，q，3}型4-多面体都有一个三价3-传递（或2-传递）中间层图。在这里，通过丢弃自对偶，我们得到了半对称三价图（边传递但不是顶点传递）的构造。特别地，Gray图作为某个泛局部环面正则4-多胞形的中间层图而出现。

2006-06-19math.COmath.MG

高亏格的点传递多面体I

Vertex-Transitive Polyhedra of Higher Genus, I

自从Gruenbaum和Shephard在1984年研究了具有正亏格和顶点传递对称性的无自交多面体以来，欧氏空间中这类物体的完全分类问题一直是开放的。根据Gevay、Schulte和Wills最近的一篇文章，我们现在知道亏格范围g>=2只能容纳有限数量的顶点传递多面体，它们都具有旋转柏拉图对称性。在这篇文章中，我们证明了对称群也必须在顶点上作用简单传递。此外，旋转四面体对称的情况完全解决了-唯一的例子是已知的。

2015-02-26math.MG

A Classification of Non-Compact Coxeter Polytopes with $n+3$ Facets and One Non-Simple Vertex

In this paper we state a full classification for Coxeter polytopes in $\mathbb{H}^{n}$ with $n+3$ facets which are non-compact and have precisely one non-simple vertex.

2016-02-04math.MG

Classification of Vertex-Transitive Zonotopes

We give a full classification of vertex-transitive zonotopes. We prove that a vertex-transitive zonotope is a $Γ$-permutahedron for some finite reflection group $Γ\subset\mathrm{O}(\mathbb R^d)$. The same holds true for zonotopes in which all vertices are on a common sphere, and all edges are of the same length (which we call homogeneous zonotopes). The classification of these then follows from the classification of finite reflection groups. We proof that root systems can be characterized as those centrally symmetric sets of vectors, for which all intersections with half-spaces, that contain e…

2020-05-30math.MG

在多面体中，围绕某个顶点的小球使周长最小化

In polytopes, small balls about some vertex minimize perimeter

在R^n+1中的凸多胞体P^n（的曲面）中，对于较小的预定体积，关于某个顶点的测地球使周长最小化。这一修正修正纠正了定理3.8证明中关于质量束缚的论证中的一个错误。

2006-12-23math.MG

更多相关论文收起更多论文

半正则多面体与合并C-群

Semiregular Polytopes and Amalgamated C-groups

在经典的情形下，如果一个凸多胞体的小平面是正则的，并且它的对称群在顶点上是传递的，则称它是半正则的。研究了具有抽象正则刻面的半正则抽象多面体，其组合自同构群在顶点上可传递。我们分析了自同构群的结构，特别是在多面体与两种规则的方面发生在一个“交替”的方式。特别地，我们利用群合并证明了：给定两个相容的n-多面体P和Q，存在一个泛抽象半正则（n+1）-多面体，它是由P和Q的交替拷贝“自由”组合而成的。我们还采用模约化技术，从有限域上的反射群构造有限半正则多面体。

2012-01-26math.COmath.MG

无限点传递图的有限Voronoi分解

Finite Voronoi decompositions of infinite vertex transitive graphs

本文研究了任意无限顶点可迁图G的Voronoi分解。特别是，我们感兴趣的是以下问题：什么是最大数量的Voronoi细胞，必须是无限的，给予足够（但）许多Voronoi网站是足够远的对方？我们称这个数为生存数s（G）。图的生存数在覆盖方面有另一个特征，我们用它来证明s（G）总是至少为2。生存数不是拟等距不变量，但s（G）是否有限仍是未知数。我们证明了所有多项式增长的点传递图都有一个有限的s（G）;有无穷多个端点的点传递图都有一个无限的s（G）;有指数增长性的点灯图LL（Z）有一个有限的s（G）;而Liouville的点灯图LL（Z ^2）有一个无限的s（G）.

2011-11-02math.GRmath.MG

顶点生成的多胞体

Vertex generated polytopes

本文定义了“顶点生成”多胞体类，证明其包含所有 zonotopes 且在二维中稠密，并引入参数衡量多胞体与该类的距离，证明参数较小时强覆盖性质成立。

2024-07-30math.COmath.MG

由顶点-面关联计算多面体的面格

Computing the Face Lattice of a Polytope from its Vertex-Facet Incidences

本文给出了一个由凸多胞体P的顶点-面在时间O上的关联度构造其面格Hasse图的算法（min{n，m}*a*f），其中n是顶点的数目，m是小平面的数目，a是顶点-小平面入射的数目，并且f是P的面的总数。这改进了Fukuda和Rosta（1994）的结果，他描述了一种算法，用于在O（min{n，m}*d*f^2）步内枚举d-多面体的所有面。对于简单的或单纯的d-多面体，我们的算法可以专门运行在时间O（d*a*f）。此外，该算法的其他原子格的应用进行了讨论，例如，面向定向拟阵的格。

2002-08-14math.COmath.MG

Characterizing a vertex-transitive graph by a large ball

It is well-known that a complete Riemannian manifold M which is locally isometric to a symmetric space is covered by a symmetric space. Here we prove that a discrete version of this property (called local to global rigidity) holds for a large class of vertex-transitive graphs, including Cayley graphs of torsion-free lattices in simple Lie groups, and Cayley graph of torsion-free virtually nilpotent groups. By contrast, we exhibit various examples of Cayley graphs of finitely presented groups (e.g. SL(4,Z)) which fail to have this property, answering a question of Benjamini, Ellis, and Georgako…

2019-02-17math.GRmath.MG

关于大直径有限点传递图的标度极限

On the scaling limit of finite vertex transitive graphs with large diameter

设$(X_n)$是一个无界的有限连通点可迁图序列，使得对于某些$q>0$，有$ |X_n | = o(diam(X_n)^q)$.我们表明，采取一个子序列，并重新缩放后的直径，序列$(X_n)$收敛在Gromov Hausdorff距离的尺寸$<q$环面，配备了一些不变的芬斯勒度量。证明依赖于最近的定量版本格罗莫夫定理的群体与多项式增长获得Breuillard，绿色和陶。如果$X_n$只是粗略地传递和$|X_n| = o\bigl({diam(X_n)^δ}\bigr)$的$δ> 1$足够小，我们证明，这一次的初等手段，即$(X_n)$收敛到一个圆。

2014-08-26math.COmath.GRmath.MG

Lattices from tight frames and vertex transitive graphs

We show that real tight frames that generate lattices must be rational, and use this observation to describe a construction of lattices from vertex transitive graphs. In the case of irreducible group frames, we show that the corresponding lattice is always strongly eutactic. This is the case for the more restrictive class of distance transitive graphs. We show that such lattices exist in arbitrarily large dimensions and demonstrate examples arising from some notable families of graphs. In particular, some well-known root lattices and those related to them can be recovered this way. We discuss …

2019-08-18cs.NAmath.COmath.MG

单形、立方体和交叉多面体之间的顶点映射

Vertex maps between simplices, cubes, and crosspolytopes

我们研究了所有仿射映射的多面体的顶点（也称为顶点）。hom-polytopes）之间的高维单纯形，立方体，和crosspolytopes。对一般hom-polytopes的系统研究始于[3]。对这类顶点的研究是凸多胞体拓扑同调理论的经典方面。即使对于简单的源多边形和目标多边形，也会很快遇到开放问题。Hom（simplex_m，-）和Hom（-，cube_n）的顶点很容易理解。本文描述了Hom（box_m，simplex_n），Hom（diamond_m，simplex_n）和Hom（diamond_m，diamond_n）的顶点集.我们的论点中的涌现模式让人想起同调代数中的图追逐。

2014-03-02math.ATmath.COmath.MG