中文
相关论文

相关论文: A rigidity criterion for non-convex polyhedra

200 篇论文

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…

度量几何 · 数学 2021-10-29 Frank Göring , Martin Winter

The classical Cauchy rigidity theorem for convex polytopes reads that if two convex polytopes have isometric developments then they are congruent. In other words, we can decide whether two polyhedra are isometric or not by using their…

度量几何 · 数学 2023-03-28 Victor Alexandrov

It is proven that the volume of an infinitesimally flexible polyhedron in $R^3$ is a multiple root of its volume polynomial.

度量几何 · 数学 2017-07-04 I. Kh. Sabitov

We prove that a closed convex subset $C$ of a complete linear metric space $X$ is polyhedral in its closed linear hull if and only if no infinite subset $A\subset X\backslash C$ can be hidden behind $C$ in the sense $[x,y]\cap C\not =…

泛函分析 · 数学 2011-11-22 Taras Banakh , Ivan Hetman

We show that a realization of a closed connected PL-manifold of dimension n-1 in n-dimensional Euclidean space (n>2) is the boundary of a convex polyhedron (finite or infinite) if and only if the interior of each (n-3)-face has a point,…

计算几何 · 计算机科学 2007-05-23 Konstantin Rybnikov

We construct some example of a closed nondegenerate nonflexible polyhedron $P$ in Euclidean 3-space that is the limit of a sequence of nondegenerate flexible polyhedra each of which is combinatorially equivalent to $P$. This implies that…

度量几何 · 数学 2015-08-18 Victor Alexandrov

We prove that ellipses are infinitesimally spectrally rigid among $C^{\infty}$ domains with the symmetries of the ellipse.

谱理论 · 数学 2013-01-15 Hamid Hezari , Steve Zelditch

Since Thurston pioneered the connection between circle packing (abbr. CP) and three-dimensional geometric topology, the characterization of CPs and hyperbolic polyhedra has become increasingly profound. Some milestones have been achieved,…

几何拓扑 · 数学 2026-04-29 Huabin Ge , Longsong Jia , Hao Yu , Puchun Zhou

In this paper, we prove a rigidity theorem of asymptotically hyperbolic manifolds only under the assumptions on curvature. Its proof is based on analyzing asymptotic structures of such manifolds at infinity and a volume comparison theorem.

微分几何 · 数学 2009-11-10 Yuguang Shi , Gang Tian

Using the orthogonal connectedness, we introduce the notion of orthogonal decomposability of convex polytopes and study it in the case of Platonic and Archimedean solids. While doing so, we also encounter polytopes which are not…

组合数学 · 数学 2026-03-10 Julia Q. Du , Xuemei He , Xiaotian Song , Daniela Stiller , Liping Yuan , Tudor Zamfirescu

For any finite set $\A$ of $n$ points in $\R^2$, we define a $(3n-3)$-dimensional simple polyhedron whose face poset is isomorphic to the poset of ``non-crossing marked graphs'' with vertex set $\A$, where a marked graph is defined as a…

组合数学 · 数学 2007-05-23 David Orden , Francisco Santos

We study local rigidity properties of holomorphic embeddings of real hypersurfaces in $\mathbb C^2$ into real hypersurfaces in $\mathbb C^3$ and show that infinitesimal conditions imply actual local rigidity in a number of (important)…

复变函数 · 数学 2021-06-15 Giuseppe Della Sala , Bernhard Lamel , Michael Reiter

Let $M$ be a volume finite non-compact complete hyperbolic $n$-manifold with totally geodesic boundary. We show that there exists a polyhedral decomposition of $M$ such that each cell is either an ideal polyhedron or a partially truncated…

几何拓扑 · 数学 2024-09-16 Ge Huabin , Jia Longsong , Zhang Faze

We present new examples of topologically convex edge-ununfoldable polyhedra, i.e., polyhedra that are combinatorially equivalent to convex polyhedra, yet cannot be cut along their edges and unfolded into one planar piece without overlap.…

计算几何 · 计算机科学 2020-07-30 Erik D. Demaine , Martin L. Demaine , David Eppstein

Automated program verification often proceeds by exhibiting inductive invariants entailing the desired properties.For numerical properties, a classical class of invariants is convex polyhedra: solution sets of system of linear…

编程语言 · 计算机科学 2018-05-16 David Monniaux

We present a short proof of S. Parsa's theorem that there exists a compact $n$-polyhedron $P$, $n\ge 2$, non-embeddable in $\mathbb R^{2n}$, such that $P*P$ embeds in $\mathbb R^{4n+2}$. This proof can serve as a showcase for the use of…

几何拓扑 · 数学 2022-10-11 Sergey A. Melikhov

Several results concerning pairs of polynomially convex sets whose union is not even rationally convex are given. It is shown that there is no restriction on how two spaces can be embedded in some $\C^N$ so as to be polynomially convex but…

复变函数 · 数学 2021-08-23 Alexander J. Izzo

This paper details an algorithm for unfolding a class of convex polyhedra, where each polyhedron in the class consists of a convex cap over a rectangular base, with several restrictions: the cap's faces are quadrilaterals, with vertices…

计算几何 · 计算机科学 2007-09-12 Joseph O'Rourke

We define an abstract regular polytope to be internally self-dual if its self-duality can be realized as one of its symmetries. This property has many interesting implications on the structure of the polytope, which we present here. Then,…

群论 · 数学 2016-10-11 Gabe Cunningham , Mark Mixer

The paper is centered around a new proof of the infinitesimal rigidity of convex polyhedra. The proof is based on studying derivatives of the discrete Hilbert-Einstein functional on the space of "warped polyhedra" with a fixed metric on the…

微分几何 · 数学 2011-05-26 Ivan Izmestiev