相关论文: Polar Zonohedra Edge-Unfold to Nets

A classic theorem by Steinitz states that a graph G is realizable by a convex polyhedron if and only if G is 3-connected planar. Zonohedra are an important subclass of convex polyhedra having the property that the faces of a zonohedron are…

The multipole expansion of the polarization interaction between a charged particle and an electrically charged particle has long been known to be asymptotic in nature, i.e. the multiple expansion diverges at any finite distance from the…

We study oriented connected closed polyhedral surfaces with non-degenerate triangular faces in three-dimensional Euclidean space, calling them polyhedra for short. A polyhedron is called flexible if its spatial shape can be changed…

We prove that all discrete isothermic nets with a family of planar or spherical lines of curvature can be obtained from special discrete holomorphic maps via lifted-folding. This novel approach is a generalization and discretization of a…

We prove that every locally pluripolar set on a compact complex manifold is pluripolar. This extends similar results in K\"ahler case.

The main result of this paper is that a polar action on a compact irreducible homogeneous Kaehler manifold is coisotropic. This is then used to give new examples of polar actions and to classify coisotropic and polar actions on quadrics.

We prove two results about transforming any convex polyhedron, modeled as a linkage L of its edges. First, if we subdivide each edge of L in half, then L can be continuously flattened into a plane. Second, if L is equilateral and we again…

We prove that, given a polyhedron $\mathcal P$ in $\mathbb{R}^3$, every point in $\mathbb R^3$ that does not see any vertex of $\mathcal P$ must see eight or more edges of $\mathcal P$, and this bound is tight. More generally, this remains…

Discovery of topological polarization textures has put ferroelectrics at the frontier of topological matter science. High-symmetry ferroelectric oxide materials allowing for freedom of the polarization vector rotation offer a fertile ground…

Polar manifolds are Riemannian G-manifolds admitting a "section", i.e., a complete submanifold passing through every orbit and doing so orthogonally. We consider compact simply-connected polar manifolds and achieve an equivariantly…

We prove that every three-dimensional polyhedron is uniquely determined by its dihedral angles and edge lengths, even if nonconvex or self-intersecting, under two plausible sufficient conditions: (i) the polyhedron has only convex faces and…

We prove that a polar foliation of codimension at least three in an irreducible compact symmetric space is hyperpolar, unless the symmetric space has rank one. For reducible symmetric spaces of compact type, we derive decomposition results…

We find general geometric conditions on a convex body of revolution K, in dimensions four and six, so that its intersection body IK is not a polar zonoid. We exhibit several examples of intersection bodies which are are not polar zonoids.

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…

It has been a long-standing challenge to find a geometric object underlying the cosmological wavefunction for Tr($\phi^3$) theory, generalizing associahedra and surfacehedra for scattering amplitudes. In this note we describe a new class of…

Let $P$ be a (non necessarily convex) embedded polyhedron in $\R^3$, with its vertices on an ellipsoid. Suppose that the interior of $P$ can be decomposed into convex polytopes without adding any vertex. Then $P$ is infinitesimally rigid.…

A graph is called pseudo-outerplanar if each block has an embedding on the plane in such a way that the vertices lie on a fixed circle and the edges lie inside the disk of this circle with each of them crossing at most one another. In this…

The shellability of the boundary complex of an unbounded polyhedron is investigated. To this end, it is necessary to pass to a suitable compactification, e.g., by one point. This observation can be exploited to prove that any tropical…

We call a multigraph {\em non-homotopic} if it can be drawn in the plane in such a way that no two edges connecting the same pair of vertices can be continuously transformed into each other without passing through a vertex, and no loop can…

A fullerene graph is a cubic bridgeless planar graph with twelve 5-faces such that all other faces are 6-faces. We show that any fullerene graph on n vertices can be bipartized by removing O(sqrt{n}) edges. This bound is asymptotically…