Related papers: Generalizing the Covering Path Problem on a Grid
We study necessary conditions on the geometry and the topology of domains in $\mathbb{R}^2$ that support a positive solution to a classical overdetermined elliptic problem. The ideas and tools we use come from constant mean curvature…
A class of surfaces-graphs in a Riemannian 3-space with a prescribed projection of one field of principal directions onto a surface $\Pi$ is considered. A problem of determination of such surfaces when both principal curvatures are given…
Computing the crossing number of a graph is one of the most classical problems in computational geometry. Both it and numerous variations of the problem have been studied, and overcoming their frequent computational difficulty is an active…
When a convex perfectly conducting inclusion is closely spaced to the boundary of the matrix domain, a bigger convex domain containing the inclusion, the electric field can be arbitrary large. We establish both the pointwise upper bound and…
We study a counting version of Cycle Double Cover Conjecture. We discuss why it is more interesting to count circuits (i.e., graphs isomorphic to $C_k$ for some $k$) instead of cycles (graphs with all degrees even). We give an…
We study the Lawn Mowing Problem restricted to periodic billiard paths in the unit square. Given the combinatorial data of a trajectory, we determine the optimal covering radius, and identify the shortest path that covers the square for any…
We provide a quantitative obstruction to collapsing surfaces of genus at least 2 under a lower curvature bound and an upper diameter bound. Keywords: curvature; diameter; volume; filling radius; systole; Gromov-Hausdorff distance
A path cover of a graph is a set of disjoint paths so that every vertex in the graph is contained in one of the paths. The path cover number $p(G)$ of graph $G$ is the cardinality of a path cover with the minimum number of paths. Reed in…
A recent generalization of the Erd\H{o}s Unit Distance Problem, proposed by Palsson, Senger and Sheffer, asks for the maximum number of unit distance paths with a given number of vertices in the plane and in $3$-space. Studying a variant of…
We study shortest paths and their distances on a subset of a Euclidean space, and their approximation by their equivalents in a neighborhood graph defined on a sample from that subset. In particular, we recover and extend the results of…
The minimum convex cover problem seeks to cover a polygon $P$ with the fewest convex polygons that lie within $P$. This problem is $\exists\mathbb R$-complete, and the best previously known algorithm, due to Eidenbenz and Widmayer (2001),…
We study the Prym map for degree-7 etale cyclic coverings over a curve of genus 2. We extend this map to a proper map on a partial compactification of the moduli space of such coverings, and prove that the Prym map is generically finite…
In this paper, we present a mathematical model for the angular projection of a rectangular arrangement of points in a grid. This simple, yet interesting problem, has both a scholarly value and applications for data extraction techniques to…
Let $\P$ be any collection of paths of a graph $G=(V,E)$. For $S\subseteq V$, define $I(S)=S\cup\{v\mid v \ \mbox{lies in a path of} \ \P \ \mbox{with endpoints in} \ S\}$. Let $\C$ be the collection of fixed points of the function $I$,…
We consider a generalization of the classical Art Gallery Problem, where instead of a light source, the guards, called $k$-transmitters, model a wireless device with a signal that can pass through at most $k$ walls. We show it is NP-hard to…
Answering a question of Benjamini & Schramm [8], we show that the Poisson boundary of any planar, uniquely absorbing (e.g. one-ended and transient) graph with bounded degrees can be realised geometrically as a circle, namely as the boundary…
We introduce a $2$-approximation algorithm for the minimum total covering number problem.
We consider the problem of finding a Hamiltonian path or cycle with precedence constraints in the form of a partial order on the vertex set. We study the complexity for graph width parameters for which the ordinary problems…
The cover time of a finite connected graph is the expected number of steps needed for a simple random walk on the graph to visit all the vertices. It is known that the cover time on any n-vertex, connected graph is at least (1+o(1)) n…
We introduce and motivate a conjecture about the existence of complete, 1-dimensional families of covers of an elliptic curve. If the conjecture holds, then it would imply a uniform lower bound of 5 for slope of the moduli space of curves.…