arXiv math/04044652004-04-26math.MGmath.CO

Triangulated Manifolds with Few Vertices: Centrally Symmetric Spheres and Products of Spheres

Frank H. Lutz

备注：: 26 pages, 8 figures

英文摘要：

The aim of this paper is to give a survey of the known results concerning centrally symmetric polytopes, spheres, and manifolds. We further enumerate nearly neighborly centrally symmetric spheres and centrally symmetric products of spheres with dihedral or cyclic symmetry on few vertices, and we present an infinite series of vertex-transitive nearly neighborly centrally symmetric 3-spheres.

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

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

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

继续探索

相关论文

Enumeration and random realization of triangulated surfaces

We discuss different approaches for the enumeration of triangulated surfaces. In particular, we enumerate all triangulated surfaces with 9 and 10 vertices. We also show how geometric realizations of orientable surfaces with few vertices can be obtained by choosing coordinates randomly.

2006-04-02math.COmath.MG

Centrally symmetric polytopes with many faces

We present explicit constructions of centrally symmetric polytopes with many faces: first, we construct a d-dimensional centrally symmetric polytope P with about (1.316)^d vertices such that every pair of non-antipodal vertices of P spans an edge of P, second, for an integer k>1, we construct a d-dimensional centrally symmetric polytope P of an arbitrarily high dimension d and with an arbitrarily large number N of vertices such that for some 0 < delta_k < 1 at least (1-delta_k^d) {N choose k} k-subsets of the set of vertices span faces of P, and third, for an integer k>1 and a>0, we construct …

2011-11-18math.COmath.MG

Explicit constructions of centrally symmetric k-neighborly polytopes and large strictly antipodal sets

We present explicit constructions of centrally symmetric 2-neighborly d-dimensional polytopes with about 3^{d/2} = (1.73)^d vertices and of centrally symmetric k-neighborly d-polytopes with about 2^{c_k d} vertices where c_k=3/20 k^2 2^k. Using this result, we construct for a fixed k > 1 and arbitrarily large d and N, a centrally symmetric d-polytope with N vertices that has at least (1-k^2 (gamma_k)^d) binom(N, k) faces of dimension k-1, where gamma_2=1/\sqrt{3} = 0.58 and gamma_k = 2^{-3/{20k^2 2^k}} for k > 2. Another application is a construction of a set of 3^{d/2 -1}-1 points in R^d ever…

2012-04-19math.COmath.MG

A centrally symmetric version of the cyclic polytope

We define a centrally symmetric analogue of the cyclic polytope and study its facial structure. We conjecture that our polytopes provide asymptotically the largest number of faces in all dimensions among all centrally symmetric polytopes with n vertices of a given even dimension d=2k when d is fixed and n grows. For a fixed even dimension d=2k and an integer 0< j <k we prove that the maximum possible number of j-dimensional faces of a centrally symmetric d-dimensional polytope with n vertices is at least (c_j(d)+o(1)) {n \choose j+1} for some c_j(d)>0 and at most (1-2^{-d}+o(1)){n \choose j+1}…

2006-11-28math.COmath.MG

Polyhedral Embeddings and Immersions of Many Triangulated 2-Manifolds with Few Vertices

This article presents an improvement and extension of the heuristic first presented by Hougardy, Lutz, and Zelke in 2010 for realizing triangulated orientable surfaces with few vertices by a simplex-wise linear embedding. The improvement consists in the applicability to non-orientable surfaces (simplex-wise linear immersions) as well as symmetric realizations. With the help of our algorithm, numerous - often symmetric - realizations of non-orientable surfaces with the minimal number or few vertices have been obtained for the first time. These examples include the the Projective Plane with one …

2016-03-15math.GTmath.MG

Many Triangulated 3-Spheres

We construct 2^{Ω(n^{5/4})} combinatorial types of triangulated 3-spheres on n vertices. Since by a result of Goodman and Pollack (1986) there are no more than 2^{O(n log n)} combinatorial types of simplicial 4-polytopes, this proves that asymptotically, there are far more combinatorial types of triangulated 3-spheres than of simplicial 4-polytopes on n vertices. This complements results of Kalai (1988), who had proved a similar statement about d-spheres and (d+1)-polytopes for fixed d >= 4.

2003-11-25math.COmath.GTmath.MG

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

An explicit construction for neighborly centrally symmetric polytopes

We give an explicit construction, based on Hadamard matrices, for an infinite series of floor{sqrt{d}/2}-neighborly centrally symmetric d-dimensional polytopes with 4d vertices. This appears to be the best explicit version yet of a recent probabilistic result due to Linial and Novik, who proved the existence of such polytopes with a neighborliness of d/400.

2006-06-29math.COmath.MG

Polyhedral tori with minimal coordinates

We give explicit realizations with small integer coordinates for all triangulated tori with up to 12 vertices. In particular, we provide coordinate-minimal realizations in general position for all triangulations of the torus with 7, 8, 9, and 10 vertices. For the unique 7-vertex triangulation of the torus we show that all corresponding 72 oriented matroids are realizable in the 6x6x6-cube. Moreover, we present polyhedral tori with 8 vertices in the 2x2x2-cube, general position realizations of triangulated tori with 8 vertices in the 2x2x3-cuboid as well as polyhedral tori with 9 and 10 vertice…

2007-09-18math.COmath.MG

On the infinitesimal rigidity of polyhedra with vertices in convex position

Let $P \subset \R^3$ be a polyhedron. It was conjectured that if $P$ is weakly convex (i. e. its vertices lie on the boundary of a strictly convex domain) and decomposable (i. e. $P$ can be triangulated without adding new vertices), then it is infinitesimally rigid. We prove this conjecture under a weak additional assumption of codecomposability. The proof relies on a result of independent interest concerning the Hilbert-Einstein function of a triangulated convex polyhedron. We determine the signature of the Hessian of that function with respect to deformations of the interior edges. In partic…

2007-11-13math.DGmath.MG

Branches of triangulated origami near the unfolded state

Origami structures are characterized by a network of folds and vertices joining unbendable plates. For applications to mechanical design and self-folding structures, it is essential to understand the interplay between the set of folds in the unfolded origami and the possible 3D folded configurations. When deforming a structure that has been folded, one can often linearize the geometric constraints, but the degeneracy of the unfolded state makes a linear approach impossible there. We derive a theory for the second-order infinitesimal rigidity of an initially unfolded triangulated origami struct…

2017-12-05cond-mat.softmath.MG

多面体Bier球与不可实现的中心对称性

Polytopal Bier spheres and nonrealizable central symmetries

Max Planck Institute for Mathematics in the Sciences（马克斯·普朗克数理科学研究所）；Georgia Institute of Technology（佐治亚理工学院）

该研究给出中心对称Bier球无法作为中心对称多面体边界的判据，得到新的不可几何实现的单纯多面体族，还证明顶点数≤12的Bier球均为多面体。

2026-08-10math.COmath.MG

中心对称多面体中Mahler体积局部极小性的离散KKT变分刻画

A Discrete KKT Variational Characterization of the Local Minimality of the Mahler Volume in Centrally Symmetric Polytopes

Facultad de Ciencias, UNAM（UNAM理学院）

通过径向浸入顶点导出的KKT条件，证明Hanner轨道在径向伸缩模GL(n,R)的层中是严格局部极小，并利用二阶变谱分析和对角占优性得到二次定量稳定性界。

2026-08-10math.MGmath.OC

The Mahler conjecture in two dimensions via the probabilistic method

The "Mahler volume" is, intuitively speaking, a measure of how "round" a centrally symmetric convex body is. In one direction this intuition is given weight by a result of Santalo, who in the 1940s showed that the Mahler volume is maximized, in a given dimension, by the unit sphere and its linear images, and only these. A counterpart to this result in the opposite direction is proposed by a conjecture, formulated by Kurt Mahler in the 1930s and still open in dimensions 4 and greater, asserting that the Mahler volume should be minimized by a cuboid. In this article we present a seemingly new pr…

2018-08-13math.COmath.MG

所有弱凸且可分解的多面体表面是否都是无穷小刚性的？

Are all Weakly Convex and Decomposable Polyhedral Surfaces Infinitesimally Rigid?

本文研究了弱凸且可分解多面体的无穷小刚性猜想，通过构造非余可分解的 $T$-多面体族并利用离散 Hilbert-Einstein 泛函的 Hessian $M_T$ 进行特征值实验，提供了此类柔性多面体可能不存在的实验证据。

2024-04-25math.DGmath.MG

Old and new geometric polyhedra with few vertices

This paper deals with triangulations of the 2-torus with the vertex labeled general octahedral graph $O_4$ which is isomorphic to the complete four-partite graph $K_{2,2,2,2}$; it is known that there exist precisely twelve such triangulations. We find all the 12 triangulations in a Schlegel diagram of the hyperoctahedron and realize all of them geometrically with the same 1-skeleton in 3-space. In particular, we identify two geometric polyhedral tori (both without self-intersections) with the same 1-skeleton in 3-space, but without a single common face, or in other words their intersection (as…

2022-01-06math.COmath.GTmath.MG