English
Related papers

Related papers: Octants are Cover Decomposable

200 papers

In this paper we prove that the surface of the cuboctahedron can be triangulated into 8 non-obtuse triangles and 12 acute triangles. Furthermore, we show that both bounds are the best possible.

Combinatorics · Mathematics 2012-09-21 Xiao Feng , Liping Yuan

We present new examples of topologically convex edge-ununfoldable polyhedra, i.e., polyhedra that are combinatorially equivalent to convex polyhedra, yet cannot be cut along their edges and unfolded into one planar piece without overlap.…

Computational Geometry · Computer Science 2020-07-30 Erik D. Demaine , Martin L. Demaine , David Eppstein

Quotients $Y=X/conj$ of complex surfaces by anti-holomorphic involutions $conj\: X\to X$ tend to be completely decomposable when they are simply connected, i.e., split into connected sums, $n CP^2\#m\barCP2$, if $w_2(Y)\ne0$, or into…

dg-ga · Mathematics 2008-02-03 Sergey Finashin

We study the problem of covering a given point set in the plane by unit disks so that each point is covered exactly once. We prove that 17 points can always be exactly covered. On the other hand, we construct a set of 657 points where an…

Metric Geometry · Mathematics 2024-01-30 Ji Hoon Chun , Christian Kipp , Sandro Roch

For $m=2$ and $m=3$ we prove that any connected, oriented, open manifold $M^m$ admits a simple branched covering map over $\mathbb{R}^m$. When $M$ has $k$ ends and $k$ is finite, the degree of the cover can be taken to be $mk$. Regardless…

Geometric Topology · Mathematics 2025-12-10 Mark Hughes , Alexandra Kjuchukova , Maggie Miller

A multigraph G is triangle decomposable if its edge set can be partitioned into subsets, each of which induces a triangle of G, and rationally triangle decomposable if its triangles can be assigned rational weights such that for each edge e…

Combinatorics · Mathematics 2015-04-03 Christina , Mynhardt , Christopher van Bommel

Some ball-quotient orbifolds are related by covering maps. We exploit these coverings to find infinite towers of orbifolds uniformized by the complex 2-ball and some orbifolds over K3 surfaces uniformized by the 2-ball. Corresponding…

Algebraic Geometry · Mathematics 2007-05-23 A. Muhammed Uludag

It is shown that every orthogonal terrain, i.e., an orthogonal (right-angled) polyhedron based on a rectangle that meets every vertical line in a segment, has a grid unfolding: its surface may be unfolded to a single non-overlapping piece…

Computational Geometry · Computer Science 2007-07-12 Joseph O'Rourke

Motivated by a question of R.\ Nandakumar, we show that the Euclidean plane can be dissected into mutually incongruent convex quadrangles of the same area and the same perimeter. As a byproduct we obtain vertex-to-vertex dissections of the…

Metric Geometry · Mathematics 2020-04-03 Dirk Frettlöh , Christian Richter

We study the homeomorphism types of certain covers of (always orientable) surfaces, usually of infinite-type. We show that every surface with non-abelian fundamental group is covered by every noncompact surface, we identify the universal…

Geometric Topology · Mathematics 2025-08-05 Ian Biringer , Yassin Chandran , Tommaso Cremaschi , Jing Tao , Nicholas G. Vlamis , Mujie Wang , Brandis Whitfield

This paper proves a corner occupying theorem for the two-dimensional integral rectangle packing problem, stating that if it is possible to orthogonally place n arbitrarily given integral rectangles into an integral rectangular container…

Discrete Mathematics · Computer Science 2011-11-17 Wenqi Huang , Tao Ye , Duanbing Chen

The 3-Decomposition Conjecture states that every connected cubic graph can be decomposed into a spanning tree, a 2-regular subgraph and a matching. We show that this conjecture holds for the class of connected plane cubic graphs.

Combinatorics · Mathematics 2017-10-31 Arthur Hoffmann-Ostenhof , Tomáš Kaiser , Kenta Ozeki

We show that any surface of infinite type admits an ideal triangulation. Furthermore, we show that a set of disjoint arcs can be completed into a triangulation if and only if, as a set, they intersect every simple closed curve a finite…

Geometric Topology · Mathematics 2021-02-19 Alan McLeay , Hugo Parlier

We prove that every cusped hyperbolic 3-manifold has a finite cover admitting infinitely many geometric ideal triangulations. Furthermore, every long Dehn filling of one cusp in this cover admits infinitely many geometric ideal…

Geometric Topology · Mathematics 2022-11-22 David Futer , Emily Hamilton , Neil R. Hoffman

In this paper we deal with edge-to-edge, irreducible decompositions of a centrally symmetric convex $(2k)$-gon into centrally symmetric convex pieces. We prove an upper bound on the number of these decompositions for any value of $k$, and…

Metric Geometry · Mathematics 2016-02-09 Júlia Frittmann , Zsolt Lángi

This paper introduces a notion of decompositions of integral varifolds into countably many integral varifolds, and the existence of such decomposition of integral varifolds whose first variation is representable by integration is…

Differential Geometry · Mathematics 2023-07-26 Hsin-Chuang Chou

Let F be a foliation of codimension 2 on a compact manifold with at least one non-compact leaf. We show that then F must contain uncountably many non-compact leaves. We prove the same statement for oriented p-dimensional foliations of…

Geometric Topology · Mathematics 2014-10-01 Elmar Vogt

The conformation space of cyclooctane, a ringlike organic molecule comprising eight carbon atoms, is a two-dimensional algebraic variety, which has been studied extensively for more than 90 years. We propose a cell structure representing…

General Topology · Mathematics 2025-02-28 Ulrich Bauer , Fabian Lenzen

In this paper we generalize previous work on decomposition in three-dimensional orbifolds by 2-groups realized as analogues of central extensions, to orbifolds by more general 2-groups. We describe the computation of such orbifolds in…

High Energy Physics - Theory · Physics 2023-08-23 Alonso Perez-Lona , Eric Sharpe

Consider a graph with a rotation system, namely, for every vertex, a circular ordering of the incident edges. Given such a graph, an angle cover maps every vertex to a pair of consecutive edges in the ordering -- an angle -- such that each…

Computational Geometry · Computer Science 2022-09-23 William Evans , Ellen Gethner , Jack Spalding-Jamieson , Alexander Wolff