相关论文: In search for a perfect shape of polyhedra: Buffon…
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…
Steinerberger introduced the Buffon discrepancy problem, asking how accurately a one-dimensional set of length $L$ in a convex body can match the Crofton-predicted line-intersection counts, and proved an $O\left(L^{1/3}\right)$ upper bound…
We show that every convex polyhedron admits a simple edge unfolding after an affine transformation. In particular there exists no combinatorial obstruction to a positive resolution of Durer's unfoldability problem, which answers a question…
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…
A star of n (n greater than or equal to 2) line segments (needles) of equal length with common endpoint and constant angular spacing is randomly placed onto a lattice which is the union of two families of equidistant lines in the plane with…
In 1970, Coxeter gave a short and elegant geometric proof showing that if $p_1, p_2, \ldots, p_n$ are vertices of an $n$-gon $P$ in cyclic order, then $P$ is affinely regular if, and only if there is some $\lambda \geq 0$ such that…
In 1934, Reinhardt asked for the centrally symmetric convex domain in the plane whose best lattice packing has the lowest density. He conjectured that the unique solution up to an affine transformation is the smoothed octagon (an octagon…
A polyhedron is flexible if it can be continuously deformed preserving the shape and dimensions of every its face. In the late 1970's Klaus Steffen constructed a sphere-homeomorphic embedded flexible polyhedron with triangular faces and…
For a Riemannian polyhedra, we study the geometry of the unit ball for the unidimensional stable norm (stable ball). In the case of a unidimensional Riemannian polyhedra (graph), we show that the stable ball is a polytope whose vertices are…
A ball-polyhedron is the intersection with non-empty interior of finitely many (closed) unit balls in Euclidean 3-space. One can represent the boundary of a ball-polyhedron as the union of vertices, edges, and faces defined in a rather…
We solve a variant of the classical Buffon Needle problem. More specifically, we inspect the probability that a randomly oriented needle of length $l$ originating in a bounded convex set $X\subset\mathbb{R}^2$ lies entirely within $X$.…
The fundamental theorem of affine geometry says that a self-bijection $f$ of a finite-dimensional affine space over a possibly skew field takes left affine subspaces to left affine subspaces of the same dimension, then $f$ of the expected…
Spectrahedra are linear sections of the cone of positive semidefinite matrices that, as convex bodies, generalize the class of polyhedra. In this paper we investigate the problem of recognizing when a spectrahedron is polyhedral. We reprove…
Feferman proved in 1962 that any arithmetical theorem is a consequence of a suitable transfinite iteration of full uniform reflection of $\mathsf{PA}$. This result is commonly known as Feferman's completeness theorem. The purpose of this…
The purpose of this paper is to investigate order of contact on real hypersurfaces in ${\mathbb C}^n$ by using Newton polyhedra which are important notion in the study of singularity theory. To be more precise, an equivalence condition for…
A version of the classical Buffon problem in the plane naturally extends to the setting of any Riemannian surface with constant Gaussian curvature. The Buffon probability determines a Buffon deficit. The relationship between Gaussian…
The cyclohedron (Bott-Taubes polytope) arises both as the polyhedral realization of the poset of all cyclic bracketings of a circular word and as an essential part of the Fulton-MacPherson compactification of the configuration space of n…
For a polygon $x=(x_j)_{j\in \mathbb{Z}}$ in $\mathbb{R}^n$ we consider the midpoints polygon $(M(x))_j=\left(x_j+x_{j+1}\right)/2\,.$ We call a polygon a soliton of the midpoints mapping $M$ if its midpoints polygon is the image of the…
A polyhedron in Euclidean 3-space is called a regular polyhedron of index 2 if it is combinatorially regular but "fails geometric regularity by a factor of 2"; its combinatorial automorphism group is flag-transitive but its geometric…
In this paper we discuss some affine properties of convex equal-area polygons, which are convex polygons such that all triangles formed by three consecutive vertices have the same area. Besides being able to approximate closed convex smooth…