Related papers: The lonely runner conjecture holds for eight runne…
In this short note we provide a quantitative version of the classical Runge approximation property for second order elliptic operators. This relies on quantitative unique continuation results and duality arguments. We show that these…
Consider $n$ runners running on a circular track of unit length with constant speeds such that $k$ of the speeds are distinct. We show that, at some time, there will exist a sector $S$ which contains at least $|S|n+ \Omega(\sqrt{k})$…
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…
We consider the model of the one-dimensional cookie random walk when the initial cookie distribution is spatially uniform and the number of cookies per site is finite. We give a criterion to decide whether the limiting speed of the walk is…
Zagier provided eleven conjectural rank two examples for Nahm's problem. All of them have been proved in the literature except for the fifth example, and there is no $q$-series proof for the tenth example. We prove that the fifth and the…
We prove an analogue of the classical ballot theorem that holds for any random walk in the range of attraction of the normal distribution. Our result is best possible: we exhibit examples demonstrating that if any of our hypotheses are…
We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are `unique' constraints (i.e., permutations), the value of the game can be well…
The Langberg-M\'{e}dard multiple unicast conjecture claims that for a strongly reachable $k$-pair network, there exists a multi-flow with rate $(1,1,\dots,1)$. In this paper, we show that the conjecture holds true for {\em stable} $3$-pair…
New cases of the multiplicity conjecture are considered.
We consider reversible random walks in random environment obtained from symmetric long--range jump rates on a random point process. We prove almost sure transience and recurrence results under suitable assumptions on the point process and…
Combinatorial/probabilistic models for cross-country dual-meets are proposed. The first model assumes that all runners are equally likely to finish in any possible order. The second model assumes that each team is selected from a large…
A short proof of the equivalence of the recurrence of non-backtracking random walk and that of simple random walk on regular infinite graphs is given. It is then shown how this proof can be extended in certain cases where the graph in…
We consider a vertex reinforced random walk on the integer lattice with sub-linear reinforcement. Under some assumptions on the regular variation of the weight function, we characterize whether the walk gets stuck on a finite interval. When…
In a recent historical overview, Cristian S. Calude, Elena Calude, and Solomon Marcus identify eight stages in the development of the concept of a mathematical proof in support of an ambitious conjecture: we can express classical…
Extending upon our previous work, we verify the Jones Unknot Conjecture for all knots up to $24$ crossings. We describe the method of our approach and analyze the growth of the computational complexity of its different components.
The first two authors have shown [KK99,KK00] that the sum the exponent (and thus the number) of maximal repetitions of exponent at least 2 (also called runs) is linear in the length of the word. The exponent 2 in the definition of a run may…
A number of papers have examined various aspects of "random random" walks on finite groups; the purpose of this article is to provide a survey of this work and to show, bring together, and discuss some of the arguments and results in this…
Human activity analysis based on sensor data plays a significant role in behavior sensing, human-machine interaction, health care, and so on. The current research focused on recognizing human activity and posture at the activity pattern…
We study an extension to the uniqueness conjecture for Markov numbers. For any three positive integers $m\geq a$ and $m\geq b$ satisfying $a^2+b^2+m^2=3abm$, this conjecture states that the triple $(a,m,b)$ is uniquely determined by the…
We show that all--instances termination of chase is undecidable. More precisely, there is no algorithm deciding, for a given set $\cal T$ consisting of Tuple Generating Dependencies (a.k.a. Datalog$^\exists$ program), whether the $\cal…