Related papers: Problems on Track Runners
We show that for an i.i.d. bounded and weakly elliptic cookie environment, one dimensional excited random walk on the $k$-time leftover environment is right transient if and only if $\delta > k+1$ and has positive speed if and only if…
We give new sublinear and parallel algorithms for the extensively studied problem of approximating n-variable r-CSPs (constraint satisfaction problems with constraints of arity r up to an additive error. The running time of our algorithms…
Given $n$ intervals on a line $\ell$, we consider the problem of moving these intervals on $\ell$ such that no two intervals overlap and the maximum moving distance of the intervals is minimized. The difficulty for solving the problem lies…
Coordinating the motion of multiple agents in constrained environments is a fundamental challenge in robotics, motion planning, and scheduling. A motivating example involves $n$ robotic arms, each represented as a line segment. The…
We ask if it is possible to find some particular continuous paths of unit length in linear Brownian motion. Beginning with a discrete version of the problem, we derive the asymptotics of the expected waiting time for several interesting…
A ``k-rule" is a sequence A=((A_n,B_n):n<omega) of pairwise disjoint sets B_n, each of cardinality at most k, where A_n is a subset of B_n. A set X of natural numbers (a ``real'') follows a rule A if for infinitely many n we have that the…
We consider the speed planning problem for a vehicle moving along an assigned trajectory, under maximum speed, tangential and lateral acceleration, and jerk constraints. The problem is a nonconvex one, where nonconvexity is due to jerk…
The clustering of integers with equal total stopping times has long been observed in the 3x + 1 Problem, and a number of elementary results about it have been used repeatedly in the literature. In this paper we introduce a simple…
We present a solution to the time discontinuity paradox in rotating reference frames by postulating that time is periodic. A kinematic restriction is enforced that requires the discontinuity to be an integral number of the periodicity of…
We study the behaviour of a sequence of biased random walks X(i), i>=0 on a sequence of random graphs, where the initial graph is Zd and otherwise the graph for the i-th walk is the trace of the (i - 1)-st walk. The sequence of bias vectors…
We study the obstacle problem for the Evolutionary p-Laplace Equation when the obstacle is discontinuous and without regularity in the time variable. Two quite different procedures yield the same solution.
Many quantum systems may have the same classical limit. We argue that in the classical limit their traces do not necessarily converge one to another. The trace formula allows to express quantum traces by means of classical quantities as…
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…
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…
It is postulated there is not a precise static instant in time underlying a dynamical physical process at which the relative position of a body in relative motion or a specific physical magnitude would theoretically be precisely determined.…
We study the Hamilton cycle problem with input a random graph G=G(n,p) in two settings. In the first one, G is given to us in the form of randomly ordered adjacency lists while in the second one we are given the adjacency matrix of G. In…
The mathematical model of J. Keller for predicting World Record race times, based on a simple differential equation of motion, predicted quite well the records of the day. One of its shortcoming is that it neglects to account for a…
The Traveling Tournament Problem is a sports-scheduling problem where the goal is to minimize the total travel distance of teams playing a double round-robin tournament. The constraint 'k' is an imposed upper bound on the number of…
Deviations between the form of trajectory assumed in a fit to a set of measurements and the actual form of the trajectory can give rise to sequential correlations in the residuals from the fit. These correlations can provide a more powerful…
We show that the minimum number of orientations of the edges of the n-vertex complete graph having the property that every triangle is made cyclic in at least one of them is $\lceil\log_2(n-1)\rceil$. More generally, we also determine the…