English
Related papers

Related papers: Octants are Cover-Decomposable into Many Coverings

200 papers

We prove that octants are cover-decomposable, i.e., any 12-fold covering of any subset of the space with a finite number of translates of a given octant can be decomposed into two coverings. As a corollary, we obtain that any 12-fold…

Combinatorics · Mathematics 2015-03-17 Balázs Keszegh , Dömötör Pálvölgyi

A planar set $P$ is said to be cover-decomposable if there is a constant $k=k(P)$ such that every $k$-fold covering of the plane with translates of $P$ can be decomposed into two coverings. It is known that open convex polygons are…

Metric Geometry · Mathematics 2014-03-12 István Kovács , Géza Tóth

In this note we improve our upper bound given earlier by showing that every 9-fold covering of a point set in the space by finitely many translates of an octant decomposes into two coverings, and our lower bound by a construction for a…

Combinatorics · Mathematics 2015-11-18 Balázs Keszegh , Dömötör Pálvölgyi

We give new positive results on the long-standing open problem of geometric covering decomposition for homothetic polygons. In particular, we prove that for any positive integer k, every finite set of points in R^3 can be colored with k…

Computational Geometry · Computer Science 2014-05-30 Jean Cardinal , Kolja Knauer , Piotr Micek , Torsten Ueckerdt

We prove that for every centrally symmetric convex polygon Q, there exists a constant alpha such that any alpha*k-fold covering of the plane by translates of Q can be decomposed into k coverings. This improves on a quadratic upper bound…

Computational Geometry · Computer Science 2020-07-21 G. Aloupis , J. Cardinal , S. Collette , S. Langerman , D. Orden , P. Ramos

We prove that for any convex polygon $S$ with at least four sides, or a concave one with no parallel sides, and any $m>0$, there is an $m$-fold covering of the plane with homothetic copies of $S$ that cannot be decomposed into two…

Computational Geometry · Computer Science 2015-03-13 István Kovács

We study two decomposition problems in combinatorial geometry. The first part deals with the decomposition of multiple coverings of the plane. We say that a planar set is cover-decomposable if there is a constant m such that any m-fold…

Combinatorics · Mathematics 2010-09-27 Dömötör Pálvölgyi

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

Decompositions on manifolds appear in various geometric structures. Necessary and sufficient conditions for quotient spaces of decompositions to be manifolds are widely characterized. We characterize necessary and sufficient conditions to…

Geometric Topology · Mathematics 2022-02-16 Tomoo Yokoyama

A system of sets forms an {\em $m$-fold covering} of a set $X$ if every point of $X$ belongs to at least $m$ of its members. A $1$-fold covering is called a {\em covering}. The problem of splitting multiple coverings into several coverings…

Metric Geometry · Mathematics 2015-05-27 János Pach , Dömötör Pálvölgyi

Suppose $k$ is a positive integer and $\mathcal{X}$ is a $k$-fold packing of the plane by infinitely many arc-connected compact sets, which means that every point of the plane belongs to at most $k$ sets. Suppose there is a function…

Metric Geometry · Mathematics 2016-01-13 János Pach , Bartosz Walczak

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

Let $X$ be a set, $\ka$ be a cardinal number and let $\iH$ be a family of subsets of $X$ which covers each $x\in X$ at least $\ka$ times. What assumptions can ensure that $\iH$ can be decomposed into $\kappa$ many disjoint subcovers? We…

Combinatorics · Mathematics 2009-11-17 Márton Elekes , Tamás Mátrai , Lajos Soukup

A permutation is $k$-coverable if it can be partitioned into $k$ monotone subsequences. Barber conjectured that, for any given permutation, if every subsequence of length $k+2 \choose 2$ is $k$-coverable then the permutation itself is…

Combinatorics · Mathematics 2025-04-14 David Wärn

We prove that any knot or link in any 3-manifold can be nicely decomposed (splitted) by a filling Dehn sphere. This has interesting consequences in the study of branched coverings over knots and links. We give an algorithm for computing…

Geometric Topology · Mathematics 2015-09-04 Álvaro Lozano Rojo , Rubén Vigara Benito

One can embed arbitrarily many disjoint, non-parallel, non-boundary parallel, incompressible surfaces in any three manifold with at least one boundary component of genus two or greater [4]. This paper proves the contrasting, but not…

Geometric Topology · Mathematics 2007-05-23 Hugh Nelson Howards

We introduce a new notion for geometric families called self-coverability and show that homothets of convex polygons are self-coverable. As a corollary, we obtain several results about coloring point sets such that any member of the family…

Metric Geometry · Mathematics 2014-03-17 Balázs Keszegh , Dömötör Pálvölgyi

We show that, for any prime p, a knot K in the 3-sphere is determined by its p-fold cyclic unbranched covering. We also investigate when the m-fold cyclic unbranched covering of a knot coincides with the n-fold cyclic unbranched covering of…

Geometric Topology · Mathematics 2008-05-27 Bruno P. Zimmermann

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

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
‹ Prev 1 2 3 10 Next ›