中文
相关论文

相关论文: The Complex of Non-Crossing Diagonals of a Polygon

200 篇论文

An orbitope is the convex hull of an orbit of a point under the action of a compact group. We derive bounds on volumes of sections of polar bodies of orbitopes, extending our previously developed methods. As an application we realize the…

代数几何 · 数学 2009-10-06 Grigoriy Blekherman

Given a set P of points on the plane, a polygon with vertices in P is said to be empty if it contains no element of P in its interior. We show that every set of n points in general position on the plane determines at least…

组合数学 · 数学 2026-03-20 Omar Astudillo-Marbán , Oriol Solé-Pi

Let $C_{\theta}$ be a circular cone in Euclidean space $\mathbb{R}^{3}$,which apex is the origin and apex angle of the cone is $\theta\in \left(\pi/3, \pi\right)$. Let $M_\theta$ be the class of compact convex domains in Euclidean space…

动力系统 · 数学 2024-10-29 Yi Yang

We give a concrete example of an infinite sequence of $(p_n, q_n)$-lens spaces $L(p_n, q_n)$ with natural triangulations $T(p_n, q_n)$ with $p_n$ taterahedra such that $L(p_n, q_n)$ contains a certain non-orientable closed surface which is…

几何拓扑 · 数学 2008-09-11 Chuichiro Hayashi , Miwa Iwakura

It is a widely observed phenomenon in computer graphics that the size of the silhouette of a polyhedron is much smaller than the size of the whole polyhedron. This paper provides, for the first time, theoretical evidence supporting this for…

计算几何 · 计算机科学 2009-09-29 Marc Glisse , Sylvain Lazard

We prove that every hyperplane passing through the origin in $\rr^{n+1}$ divides an embedded compact free boundary minimal hypersurface of the euclidean $(n+1)$-ball in exactly two connected hypersurfaces. We also show that if a region in…

微分几何 · 数学 2024-10-01 Vanderson Lima , Ana Menezes

We present a first example of a flag vector of a polyhedral sphere that is not the flag vector of any polytope. Namely, there is a unique 3-sphere with the parameters $(f_0,f_1,f_2,f_3;f_{02})=(12,40,40,12;120)$, but this sphere is not…

度量几何 · 数学 2019-02-20 Philip Brinkmann , Günter M. Ziegler

We prove that in any $\mathbb{Z}^n$-periodic triangulation of $\mathbb{R}^n$ the number of $\mathbb{Z}^n$-orbits of $n$-dimensional simplices is at least the tensor rank of the $n$th determinant tensor. The latter is known to be at least…

组合数学 · 数学 2025-09-29 Sergey Avvakumov , Roman Karasev

An abstract $n$-polytope $\mathcal{P}$ is a partially-ordered set which captures important properties of a geometric polytope, for any dimension $n$. For even $n \ge 2$, the incidences between elements in the middle two layers of the Hasse…

组合数学 · 数学 2024-06-21 Marston Conder , Isabelle Steinmann

In a previous work we proved that each $n$-dimensional convex polyhedron ${\mathcal K}subset{\mathbb R}^n$ and its relative interior are regular images of ${\mathbb R}^n$. As the image of a non-constant polynomial map is an unbounded…

代数几何 · 数学 2024-01-24 José F. Fernando , J. M. Gamboa , Carlos Ueno

An unfolding of a polyhedron is produced by cutting the surface and flattening to a single, connected, planar piece without overlap (except possibly at boundary points). It is a long unsolved problem to determine whether every polyhedron…

计算几何 · 计算机科学 2007-05-23 Mirela Damian , Robin Flatland , Joseph O'Rourke

The Upper Bound Theorem for convex polytopes implies that the $p$-th Betti number of the \v{C}ech complex of any set of $N$ points in $\mathbb R^d$ and any radius satisfies $\beta_{p} = O(N^{m})$, with $m = \min \{ p+1, \lceil d/2 \rceil…

组合数学 · 数学 2023-10-24 Herbert Edelsbrunner , János Pach

A triangulation of a simplicial complex $\Delta$ is called uniform if the $f$-vector of its restriction to a face of $\Delta$ depends only on the dimension of that face. This paper proves that the entries of the $h$-vector of a uniform…

组合数学 · 数学 2021-06-04 Christos A. Athanasiadis

This paper is devoted to some rotationally symmetric classes of graphs denoted in literature as convex polytope graphs. Exact value of equidistant dimension is found for $T_n$. Next, for even $n$ exact values are found for $R''_n$ and…

组合数学 · 数学 2024-07-23 Aleksandar Savić , Zoran Maksimović , Milena Bogdanović , Jozef Kratica

We give a new proof of Steinitz's classical theorem in the case of plane triangulations, which allows us to obtain a new general bound on the grid size of the simplicial polytope realizing a given triangulation, subexponential in a number…

组合数学 · 数学 2013-11-05 Igor Pak , Stedman Wilson

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…

组合数学 · 数学 2025-07-01 Linda Green , Stellen Li

A polygonal surface in the pseudo-hyperbolic space H^(2,n) is a complete maximal surface bounded by a lightlike polygon in the Einstein universe Ein^(1,n) with finitely many vertices. In this article, we give several characterizations of…

微分几何 · 数学 2026-05-05 Alex Moriani

This paper introduces a natural definition for the volume of the unit ball in $n$-dimensional normed spaces $\mathbb{R}^n$. This definition preserves the Euclidean relation $P(B)/V(B)=n$ between the perimiter and the volume of the unit ball…

度量几何 · 数学 2026-05-05 Gershon Wolansky

The geometry of the dual amplituhedron is generally described in reference to a particular triangulation. A given triangulation manifests only certain aspects of the underlying space while obscuring others, therefore understanding this…

高能物理 - 理论 · 物理学 2017-08-22 Michael Enciso

Convex polytopes are convex hulls of point sets in the $n$-dimensional space $\E^n$ that generalize 2-dimensional convex polygons and 3-dimensional convex polyhedra. We concentrate on the class of $n$-dimensional polytopes in $\E^n$ called…

量子物理 · 物理学 2010-12-15 Colin Wilmott , Hermann Kampermann , Dagmar Bruss