English
Related papers

Related papers: More on Decomposing Coverings by Octants

200 papers

We introduce the fully-dynamic conflict-free coloring problem for a set $S$ of intervals in $\mathbb{R}^1$ with respect to points, where the goal is to maintain a conflict-free coloring for$S$ under insertions and deletions. A coloring is…

Computational Geometry · Computer Science 2019-01-16 Mark de Berg , Tim Leijsen , André van Renssen , Marcel Roeloffzen , Aleksandar Markovic , Gerhard Woeginger

We show that any orientation of a graph with maximum degree three has an oriented 9-colouring, and that any orientation of a graph with maximum degree four has an oriented 69-colouring. These results improve the best known upper bounds of…

Discrete Mathematics · Computer Science 2018-12-14 Christopher Duffy , Gary MacGillivray , Eric Sopena

In this paper we characterize primitive branched coverings with minimal defect over the projective plane with respect to the properties decomposable and indecomposable. This minimality is achieved when the covering surface is also the…

Geometric Topology · Mathematics 2023-10-17 Natalia A. Viana Bedoya , Daciberg Lima Gonçalves

We study branched covering spaces in several contexts, proving that under suitable circumstances the cover satisfies the same upper curvature bounds as the base space. The first context is of a branched cover of an arbitrary metric space…

Differential Geometry · Mathematics 2007-05-23 Daniel Allcock

Hutchinson, Richter and Seymour [J. Combin. Theory Ser. B 84 (2002), 225-239] showed that every Eulerian triangulation of an orientable surface that has a sufficiently high representativity is 4-colorable. We give an explicit bound on the…

Combinatorics · Mathematics 2024-10-01 Marcin Brianski , Daniel Kral , Ander Lamaison , Xichao Shu

We study the problem of colouring the vertices of a polygon, such that every viewer in it can see a unique colour. The goal is to minimise the number of colours used. This is also known as the conflict-free chromatic guarding problem with…

Computational Geometry · Computer Science 2020-04-07 Onur Çağırıcı , Subir Kumar Ghosh , Petr Hliněný , Bodhayan Roy

We consider four problems. Rogers proved that for any convex body $K$, we can cover ${\mathbb R}^d$ by translates of $K$ of density very roughly $d\ln d$. First, we extend this result by showing that, if we are given a family of positive…

Metric Geometry · Mathematics 2017-03-09 Nóra Frankl , János Nagy , Márton Naszódi

We classify all finite linear spaces on at most 15 points admitting a blocking set. There are no such spaces on 11 or fewer points, one on 12 points, one on 13 points, two on 14 points, and five on 15 points. The proof makes extensive use…

Combinatorics · Mathematics 2007-05-23 L. M. Pretorius , K. J. Swanepoel

We prove the infinitesimal rigidity of some geometrically infinite hyperbolic 4- and 5-manifolds. These examples arise as infinite cyclic coverings of finite-volume hyperbolic manifolds obtained by colouring right-angled polytopes, already…

Geometric Topology · Mathematics 2023-01-19 Ludovico Battista

We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let $ N>0 $ and $ L\in\mathbb{Z}_{\ge2} $. A multiple packing is a set…

Metric Geometry · Mathematics 2022-11-10 Yihan Zhang , Shashank Vatedka

We give an upper bound for the growth of homology torsions of finite coverings of irreducible 3-manifolds with tori boundary in terms of hyperbolic volume.

Geometric Topology · Mathematics 2017-07-17 Thang Le

For the existence of a branched covering Sigma~ --> Sigma between closed surfaces there are easy necessary conditions in terms of chi(Sigma~), chi(Sigma), orientability, the total degree, and the local degrees at the branching points. A…

Geometric Topology · Mathematics 2009-05-26 Ekaterina Pervova , Carlo Petronio

We show that the lines of every arrangement of $n$ lines in the plane can be colored with $O(\sqrt{n/ \log n})$ colors such that no face of the arrangement is monochromatic. This improves a bound of Bose et al. \cite{BCC12} by a…

Computational Geometry · Computer Science 2015-03-20 Eyal Ackerman , Rom Pinchasi

We prove a new, tight upper bound on the number of incidences between points and hyperplanes in Euclidean d-space. Given n points, of which k are colored red, there are O_d(m^{2/3}k^{2/3}n^{(d-2)/3} + kn^{d-2} + m) incidences between the k…

Combinatorics · Mathematics 2012-01-10 Ben D. Lund , George B. Purdy , Justin W. Smith

We consider the set multi-cover problem in geometric settings. Given a set of points P and a collection of geometric shapes (or sets) F, we wish to find a minimum cardinality subset of F such that each point p in P is covered by (contained…

Computational Geometry · Computer Science 2009-09-04 Chandra Chekuri , Kenneth L. Clarkson , Sariel Har-Peled

Arrangements of pseudolines are a widely studied generalization of line arrangements. They are defined as a finite family of infinite curves in the Euclidean plane, any two of which intersect at exactly one point. One can state various…

Combinatorics · Mathematics 2024-02-21 Sandro Roch

We show that the number of double points of smoothly immersed 2-spheres representing certain homology classes of an oriented, smooth, closed, simply-connected 4-manifold X must increase with the complexity of corresponding h-cobordisms from…

Geometric Topology · Mathematics 2021-01-06 Hannah R. Schwartz

The inclusion relation between simple objects in the plane may be used to define geometric set systems, or hypergraphs. Properties of various types of colorings of these hypergraphs have been the subject of recent investigations, with…

Computational Geometry · Computer Science 2015-03-17 Jean Cardinal , Matias Korman

We give a lower bound for the degree of a finite cover of a hyperbolic 3-manifold which fibers over the circle, in terms of volume, the diameter of the manifold and other new invariants.

Geometric Topology · Mathematics 2021-09-23 Inkang Kim , Hongbin Sun

We consider closed orientable 3-dimensional hyperbolic manifolds which are cyclic branched coverings of the 3-sphere, with branching set being a two-bridge knot (or link). We establish two-sided linear bounds depending on the order of the…

Geometric Topology · Mathematics 2011-01-18 Carlo Petronio , Andrei Vesnin