Related papers: The lonely runner with seven runners

In this paper, we conjecture a monotonicity property that we call monotonicity under coarse-graining for a class of multi-partite entanglement measures. We check these properties by computing the measures for various types of states using…

The study of the movement of flocks, whether biological or technological is motivated by the desire to understand the capability of coherent motion of a large number of agents that only receive very limited information. In a biological…

We introduce a new dynamical system model called the shadowing problem, where a shadower chases after an escaper by always staring at and keeping the distance from him. When the escaper runs along a planar closed curve, we associate to the…

A certain class of directed metric graphs is considered. Asymptotics for a number of possible endpoints of a random walk at large times is found.

We consider a system of three random walkers (a `cheetah' surrounded by two `antelopes') diffusing in one dimension. The cheetah and the antelopes diffuse, but the antelopes experience in addition a deterministic relative drift velocity,…

We study coupled transport in the nonequilibrium stationary state of a model consisting of independent random walkers, moving along a one-dimensional channel, which carry a conserved energy-like quantity, with density and temperature…

If we two-colour a circle, we can always find an inscribed triangle with angles $(\frac{\pi}{7},\frac{2\pi}{7},\frac{4\pi}{7})$ whose three vertices have the same colour. In fact, Bialostocki and Nielsen showed that it is enough to consider…

We study the random walk in random environment on {0,1,2,...}, where the environment is subject to a vanishing (random) perturbation. The two particular cases we consider are: (i) random walk in random environment perturbed from Sinai's…

In order to determine the optimal strategy to run a race on a curved track according to the lane number, we introduce a model based on differential equations for the velocity, the propulsive force and the anaerobic energy which takes into…

For an integer $k\geq 1$, a graph is called a $k$-circulant if its automorphism group contains a cyclic semiregular subgroup with $k$ orbits on the vertices. We show that, if $k$ is even, there exist infinitely many cubic arc-transitive…

Using the discrepancy metric, we analyze the rate of convergence of a random walk on the circle generated by d rotations, and establish sharp rates that show that badly approximable d-tuples in R^d give rise to walks with the fastest…

Graph burning is a discrete time process which can be used to model the spread of social contagion. One is initially given a graph of unburned vertices. At each round (time step), one vertex is burned; unburned vertices with at least one…

A simple graph more often than not contains adjacent vertices with equal degrees. This in particular holds for all pairs of neighbours in regular graphs, while a lot such pairs can be expected e.g. in many random models. Is there a…

In a pursuit evasion game on a finite, simple, undirected, and connected graph $G$, a first player visits vertices $m_1,m_2,\ldots$ of $G$, where $m_{i+1}$ is in the closed neighborhood of $m_i$ for every $i$, and a second player probes…

Seymour's distance two conjecture states that in any digraph there exists a vertex (a "Seymour vertex") that has at least as many neighbors at distance two as it does at distance one. We explore the validity of probabilistic statements…

Tracking of moving objects is crucial to security systems and networks. Given a graph $G$, terminal vertices $s$ and $t$, and an integer $k$, the \textsc{Tracking Paths} problem asks whether there exists at most $k$ vertices, which if…

The rank of a graph is defined to be the rank of its adjacency matrix. A graph is called reduced if it has no isolated vertices and no two vertices with the same set of neighbors. Akbari, Cameron, and Khosrovshahi conjectured that the…

The work takes another look at the number of runs that a string might contain and provides an alternative proof for the bound. We also propose another stronger conjecture that states that, for a fixed order on the alphabet, within every…

Fix integers $d \geq 2$ and $k\geq d-1$. Consider a random walk $X_0, X_1, \ldots$ in $\mathbb{R}^d$ in which, given $X_0, X_1, \ldots, X_n$ ($n \geq k$), the next step $X_{n+1}$ is uniformly distributed on the unit ball centred at $X_n$,…

Consider a transient near-critical (1,2) random walk on the positive half line. We give a criteria for the finiteness of the number of the skipped points (the points never visited) by the random walk. This result generalizes (partially) the…