English
Related papers

Related papers: Unsplittable coverings in the plane

200 papers

It is shown that $m$ disjoint sets with fixed Gaussian volumes that partition $\mathbb{R}^{n}$ with minimum Gaussian surface area must be $(m-1)$-dimensional. This follows from a second variation argument using infinitesimal translations.…

Functional Analysis · Mathematics 2021-07-13 Steven Heilman

We prove that the following problem has the same computational complexity as the existential theory of the reals: Given a generic self-intersecting closed curve $\gamma$ in the plane and an integer $m$, is there a polygon with $m$ vertices…

Computational Geometry · Computer Science 2019-08-28 Jeff Erickson

The stable and unstable manifolds of an invariant set of a piecewise-smooth map are themselves piecewise-smooth. Consequently, as parameters of a piecewise-smooth map are varied, an invariant set can develop a homoclinic connection when its…

Dynamical Systems · Mathematics 2016-08-03 David J. W. Simpson

We consider the covering of a ball in certain normed spaces by its congruent subsets and show that if the finite number of sets is not greater than the dimensionality of the space, then the centre of the ball either belongs to the interior…

Functional Analysis · Mathematics 2017-08-07 Sergij V. Goncharov

A version of a conjecture of McMullen is as follows: Given a hyperbolizable 3-manifold M with incompressible boundary, there exists a uniform constant K such that if N is a hyperbolic 3-manifold homeomorphic to the interior of M, then the…

Geometric Topology · Mathematics 2007-05-23 Carol E. Fan

We are interested in the following problem of covering the plane by a sequence of congruent circular disks with a constraint on the distance between consecutive disks. Let $(\mathcal{D}_n)_{n \in \mathbb N}$ be a sequence of closed unit…

Metric Geometry · Mathematics 2020-06-19 Amitava Bhattacharya , Anupam Mondal

A triple system is cancellative if no three of its distinct edges satisfy $A \cup B=A \cup C$. It is tripartite if it has a vertex partition into three parts such that every edge has exactly one point in each part. It is easy to see that…

Combinatorics · Mathematics 2009-10-16 Jozsef Balogh , Dhruv Mubayi

Many algorithmic problems can be solved (almost) as efficiently in metric spaces of bounded doubling dimension as in Euclidean space. Unfortunately, the metric space defined by points in a simple polygon equipped with the geodesic distance…

Computational Geometry · Computer Science 2026-04-20 Mark de Berg , Prosenjit Bose , Leonidas Theocharous

In this paper,\ the authors define a space with an uniform base at non-isolated points, give some characterizations of images of metric spaces by boundary-compact maps, and study certain relationship among spaces with special base…

General Topology · Mathematics 2011-06-22 Fucai Lin , Shou Lin

A $\lambda$-fold $r$-packing (multiple radius-$r$ covering) in a Hamming metric space is a code $C$ such that the radius-$r$ balls centered in $C$ cover each vertex of the space by not more (not less, respectively) than $\lambda$ times. The…

Discrete Mathematics · Computer Science 2021-05-25 Denis S. Krotov , Vladimir N. Potapov

In the author's PhD thesis (2019) universal envelopes were introduced as a tool for studying the continuously obtainable information on discontinuous functions. To any function $f \colon X \to Y$ between $\operatorname{qcb}_0$-spaces one…

Logic in Computer Science · Computer Science 2023-06-22 Eike Neumann

We survey results on the problem of covering the space ${\mathbb R}^n$, or a convex body in it, by translates of a convex body. Our main goal is to present a diverse set of methods. A theorem of Rogers is a central result, according to…

Metric Geometry · Mathematics 2016-03-16 Márton Naszódi

A range family $\mathcal{R}$ is a family of subsets of $\mathbb{R}^d$, like all halfplanes, or all unit disks. Given a range family $\mathcal{R}$, we consider the $m$-uniform range capturing hypergraphs $\mathcal{H}(V,\mathcal{R},m)$ whose…

Combinatorics · Mathematics 2023-11-01 Tim Planken , Torsten Ueckerdt

We study dynamic conflict-free colorings in the plane, where the goal is to maintain a conflict-free coloring (CF-coloring for short) under insertions and deletions. - First we consider CF-colorings of a set $S$ of unit squares with respect…

Computational Geometry · Computer Science 2017-10-02 Mark de Berg , Aleksandar Markovic

We provide an equivariant description/classification of all complete (compact or not) non-negatively curved manifolds M together with a co-compact action by a reflection group W, and moreover, classify such W. In particular, we show that…

Differential Geometry · Mathematics 2017-01-03 Fuquan Fang , Karsten Grove

Following the seminal work of Erlebach and van Leeuwen in SODA 2008, we introduce the minimum ply covering problem. Given a set $P$ of points and a set $S$ of geometric objects, both in the plane, our goal is to find a subset $S'$ of $S$…

Computational Geometry · Computer Science 2019-05-03 Therese Biedl , Ahmad Biniaz , Anna Lubiw

In this note, we show that for a smooth algebraic variety $Y$ and a smooth $m$-section $X$ of the $\mathbb{P}^1$-bundle \[ f : \mathbb{P}(\mathcal{O}_Y \oplus \mathcal{O}_Y(E)) \longrightarrow Y, \] where $E$ is an effective divisor on $Y$…

Algebraic Geometry · Mathematics 2026-01-13 Youngook Choi , Hristo Iliev , Seonja Kim

You find a stain on the wall and decide to cover it with non-overlapping stickers of a single identical shape (rotation and reflection are allowed). Is it possible to find a sticker shape that fails to cover the stain? In this paper, we…

Data Structures and Algorithms · Computer Science 2026-02-24 Keigo Oka , Naoki Inaba , Akira Iino

A long-standing Conjecture of S. Negami states that a connected graph has a finite planar cover if and only if it embeds in the projective plane. It is known that the Conjecture is equivalent to the fact that \emph{the graph $K_{1,2, 2, 2}$…

Combinatorics · Mathematics 2024-12-30 Dickson Annor , Yuri Nikolayevsky , Michael Payne

This paper proves that for each positive integer $m$, there is a planar graph $G$ which is not $(4m+\lfloor \frac{2m-1}{9}\rfloor,m)$-choosable. Then we pose some conjectures concerning multiple list colouring of planar graphs.

Combinatorics · Mathematics 2016-05-17 Xuding Zhu
‹ Prev 1 8 9 10 Next ›