English
Related papers

Related papers: Pseudo-edge unfoldings of convex polyhedra

200 papers

For a finite planar graph, it associates with some metric spaces, called (regular) spherical polyhedral surfaces, by replacing faces with regular spherical polygons in the unit sphere and gluing them edge-to-edge. We consider the class of…

Metric Geometry · Mathematics 2018-05-01 Yohji Akama , Bobo Hua , Yanhui Su

Eberhard proved that for every sequence $(p_k), 3\le k\le r, k\ne 5,7$ of non-negative integers satisfying Euler's formula $\sum_{k\ge3} (6-k) p_k = 12$, there are infinitely many values $p_6$ such that there exists a simple convex…

Combinatorics · Mathematics 2010-05-07 Matt DeVos , Agelos Georgakopoulos , Bojan Mohar , Robert Šámal

A polyhedron is a graph $G$ which is simple, planar and 3-connected. In this note, we classify the family of strongly involutive self-dual polyhedra. The latter is done by using a well-known result due to Tutte characterizing 3-connected…

Combinatorics · Mathematics 2020-05-11 Javier Bracho , Luis Montejano , Eric Pauli , Jorge Luis Ramirez Alfonsin

Graph manifolds form important classes of $3$-dimensional closed and orientable manifolds. For example, {\it Seifert} manifolds are graph manifolds where hyperbolic manifolds are not. In applying singularity theory of differentiable maps to…

Geometric Topology · Mathematics 2022-08-16 Naoki Kitazawa

A polycube is an orthogonal polyhedron composed of unit cubes glued together along entire faces, and homeomorphic to a sphere. A layer of a polycube refers to the portion lying between two horizontal cross-sections spaced one unit apart. We…

Computational Geometry · Computer Science 2025-07-15 Mirela Damian , Henk Meijer

A drawing of a graph is {\em pseudolinear} if there is a pseudoline arrangement such that each pseudoline contains exactly one edge of the drawing. The {\em pseudolinear crossing number} of a graph $G$ is the minimum number of pairwise…

Combinatorics · Mathematics 2019-04-29 Cesar Hernandez-Velez , Jesus Leanos , Gelasio Salazar

The main result of this paper is that the identity component of the automorphism group of a compact, connected, strictly pseudoconvex CR manifold is compact unless the manifold is CR equivalent to the standard sphere. In dimensions greater…

Complex Variables · Mathematics 2009-09-25 John M. Lee

If $G$ and $H$ are two cubic graphs, then an $H$-coloring of $G$ is a proper edge-coloring $f$ with edges of $H$, such that for each vertex $x$ of $G$, there is a vertex $y$ of $H$ with $f(\partial_G(x))=\partial_H(y)$. If $G$ admits an…

Combinatorics · Mathematics 2018-07-26 Anush Hakobyan , Vahan Mkrtchyan

We show that every orthogonal polyhedron of genus at most 2 can be unfolded without overlap while using only a linear number of orthogonal cuts (parallel to the polyhedron edges). This is the first result on unfolding general orthogonal…

Computational Geometry · Computer Science 2016-11-02 Mirela Damian , Erik Demaine , Robin Flatland , Joseph O'Rourke

It is well known that the set of possible degree sequences for a graph on $n$ vertices is the intersection of a lattice and a convex polytope. We show that the set of possible degree sequences for a $k$-uniform hypergraph on $n$ vertices is…

Combinatorics · Mathematics 2012-01-31 Ricky Ini Liu

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…

Metric Geometry · Mathematics 2021-10-29 Frank Göring , Martin Winter

A $k$-orbit maniplex is one that has $k$ orbits of flags under the action of its automorphism group. In this paper we extend the notion of symmetry type graphs of maps to that of maniplexes and polytopes and make use of them to study…

Combinatorics · Mathematics 2013-06-10 Gabe Cunningham , Maria del Rio Francos , Isabel Hubard , Micael Toledo

A notion of dual curve for pseudoholomorphic curves in 4--manifolds turns out to be possible only if the notion of almost complex structure structure is slightly generalized. The resulting structure is as easy (perhaps easier) to work with,…

Differential Geometry · Mathematics 2007-05-23 Benjamin McKay

This paper studies complex cobordisms between compact, three dimensional, strictly pseudoconvex Cauchy-Riemann manifolds. Suppose the complex cobordism is given by a complex 2-manifold X with one pseudoconvex and one pseudoconcave end. We…

Complex Variables · Mathematics 2007-05-23 Bruno De Oliveira

If K is an odd-dimensional flag closed manifold, flag generalized homology sphere or a more general flag weak pseudomanifold with sufficiently many vertices, then the maximal number of edges in K is achieved by the balanced join of cycles.…

Combinatorics · Mathematics 2013-03-25 Michal Adamaszek

We construct a family of 1-convex threefolds, with exceptional curve C of type (0,-2), which are not embeddable in C^m \times CP_n. In order to show that they are not Kaehler we exhibit a real 3-dimensional chain A whose boundary is the…

Complex Variables · Mathematics 2007-05-23 Giovanni Bassanelli , Marco Leoni

Every embedded surface $\mathcal{K}$ in the 4-sphere admits a bridge trisection, a decomposition of $(S^4,\mathcal{K})$ into three simple pieces. In this case, the surface $\mathcal{K}$ is determined by an embedded 1-complex, called the…

Geometric Topology · Mathematics 2024-09-20 Jeffrey Meier , Abigail Thompson , Alexander Zupan

We prove a compactness theorem for holomorphic curves in 4-dimensional symplectizations that have embedded projections to the underlying 3-manifold. It strengthens the cylindrical case of the SFT compactness theorem by using intersection…

Symplectic Geometry · Mathematics 2008-03-07 Chris Wendl

Symmetric edge polytopes of graphs are important object in Ehrhart theory,and have an application to Kuramoto models. In the present paper, we study the upper and lower bounds for the number of facets of symmetric edge polytopes of…

Combinatorics · Mathematics 2025-05-01 Aki Mori , Kenta Mori , Hidefumi Ohsugi

Tutte's embedding theorem states that every 3-connected graph without a $K_5$ or $K_{3,3}$ minor (i.e. a planar graph) is embedded in the plane if the outer face is in convex position and the interior vertices are convex combinations of…

Computational Geometry · Computer Science 2023-03-28 Marc Alexa