中文
相关论文

相关论文: There are only two nonobtuse binary triangulations…

200 篇论文

We construct partitions of $\mathbb{R}^n$ into three sets $\{\mathscr{X}(1),\mathscr{X}(2),\mathscr{X}(3)\}$ that locally minimize interfacial area among compactly supported volume preserving variations and that blow down at infinity to…

偏微分方程分析 · 数学 2025-07-21 Lia Bronsard , Robin Neumayer , Michael Novack , Anna Skorobogatova

An ideal triangulation of a singular flat surface is a geodesic triangulation such that its vertex set is equal to the set of singular points of the surface. Using the fact that each pair of points in a surface has a finite number of…

度量几何 · 数学 2020-12-01 İsmail Sağlam

By a sequence of numerical experiments we demonstrate that generic triangulations of the $D-$sphere for $D>3$ contain one {\it singular} $(D-3)-$simplex. The mean number of elementary $D-$simplices sharing this simplex increases with the…

高能物理 - 格点 · 物理学 2009-10-28 S. Catterall , G. Thorleifsson , J. Kogut , R. Renken

A triangulation of a connected closed surface is called weakly regular if the action of its automorphism group on its vertices is transitive. A triangulation of a connected closed surface is called degree-regular if each of its vertices…

几何拓扑 · 数学 2007-05-23 Basudeb Datta , Ashish Kumar Upadhyay

We consider the problem of enumerating integer tetrahedra of fixed perimeter (sum of side-lengths) and/or diameter (maximum side-length), up to congruence. As we will see, this problem is considerably more difficult than the corresponding…

组合数学 · 数学 2021-12-03 James East , Michael Hendriksen , Laurence Park

A flip is a minimal move between two triangulations of a polytope. An open question is whether any two triangulations of the product of two simplices can be connected through a series of flips. This was proven in the case where one of the…

组合数学 · 数学 2016-01-25 Gaku Liu

A $d$-angulation is a planar map with faces of degree $d$. We present for each integer $d\geq 3$ a bijection between the class of $d$-angulations of girth $d$ (i.e., with no cycle of length less than $d$) and a class of decorated plane…

组合数学 · 数学 2012-06-13 Olivier Bernardi , Eric Fusy

We show that there are a finite number of possible pictures for a surface in a tetrahedron with local index $n$. Combined with previous results, this establishes that any topologically minimal surface can be transformed into one with a…

几何拓扑 · 数学 2013-03-28 David Bachman

The investigation of the relation among the distances of an arbitrary point in the Euclidean space $\mathbb{R}^n$ to the vertices of a regular $n$-simplex in that space has led us to the study of simplices having a regular facet. Calling an…

度量几何 · 数学 2017-02-01 Mowaffaq Hajja , Mostafa Hayajneh , Ismail Hammoudeh

Flips in triangulations of convex polygons arise in many different settings. They are isomorphic to rotations in binary trees, define edges in the 1-skeleton of the Associahedron and cover relations in the Tamari Lattice. The complexity of…

计算几何 · 计算机科学 2026-02-27 Joseph Dorfer

It was recently shown that there exists an explicit bound for the number of Pachner moves needed to connect any two triangulation of any Haken 3-manifold which contains no fibred sub-manifolds as strongly simple pieces of its…

几何拓扑 · 数学 2007-05-23 Aleksandar Mijatovic

It is known that an ideal triangulation of a compact $3$-manifold with nonempty boundary is minimal if and only if it contains the minimum number of edges among all ideal triangulations of the manifold. Therefore, any ideal one-edge…

几何拓扑 · 数学 2021-05-12 Evgeny Fominykh , Ekaterina Shumakova

We show that the graph of a simplicial polytope of dimension $d \ge 3$ has no nontrivial minimum edge cut with fewer than $d(d+1)/2$ edges, hence the graph is $\min\{\delta, d(d+1)/2\}$-edge-connected where $\delta$ denotes the minimum…

组合数学 · 数学 2023-11-14 Vincent Pilaud , Guillermo Pineda-Villavicencio , Julien Ugon

It is conjectured that every integer N>454 is the sum of seven nonnegative cubes. We prove the conjecture when N is a multiple of 4.

数论 · 数学 2009-03-27 Kent D. Boklan , Noam D. Elkies

For an integer $n\geq 2$, the triangular graph has vertex set the $2$-subsets of $\{1,\ldots,n\}$ and edge set the pairs of $2$-subsets intersecting at one point. Such graphs are known to be halved graphs of bipartite rectagraphs, which are…

组合数学 · 数学 2017-04-14 Joanna B. Fawcett

By the theorem of Mantel $[5]$ it is known that a graph with $n$ vertices and $\lfloor \frac{n^{2}}{4} \rfloor+1$ edges must contain a triangle. A theorem of Erd\H{o}s gives a strengthening: there are not only one, but at least…

组合数学 · 数学 2020-03-11 Chuanqi Xiao , Gyula O. H. Katona

In this survey on combinatorial properties of triangulated manifolds we discuss various lower bounds on the number of vertices of simplicial and combinatorial manifolds. Moreover, we give a list of all known examples of vertex-minimal…

组合数学 · 数学 2007-05-23 Frank H. Lutz

A degree-regular triangulation is one in which each vertex has identical degree. Our main result is that any such triangulation of a (possibly non-compact) surface $S$ is geometric, that is, it is combinatorially equivalent to a geodesic…

组合数学 · 数学 2017-11-06 Basudeb Datta , Subhojoy Gupta

Given a triangulation of a closed, oriented, irreducible, atoroidal 3-manifold every oriented, incompressible surface may be isotoped into normal position relative to the triangulation. Such a normal oriented surface is then encoded by…

几何拓扑 · 数学 2007-06-06 Daryl Cooper , Stephan Tillmann

Let V be a finite set of points in the plane, not contained in a line. Assume |V| = n is an odd number, and |L \cap V| \leq 3 for every line L which is spanned by V. We prove that every simple line L_{a,b} in V creates a simple wedge (i.e.,…

组合数学 · 数学 2012-09-10 Shimon Garti