中文
相关论文

相关论文: Combinatorial 3-manifolds with 10 vertices

200 篇论文

We enumerate rooted triangulations of a sphere with multiple holes by the total number of edges and the length of each boundary component. The proof relies on a combinatorial identity due to W.T. Tutte.

组合数学 · 数学 2011-11-10 Maxim Krikun

One measure of the complexity of a 3-manifold is its triangulation complexity: the minimal number of tetrahedra in a triangulation of it. A natural question is whether we can relate this quantity to its topology. We determine the…

几何拓扑 · 数学 2023-01-06 Adele Jackson

In 1987 Brehm and K\"uhnel showed that any triangulation of a $d$-manifold (without boundary) that is not homeomorphic to the sphere has at least $3d/2+3$ vertices. Moreover, triangulations with exactly $3d/2+3$ vertices may exist only for…

组合数学 · 数学 2024-11-20 Alexander A. Gaifullin

It is natural to ask how many isotopy classes of embedded essential surfaces lie in a given 3-manifold. The first bounds on the number of such surfaces were exponential, using normal surfaces. More recently, by restricting to alternating…

几何拓扑 · 数学 2025-10-16 Jessica S. Purcell , Anastasiia Tsvietkova

There are 339 combinatorial types of generic metrics on six points. They correspond to the 339 regular triangulations of the second hypersimplex \Delta(6,2), which also has 14 non-regular triangulations.

度量几何 · 数学 2012-02-13 Bernd Sturmfels , Josephine Yu

All families of sextic surfaces with the maximal number of isolated triple points are found.

代数几何 · 数学 2007-05-23 Jan Stevens

The triangulation complexity of a closed orientable 3-manifold is the minimal number of tetrahedra in any triangulation of the manifold. The main theorem of the paper gives upper and lower bounds on the triangulation complexity of any…

几何拓扑 · 数学 2024-07-24 Marc Lackenby , Jessica S. Purcell

We define an invariant, which we call surface-complexity, of closed 3-manifolds by means of Dehn surfaces. The surface-complexity of a manifold is a natural number measuring how much the manifold is complicated. We prove that it fulfils…

几何拓扑 · 数学 2019-01-30 Gennaro Amendola

0-efficient triangulations of 3-manifolds are defined and studied. It is shown that any triangulation of a closed, orientable, irreducible 3-manifold M can be modified to a 0-efficient triangulation or M can be shown to be one of the…

几何拓扑 · 数学 2007-05-23 William Jaco , J. Hyam Rubinstein

A triangulation of a surface with fixed topological type is called irreducible if no edge can be contracted to a vertex while remaining in the category of simplicial complexes and preserving the topology of the surface. A complete list of…

组合数学 · 数学 2021-03-09 S. Lawrencenko , T. Sulanke , M. T. Villar , L. V. Zgonnik , M. J. Chávez , J. R. Portillo

We construct the 4D N=2 SCFTs of class-S, which stem from the $E_8$ (2,0) theory. There are 49,836 isolated SCFTs which arise as 3-punctured spheres. Of these, 149 are "mixed" (contain free hypermultiplets accompanying the interacting SCFT)…

高能物理 - 理论 · 物理学 2018-10-23 Oscar Chacaltana , Jacques Distler , Anderson Trimm , Yinan Zhu

In 2010 it was proved that a 3-regular matchstick graph of girth 5 must consist at least of 30 vertices. The smallest known example consisted of 180 vertices. In this article we construct an example consisting of 54 vertices and prove its…

组合数学 · 数学 2020-01-09 Mike Winkler , Peter Dinkelacker , Stefan Vogel

Sphere packing problems have a rich history in both mathematics and physics; yet, relatively few analytical analyses of sphere packings exist, and answers to seemingly simple questions are unknown. Here, we present an analytical method for…

软凝聚态物质 · 物理学 2013-10-17 Natalie Arkus , Vinothan N. Manoharan , Michael P. Brenner

The contact graph of an arbitrary finite packing of unit balls in Euclidean 3-space is the (simple) graph whose vertices correspond to the packing elements and whose two vertices are connected by an edge if the corresponding two packing…

度量几何 · 数学 2014-02-05 Karoly Bezdek , Samuel Reid

The search for universality in random triangulations of manifolds, like those featuring in (Euclidean) Dynamical Triangulations, is central to the random geometry approach to quantum gravity. In case of the 3-sphere, or any other manifold…

组合数学 · 数学 2022-03-31 Timothy Budd , Luca Lionni

In 1962, Tutte provided a formula for the number of combinatorial triangulations, that is, maximal planar graphs with a fixed triangular face and $n$ additional vertices. In this note, we study how many ways a combinatorial triangulation…

组合数学 · 数学 2025-04-25 Belén Cruces , Clemens Huemer , Dolores Lara

Edge-to-edge tilings of the sphere by congruent quadrilaterals are completely classified in a series of three papers. This last one classifies the case of $a^3b$-quadrilaterals with some irrational angle: there are a sequence of…

组合数学 · 数学 2023-06-06 Yixi Liao , Pinren Qian , Erxiao Wang , Yingyun Xu

We classify closed, simply connected $n$-manifolds of non-negative sectional curvature admitting an isometric torus action of maximal symmetry rank in dimensions $2\leq n\leq 6$. In dimensions $3k$, $k=1,2$ there is only one such manifold…

微分几何 · 数学 2012-07-27 Fernando Galaz-Garcia , Catherine Searle

Although Kirby and Siebenmann showed that there are manifolds that do not admit PL structures, the possibility remained that all manifolds could be triangulated. In the late seventies Galewski and Stern and independently Matumoto showed…

几何拓扑 · 数学 2014-10-01 Michael W. Davis , Jim Fowler , Jean-François Lafont

The spine of a trisected 4-manifold is a singular 3-dimensional set from which the trisection itself can be reconstructed. 3-manifolds embedded in the trisected 4--manifold can often be isotoped to lie almost or entirely in the spine of the…

几何拓扑 · 数学 2018-06-14 Dale Koenig