Related papers: Problems on Track Runners
Let $k$ be a positive integer. A $k$-cycle-factor of an oriented graph is a set of disjoint cycles of length $k$ that covers all vertices of the graph. In this paper, we prove that there exists a positive constant $c$ such that for $n$…
Enthusiast's perspective: We analyze the effectiveness of AQC for a small rank problem Hamiltonian $H_F$ with the arbitrary initial Hamiltonian $H_I$. We prove that for the generic $H_I$ the running time cannot be smaller than $O(\sqrt N)$,…
A recently posed question of Haggkvist and Scott's asked whether or not there exists a constant c such that if G is a graph of minimum degree ck then G contains cycles of k consecutive even lengths. In this paper we answer the question by…
We consider two dimensional random walks conditioned to stay in the positive quadrant. Assuming that the increments of the walk have finite second moments and that the drift vector is co-oriented with one of two axes, we construct positive…
The conceptual definition and understanding of time, both quantitatively and qualitatively is of the utmost difficulty and importance. As time is incorporated into the proper structure of the fabric of spacetime, it is interesting to note…
When $A$ and $B$ are subsets of the integers in $[1,X]$ and $[1,Y]$ respectively, with $|A| \geq \alpha X$ and $|B| \geq \beta X$, we show that the number of rational numbers expressible as $a/b$ with $(a,b)$ in $A \times B$ is $\gg (\alpha…
An analysis of marathon pacing and elevation change is presented. It is based on an empirical observation of how the pace of elite and non-elite marathon runners change over the course of the marathon and a simple approximation of the…
We prove that for every graph, any vertex subset $S$, and given integers $k,\ell$: there are $k$ disjoint cycles of length at least $\ell$ that each contain at least one vertex from $S$, or a vertex set of size $O(\ell \cdot k \log k)$ that…
A particle that moves along a smooth track in a vertical plane is influenced by two forces: gravity and normal force. The force experienced by roller coaster riders is the normal force, so a natural question to ask is: what shape of the…
We consider the problem of uniqueness of the kernel in the nonlocal theory of accelerated observers. In a recent work, we showed that the convolution kernel is ruled out as it can lead to divergences for nonuniform accelerated motion. Here…
In this paper we consider the problem of packing a fixed number of identical circles inside the unit circle container, where the packing is complicated by the presence of fixed size circular prohibited areas. Here the objective is to…
We discuss the properties of the residence time in presence of moving defects or obstacles for a particle performing a one dimensional random walk. More precisely, for a particle conditioned to exit through the right endpoint, we measure…
In this paper, we study the emergence of circular formation for agents in cyclic pursuit. Each agent is a unicycle traveling at a fixed common forward speed. We first establish a necessary and sufficient condition for the existence of…
We investigate the dynamics of maps of the real line whose behavior on an invariant interval is close to a rational rotation on the circle. We concentrate on a specific two-parameter family, describing the dynamics arising from models in…
For $k\geq 3$, a k-rollercoaster is a sequence of numbers whose every maximal contiguous subsequence, that is increasing or decreasing, has length at least $k$; $3$-rollercoasters are called simply rollercoasters. Given a sequence of…
We prove strong theorems for the local time at infinity of a nearest neighbor transient random walk. First, laws of the iterated logarithm are given for the large values of the local time. Then we investigate the length of intervals over…
In this paper we study the problem of tracking the mean of a piecewise stationary sequence of independent random variables. First we consider the case where the transition times are known and show that a direct running average performs the…
In this article, the continuous time random walk on the circle is studied. We derive the corresponding generalized master equation and discuss the effects of topology, especially important when Levy flights are allowed. Then, we work out…
We study a simple model of bicycle motion: a segment of fixed length in multi-dimensional Euclidean space, moving so that the velocity of the rear end is always aligned with the segment. If the front track is prescribed, the trajectory of…
The rotor walk is a derandomized version of the random walk on a graph. On successive visits to any given vertex, the walker is routed to each of the neighboring vertices in some fixed cyclic order, rather than to a random sequence of…