English
Related papers

Related papers: Rigid ball-polyhedra in Euclidean 3-space

200 papers

A perfect Euler cuboid is a rectangular parallelepiped with integer edges, with integer face diagonals, and with integer space diagonal as well. Finding such parallelepipeds or proving their non-existence is an old unsolved mathematical…

Number Theory · Mathematics 2012-06-29 Ruslan Sharipov

Let $E$ be a $(\mathrm{IV})$-polyhedral Banach space. We show that, for each $\epsilon>0$, $E$ admits an $\epsilon$-equivalent $\mathrm{(V)}$-polyhedral norm such that the corresponding closed unit ball is the closed convex hull of its…

Functional Analysis · Mathematics 2023-03-20 Carlo Alberto De Bernardi

A linear ball is a simplicial complex whose geometric realization is homeomorphic to a ball and whose Stanley--Reisner ring has a linear resolution. It turns out that the Stanley--Reisner ring of the sphere which is the boundary complex of…

Commutative Algebra · Mathematics 2007-05-25 Takayuki Hibi , Pooja Singla

In this paper, we prove a rigidity result for proper holomorphic maps between unit balls that have many symmetries and which extend to H\"older continuous maps on the boundary, with H\"older exponent strictly greater than 1/2.

Complex Variables · Mathematics 2026-02-20 Kyle Huang , Jinwoo Park , Aleksander Skenderi , Jaan Amla Srimurthy , Rou Wen , Andrew Zimmer

Motivated by modern applications like image processing and wireless sensor networks, we consider a variation of the famous Kepler Conjecture. Given any infinite set of unit balls covering the whole space, we want to know the optimal (lim…

General Mathematics · Mathematics 2007-12-20 Binhai Zhu

Theoretical background is provided towards the mathematical foundation of the minimum enclosing ball problem. This problem concerns the determination of the unique spherical surface of smallest radius enclosing a given bounded set in the…

Computational Geometry · Computer Science 2024-02-13 Michael N. Vrahatis

It is well known that a three dimensional (closed, connected and compact) manifold is obtained by identifying boundary faces from a stellar ball a*S. The study of S/~, two dimensional stellar sphere S with 2-simplexes identified in pairs…

General Mathematics · Mathematics 2007-05-23 Sergey Nikitin

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,…

Geometric Topology · Mathematics 2026-04-29 Huabin Ge , Longsong Jia , Hao Yu , Puchun Zhou

Across various scientific and engineering domains, a growing interest in flexible and deployable structures is becoming evident. These structures facilitate seamless transitions between distinct states of shape and find broad applicability…

Rings and Algebras · Mathematics 2024-01-26 Yang Liu , Yi Ouyang , Dominik L. Michels

Skeletal polyhedra and polygonal complexes are finite or infinite periodic structures in 3-space with interesting geometric, combinatorial, and algebraic properties. These structures can be viewed as finite or infinite periodic graphs…

Metric Geometry · Mathematics 2016-10-11 Egon Schulte , Asia Ivić Weiss

Given a combinatorial description $C$ of a polyhedron having $E$ edges, the space of dihedral angles of all compact hyperbolic polyhedra that realize $C$ is generally not a convex subset of $\mathbb{R}^E$ \cite{DIAZ}. If $C$ has five or…

Geometric Topology · Mathematics 2007-05-23 Roland K. W. Roeder

A well-known result in the study of convex polyhedra, due to Minkowski, is that a convex polyhedron is uniquely determined (up to translation) by the directions and areas of its faces. The theorem guarantees existence of the polyhedron…

Computational Geometry · Computer Science 2017-12-06 Giuseppe Sellaroli

We consider the volume of a Boolean expression of some congruent balls about a given system of centers in the $d$-dimensional Euclidean space. When the radius $r$ of the balls is large, this volume can be approximated by a polynomial of…

Metric Geometry · Mathematics 2017-12-22 Balázs Csikós

The union of the particles of a stationary Poisson process of compact (convex) sets in Euclidean space is called Boolean model and is a classical topic of stochastic geometry. In this paper, Boolean models in hyperbolic space are…

Probability · Mathematics 2024-08-08 Daniel Hug , Günter Last , Matthias Schulte

A graph is called (generically) rigid in $\mathbb{R}^d$ if, for any choice of sufficiently generic edge lengths, it can be embedded in $\mathbb{R}^d$ in a finite number of distinct ways, modulo rigid transformations. Here we deal with the…

Computational Geometry · Computer Science 2017-01-26 Ioannis Z. Emiris , Ioannis Psarros

This survey reviews a collection of parallel phenomena between free boundary submanifolds in the Euclidean unit ball and closed submanifolds in the sphere, with particular emphasis on rigidity mechanisms, pinching thresholds, and canonical…

Differential Geometry · Mathematics 2026-03-16 Niang Chen

We derive lower estimates for the approximation of the $d$-dimensional Euclidean ball by polytopes with a fixed number of $k$-dimensional faces, $k\in\{0,1,\ldots,d-1\}$. The metrics considered include the intrinsic volume difference and…

Metric Geometry · Mathematics 2025-10-28 Steven Hoehner , Carsten Schütt , Elisabeth Werner

A polyiamond is a polygon composed of unit equilateral triangles, and a generalized deltahedron is a convex polyhedron whose every face is a convex polyiamond. We study a variant where one face may be an exception. For a convex polygon P,…

In Euclidean spaces, every closed, bounded, convex set can be characterized by two equivalent notions of separation properties. This is not true in general for arbitrary Banach spaces. In this work, we present a ball separation…

Functional Analysis · Mathematics 2025-11-12 Sudeshna Basu , Susmita Seal

Unfolding a convex polyhedron into a simple planar polygon is a well-studied problem. In this paper, we study the limits of unfoldability by studying nonconvex polyhedra with the same combinatorial structure as convex polyhedra. In…

Computational Geometry · Computer Science 2007-05-23 Marshall Bern , Erik D. Demaine , David Eppstein , Eric Kuo , Andrea Mantler , Jack Snoeyink
‹ Prev 1 8 9 10 Next ›