Related papers: The lonely runner conjecture holds for nine runner…

Consider continuous-time random walks on Cayley graphs where the rate assigned to each edge depends only on the corresponding generator. We show that the limiting speed is monotone increasing in the rates for infinite Cayley graphs that…

In this short paper we will show, via elementary arguments, the equivalence of the Twin Prime Conjecture to a problem which might be simpler to prove. Some conclusions are drawn, and it is shown that proving the Twin Prime Conjecture is…

We prove an invariance principle for continuous-time random walks in a dynamically averaging environment on $\mathbb Z$. In the beginning, the conductances may fluctuate substantially, but we assume that as time proceeds, the fluctuations…

In [3] the radius of convergence of the generating function of the collision local time of two independent copies of an irreducible, symmetric and transient random walk on Zd, d \geq 1, was studied. Two versions were considered: z1, the…

Our objective is to provide an upper bound for the length $\ell_N$ of the longest run of consecutive integers smaller than $N$ which have the same number of divisors. We prove in an elementary way that $\log\ell_N\ll(\log N\log\log…

We prove that an integrated simple random walk, where random walk and integrated random walk are conditioned to return to zero, has asymptotic probability $n^{-1/2}$ to stay positive. This question is motivated by so-called random polymer…

A proof of Sendov's conjecture is given.

We give a short proof of the recurrence of the two-dimensional elephant random walk in the diffusive regime. This was recently established by Shuo Qin, but our proof only uses very rough comparison with the standard plane random walk. We…

This paper studies the proof of Collatz conjecture for some set of sequence of odd numbers with infinite number of elements. These set generalized to the set which contains all positive odd integers. This extension assumed to be the proof…

We give a simple proof of the Lalonde-McDuff conjecture for aspherical manifolds.

Loneliness does not only have emotional implications on a person but also on his/her well-being. The study of loneliness has been challenging and largely inconclusive in findings because of the several factors that might correlate to the…

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…

In this note, we give an alternate proof of the multinomial theorem using a probabilistic approach. Although the multinomial theorem is basically a combinatorial result, our proof may be simpler for a student familiar with only basic…

Toby Walsh in 'The Singularity May Never Be Near' gives six arguments to support his point of view that technological singularity may happen but that it is unlikely. In this paper, we provide analysis of each one of his arguments and arrive…

Let $R$ be a finite ring. The commuting probability of $R$ is the probability that any two randomly chosen elements of $R$ commute. In this paper, we obtain some bounds for commuting probability of $R$.

Here we prove some conjectures on the monotony of combinatorial sequences from the recent preprint of Zhi--Wei Sun.

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 first version of this paper gave another proof of the Kropholler Conjecture, which gives a relative version of Stallings Ends Theorem, following an earlier incorrect proof. It has been pointed out by Sam Shepherd that the the second…

Experiments over three decades have been unable to demonstrate weak nonlocality in the sense of Bell unambiguously, without loopholes. The last important loophole remaining is the detection loophole, which is being tackled by at least three…

The primary purpose of this article is to prove a tightness of skew random walks. The tightness result implies, in particular, that the skew Brownian motion can be constructed as the scaling limit of such random walks. Our proof of…