Related papers: The Spherical Grasshopper Problem
We discuss how the kernel convolution approach can be used to accurately approximate the spatial covariance model on a sphere using spherical distances between points. A detailed derivation of the required formulas is provided. The proposed…
The approximate graph colouring problem, whose complexity is unresolved in most cases, concerns finding a $c$-colouring of a graph that is promised to be $k$-colourable, where $c\geq k$. This problem naturally generalises to promise graph…
We prove rigidity for hypersurfaces with boundary in the unit $(n+1)$-sphere with scalar curvature bounded below by $n(n-1)$. Under appropriate boundary conditions, the hypersurfaces are shown to be part of the equatorial spheres. The lower…
The conformal Skorokhod embedding problem (CSEP) is a planar variant of the classical problem where the solution is now a simply connected domain $D\subset\mathbb{C}$ whose exit time embeds a given probability distribution $\mu$ by…
Observational cosmology provides us with a large number of high precision data which are used to derive models trying to reproduce ``on the mean'' our observable patch of the Universe. Most of these attempts are achieved in the framework of…
A notorious problem in mathematics and physics is to create a solvable model for random sequential adsorption of non-overlapping congruent spheres in the $d$-dimensional Euclidean space with $d\geq 2$. Spheres arrive sequentially at…
An $i$-independent set is a vertex set whose pairwise distance is at least $i+1$. A proper (square) $k$-coloring of a graph $G$ is a partition of its vertex set into $k$ independent ($2$-independent) sets. A packing $(1^{j}, 2^k)$-coloring…
We consider the problem of $q$-colouring a $k$-uniform random hypergraph, where $q,k \geq 3$, and determine the rigidity threshold. For edge densities above the rigidity threshold, we show that almost all solutions have a linear number of…
Lensing in a spherically symmetric and static spacetime is considered, based on the lightlike geodesic equation without approximations. After fixing two radius values r_O and r_S, lensing for an observation event somewhere at r_O and static…
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is also used to model more traditional CSPs relevant to AI,…
The goal of this paper is to address some optimal control and shape optimisation problems arising from bulk-surface cooperative systems. The basic model under consideration is the following: letting $\Omega$ be a fixed domain, we assume…
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…
The Plateau's problem seeks to determine a surface of minimal area which spans a given boundary. It is widely studied for its varied mathematical formulations, applications and relevance to physical models such as soap films. We revisit the…
The Covering Salesman Problem (CSP) is a generalization of the Traveling Salesman Problem in which the tour is not required to visit all vertices, as long as all vertices are covered by the tour. The objective of CSP is to find a minimum…
The Gauss Circle Problem concerns finding asymptotics for the number of lattice point lying inside a circle in terms of the radius of the circle. The heuristic that the number of points is very nearly the area of the circle is surprisingly…
Let $S$ be a 2-colored (red and blue) set of $n$ points in the plane. A subset $I$ of $S$ is an island if there exits a convex set $C$ such that $I=C\cap S$. The discrepancy of an island is the absolute value of the number of red minus the…
We study the restricted motion of an electric charge in a spherical surface in the field of a magnetic dipole. This is the classical non-relativistic St\"oermer problem within a sphere, with the dipole in its centre. We start from a…
This survey reviews a collection of parallel phenomena between free boundary submanifolds in the Euclidean unit ball and closed submanifolds in the sphere, with particular emphasis on rigidity mechanisms, pinching thresholds, and canonical…
We start by providing a very simple and elementary new proof of the classical bound due to J. Beck which states that the spherical cap $\mathbb{L}_2$-discrepancy of any $N$ points on the unit sphere $\mathbb S^d$ in $\mathbb{R}^{d+1}$,…
We consider capillarity functionals which measure the perimeter of sets contained in a Euclidean half-space assigning a constant weight $\lambda \in (-1,1)$ to the portion of the boundary that touches the boundary of the half-space.…