English
Related papers

Related papers: Octants are Cover Decomposable

200 papers

We prove that for any point set P in the plane, a triangle T, and a positive integer k, there exists a coloring of P with k colors such that any homothetic copy of T containing at least ck^8 points of P, for some constant c, contains at…

Computational Geometry · Computer Science 2012-12-12 Jean Cardinal , Kolja Knauer , Piotr Micek , Torsten Ueckerdt

We prove that any length metric space homeomorphic to a surface may be decomposed into non-overlapping convex triangles of arbitrarily small diameter. This generalizes a previous result of Alexandrov--Zalgaller for surfaces of bounded…

Metric Geometry · Mathematics 2022-06-13 Paul Creutz , Matthew Romney

We prove that any compact surface with constant positive curvature and conical singularities can be decomposed into irreducible components of standard shape, glued along geodesic arcs connecting conical singularities. This is a spherical…

Geometric Topology · Mathematics 2022-01-05 Guillaume Tahar

Unfolding a convex polyhedron into a simple planar polygon is a well-studied problem. In this paper, we study the limits of unfoldability by studying nonconvex polyhedra with the same combinatorial structure as convex polyhedra. In…

Computational Geometry · Computer Science 2007-05-23 Marshall Bern , Erik D. Demaine , David Eppstein , Eric Kuo , Andrea Mantler , Jack Snoeyink

We study triangle decompositions of graphs. We consider constructions of classes of graphs where every edge lies on a triangle and the addition of the minimum number of multiple edges between already adjacent vertices results in a strongly…

Combinatorics · Mathematics 2021-08-23 C. M. Mynhardt , A. K. Wright

A deflated polygon is a polygon with no visibility crossings. We answer a question posed by Devadoss et al. (2012) by presenting a polygon that cannot be deformed via continuous visibility-decreasing motion into a deflated polygon. We show…

Computational Geometry · Computer Science 2019-05-21 Prosenjit Bose , Vida Dujmović , Nima Hoda , Pat Morin

While every matrix admits a singular value decomposition, in which the terms are pairwise orthogonal in a strong sense, higher-order tensors typically do not admit such an orthogonal decomposition. Those that do have attracted attention…

Algebraic Geometry · Mathematics 2015-12-29 Ada Boralevi , Jan Draisma , Emil Horobet , Elina Robeva

In this work we characterize branch data of branched coverings of even degree over the projective plane which are realizable by indecomposable branched coverings.

Geometric Topology · Mathematics 2010-05-05 Natalia A. Viana Bedoya , Daciberg Lima Gonçalves

We determine which connected surfaces can be partitioned into topological circles. There are exactly seven such surfaces up to homeomorphism: those of finite type, of Euler characteristic zero, and with compact boundary components. As a…

General Topology · Mathematics 2011-01-04 Gábor Moussong , Nándor Simányi

We pose and answer several questions concerning the number of ways to fold a polygon to a polytope, and how many polytopes can be obtained from one polygon; and the analogous questions for unfolding polytopes to polygons. Our answers are,…

Computational Geometry · Computer Science 2007-05-23 Erik D. Demaine , Martin L. Demaine , Anna Lubiw , Joseph O'Rourke

We determine the quadratic type of the 2-modular principal indecomposable modules of the double covers of alternating groups.

Representation Theory · Mathematics 2018-03-12 John Murray

Motivated by a question of R.\ Nandakumar, we show that the Euclidean plane can be dissected into mutually incongruent convex pentagons of the same area and the same perimeter.

Metric Geometry · Mathematics 2022-02-04 Dirk Frettlöh , Christian Richter

Let P be a polygon with rational vertices in the plane. We show that for any finite odd-sized collection of translates of P, the area of the set of points lying in an odd number of these translates is bounded away from 0 by a constant…

Combinatorics · Mathematics 2017-01-04 Rom Pinchasi , Yuri Rabinovich

Let $\Pi$ be a convex decomposition of a set $P$ of $n\geq 3$ points in general position in the plane. If $\Pi$ consists of more than one polygon, then either $\Pi$ contains a deletable edge or $\Pi$ contains a contractible edge.

Combinatorics · Mathematics 2017-09-19 Ferran Hurtado , Eduardo Rivera-Campo

If all but two vertices of a triangulated sphere have degrees divisible by $k$, then the exceptional vertices are not adjacent. This theorem is proved for $k=2$ with the help of the coloring monodromy. For $k = 3, 4, 5$ colorings by the…

Combinatorics · Mathematics 2015-11-23 Ivan Izmestiev

We prove that a set of finite perimeter is indecomposable if and only if it is, up to a choice of suitable representative, connected in the 1-fine topology. This gives a topological characterization of indecomposability which is new even in…

Metric Geometry · Mathematics 2025-12-23 Paolo Bonicatto , Panu Lahti , Enrico Pasqualetto

A foliation of a manifold M is called R-covered if its lift to the universal cover of M has space of leaves R. We show that there are many graph manifolds which admit taut foliations, but which do not admit any R-covered foliations. On the…

Geometric Topology · Mathematics 2007-05-23 Mark Brittenham

The main purpose of this paper is to prove that the positive real numbers can be decomposed into finitely many disjoint pieces which are also closed under addition and multiplication. As a byproduct of the argument we determine all the…

Number Theory · Mathematics 2023-03-30 Gergely Kiss , Gábor Somlai , Tamás Terpai

The decomposability of a Cartesian product of two nondecomposable manifolds into products of lower dimensional manifolds is studied. For 3-manifolds we obtain an analog of a result due to Borsuk for surfaces, and in higher dimensions we…

Geometric Topology · Mathematics 2017-12-01 Slawomir Kwasik , Reinhard Schultz

A plank is the part of space between two parallel planes. The following open problem, posed 45 years ago, can be viwed as the converse of Tarski's plank problem (Bang's theorem): Is it true that if the total width of a collection of planks…

Combinatorics · Mathematics 2025-11-26 Andrey Kupavskii , Janos Pach