English
Related papers

Related papers: Pseudo-edge unfoldings of convex polyhedra

200 papers

Mr. C. Stephanos posed the following question in the Interm\'ediaire des Math\'ematiciens: "Do there exist polyhedra with invariant facets that are susceptible to an infinite family of transformations that only alter solid angles and…

History and Overview · Mathematics 2012-03-07 Raoul Bricard

We consider the problem of stretching pseudolines in a planar straight-line drawing to straight lines while preserving the straightness and the combinatorial embedding of the drawing. We answer open questions by Mchedlidze et al. by showing…

Computational Geometry · Computer Science 2020-08-17 Marcel Radermacher , Ignaz Rutter , Peter Stumpf

The prism over a graph $G$ is the Cartesian product of $G$ with the complete graph on two vertices. A graph $G$ is prism-hamiltonian if the prism over $G$ is hamiltonian. We prove that every polyhedral graph (i.e. 3-connected planar graph)…

Combinatorics · Mathematics 2021-04-12 Simon Špacapan

We consider a complex Plateau problem for strongly pseudoconvex contours in non K\"ahler manifolds. A positive solution in the case of manifolds carrying a pluriclosed Hermitian metric forms is given. For the general case we propose a…

Complex Variables · Mathematics 2007-05-23 Sergei Ivashkovich

A simple topological graph is a topological graph in which any two edges have at most one common point, which is either their common endpoint or a proper crossing. More generally, in a k-simple topological graph, every pair of edges has at…

Computational Geometry · Computer Science 2016-02-22 Péter Hajnal , Alexander Igamberdiev , Günter Rote , André Schulz

Given a natural number k and an orientable surface S of finite type, define the k-curve graph to be the graph with vertices corresponding to isotopy classes of essential simple closed curves on S and with edges corresponding to pairs of…

Geometric Topology · Mathematics 2023-06-07 Shuchi Agrawal , Tarik Aougab , Yassin Chandran , Marissa Loving , J. Robert Oakley , Roberta Shapiro , Yang Xiao

Gromov has shown how to construct holomorphic maps of the plane to a complex manifold with prescribed values on a lattice. In the present paper, a similar interpolation theorem for pseudo-holomorphic maps from the cylinder S to an…

Differential Geometry · Mathematics 2010-06-10 Antoine Gournay

Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…

Metric Geometry · Mathematics 2026-03-10 Steven Hoehner

Let N a compact complex submanifold of a compact complex manifold M. We say N splits in M, if the holomorphic tangent bundle sequence splits holomorphically. By a result of Mok a splitting submanifold of a Kaehler Einstein manifold with a…

Algebraic Geometry · Mathematics 2015-05-18 Priska Jahnke , Ivo Radloff

The dual of a polyhedron is a polyhedron -- or in graph theoretical terms: the dual of a 3-connected plane graph is a 3-connected plane graph. Astonishingly, except for sufficiently large facewidth, not much is known about the connectivity…

Combinatorics · Mathematics 2021-10-20 Drago Bokal , Gunnar Brinkmannb , Carol T. Zamfirescu

We study hyperbolic polyhedral surfaces with faces isometric to regular hyperbolic polygons satisfying that the total angles at vertices are at least $2\pi.$ The combinatorial information of these surfaces is shown to be identified with…

Metric Geometry · Mathematics 2022-10-10 Yohji Akama , Bobo Hua

We study pseudo-geometric strongly regular graphs whose second subconstituent with respect to a vertex is a cover of a strongly regular graph or a complete graph. By studying the structure of such graphs, we characterize all graphs…

Combinatorics · Mathematics 2026-04-10 Edwin van Dam , Krystal Guo

The covariant derivative of the K\"ahler form of an almost pseudo-Hermitian or of an almost para-Hermitian manifold satisfies certain algebraic relations. We show, conversely, that any 3-tensor which satisfies these algebraic relations can…

Differential Geometry · Mathematics 2010-12-23 Miguel Brozos-Vázquez , Eduardo García-Río , Peter Gilkey , Luis Hervella

Motivated by the graph associahedron KG, a polytope whose face poset is based on connected subgraphs of G, we consider the notion of associativity and tubes on posets. This leads to a new family of simple convex polytopes obtained by…

Combinatorics · Mathematics 2015-06-16 Satyan L. Devadoss , Stefan Forcey , Stephen Reisdorf , Patrick Showers

We consider triangle faced convex polyhedra inscribed in the unit sphere $S^2$ in ${\Bbb{R}}^3$. One way of measuring their deviation from regular polyhedra with triangular faces is to consider the quotient of the lengths of the longest and…

Metric Geometry · Mathematics 2019-09-09 E. Makai,

The $k$-th symmetric product of a graph $G$ with vertex set $V$ with edge set $E$ is a graph with vertices as $k$-sets of $V$, where two $k$-sets are connected by an edge if and only if their symmetric difference is an edge in $E$. Using…

Combinatorics · Mathematics 2018-08-14 Yingkai Ouyang

For compact K\"ahlerian manifolds, the holomorphic pseudosymmetry reduces to the local symmetry if additionally the scalar curvature is constant and the structure function is non-negative. Similarly, the holomorphic Ricci-pseudosymmetry…

Differential Geometry · Mathematics 2010-11-18 Zbigniew Olszak

We define a new class of orthogonal polyhedra, called orthogrids, that can be unfolded without overlap with constant refinement of the gridded surface.

Computational Geometry · Computer Science 2013-10-18 Mirela Damian , Erik Demaine , Robin Flatland

We prove that, for any two polyhedral manifolds $\mathcal P, \mathcal Q$, there is a polyhedral manifold $\mathcal I$ such that $\mathcal P, \mathcal I$ share a common unfolding and $\mathcal I,\mathcal Q$ share a common unfolding. In other…

Computational Geometry · Computer Science 2025-10-08 Lily Chung , Erik D. Demaine , Jenny Diomidova , Tonan Kamata , Jayson Lynch , Ryuhei Uehara , Hanyu Alice Zhang

We prove that every internally 4-connected non-planar bipartite graph has an odd K_3,3 subdivision; that is, a subgraph obtained from K_3,3 by replacing its edges by internally disjoint odd paths with the same ends. The proof gives rise to…

Combinatorics · Mathematics 2017-03-28 Robin Thomas , Peter Whalen
‹ Prev 1 8 9 10 Next ›