Related papers: The lonely runner with seven runners
We suggest a new type of problem about distances in graphs and make several conjectures. As a first step towards proving them, we show that for sufficiently large values of n and k, a graph on n vertices that has no three vertices at…
A fixed number of passengers independently board one of several buses uniformly at random. The lonely passenger problem is to prove that the probability of at least one passenger being the only one in their bus is increasing in the number…
The statistics of persistent events, recently introduced in the context of phase ordering dynamics, is investigated in the case of the 1D lattice random walk in discrete time. We determine the survival probability of the random walker in…
A rational distance set is a subset of the plane such that the distance between any two points is a rational number. We show, assuming Lang's Conjecture, that the cardinalities of rational distance sets in general position are uniformly…
This article rigorously analyzes the meeting time between pursuers and evaders performing random walks on digraphs. There exist several bounds on the expected meeting time between random walkers on graphs in the literature, however,…
Predicting the future performance of young runners is an important research issue in experimental sports science and performance analysis. We analyse a data set with annual seasonal best performances of male middle distance runners for a…
The goal of this paper is twofold; first, show the equivalence between certain problems in geometry, such as view-obstruction and billiard ball motions, with the estimation of covering radii of lattice zonotopes. Second, we will estimate…
In this article the pursuit problem of objects that moves with different accelerations and initial speeds is studied. Initially, the situation in which the escaping object moves in a straight line is considered. Under this condition, and if…
Fix a set $D$ of positive integers. We study the maximum density $\mu(D)$ of sequences of integers in which the separation between any two terms does not fall in $D$. The $D$-sets considered in this article are of the form $\{1,j,k\}$. The…
This paper looks into the problem of pedestrian tracking using a monocular, potentially moving, uncalibrated camera. The pedestrians are located in each frame using a standard human detector, which are then tracked in subsequent frames.…
We present here a system with collection of random walks relaying a signal in one dimension in the presence of delays. We are interested in the time for a signal to travel from one end (start) to the other end (finish) of the lined group of…
A measure theoretic approach of the problem that there exits a finite unit-distance graphs in the plane that are not five (or four) colorable.
A 2018 conjecture of Brewster, McGuinness, Moore, and Noel asserts that for $k \ge 3$, if a graph has chromatic number greater than $k$, then it contains at least as many cycles of length $0 \bmod k$ as the complete graph on $k+1$ vertices.…
Very sparse random graphs are known to typically be singular (i.e., have singular adjacency matrix), due to the presence of "low-degree dependencies'' such as isolated vertices and pairs of degree-1 vertices with the same neighbourhood. We…
In [1], the authors consider a random walk $(Z_{n,1},\ldots,Z_{n,K+1})\in \mathbb{Z}^{K+1}$ with the constraint that each coordinate of the walk is at distance one from the following one. A functional central limit theorem for the first…
We study a generalization of strongly regular graphs. We call a graph strongly walk-regular if there is an $\ell >1$ such that the number of walks of length $\ell$ from a vertex to another vertex depends only on whether the two vertices are…
A conjecture attributed to Smith states that every pair of longest cycles in a $k$-connected graph intersect each other in at least $k$ vertices. In this paper, we show that every pair of longest cycles in a~$k$-connected graph on $n$…
Let $P$ be a set of $n$ points in the plane, each point moving along a given trajectory. A {\em $k$-collinearity} is a pair $(L,t)$ of a line $L$ and a time $t$ such that $L$ contains at least $k$ points at time $t$, the points along $L$ do…
The cycles are the only $2$-connected graphs in which any two nonadjacent vertices form a vertex cut. We generalize this fact by proving that for every integer $k\ge 3$ there exists a unique graph $G$ satisfying the following conditions:…
A centipede made of $N$ quantum walkers on a one-dimensional lattice is considered. The distance between two consecutive legs is either one or two lattice spacings, and a global constraint is imposed: the maximal distance between the first…