Related papers: Lines Missing Every Random Point
Exponential of exponential of almost every line in the complex plane is dense in the plane. On the other hand, for lines through any point, for a set of angles of Hausdorff dimension one, exponential of exponential of a line with angle from…
It is known that if a subset of $\mathbb{R}$ has positive Lebesgue measure, then it contains arbitrarily long finite arithmetic progressions. We prove that this result does not extend to infinite arithmetic progressions in the following…
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…
The family of topologies that induce the Euclidean metric space on every time axis and every space axis exhibits no maximal element when partially ordered by the relation ``finer than'', as demonstrated in this article. One conclusion and…
The Erd\H{o}s-Anning theorem states that every point set in the Euclidean plane with integer distances must be either collinear or finite. More strongly, for any (non-degenerate) triangle of diameter~$\delta$, at most $O(\delta^2)$ points…
We analyse the axioms of Euclidean geometry according to standard object-oriented software development methodology. We find a perfect match: the main undefined concepts of the axioms translate to object classes. The result is a suite of C++…
We study translation-invariant determinantal random point fields on the real line. We prove, under quite general conditions, that the smallest nearest spacings between the particles in a large interval have Poisson statistics as the length…
We derive exact expressions for the probabilities that partly random hyperplanes separate two Euclidean balls. The probability that a fully random hyperplane separates two balls turns out to be significantly smaller than the corresponding…
We show that for entire maps of the form $z \mapsto \lambda \exp(z)$ such that the orbit of zero is bounded and such that Lebesgue almost every point is transitive, no absolutely continuous invariant probability measure can exist. This…
We study Hamiltonian diffeomorphisms on symplectic Euclidean spaces that are equal to non-degenerate linear maps at infinity. Under the assumption that there exists an isolated homologically nontrivial fixed point satisfying the twist…
In this paper we determine all the bijective linear maps on the space of bounded observables which preserve a fixed moment or the variance. Nonlinear versions of the corresponding results are also presented.
The greedy walk is a walk on a point process that always moves from its current position to the nearest not yet visited point. We consider here various point processes on two lines. We look first at the greedy walk on two independent…
There is only one fully supported ergodic invariant probability measure for the adic transformation on the space of infinite paths in the graph that underlies the Eulerian numbers. This result may partially justify a frequent assumption…
The matching problem is a notorious combinatorial optimization problem that has attracted for many years the attention of the statistical physics community. Here we analyze the Euclidean version of the problem, i.e. the optimal matching…
Following Meyer's argument (quant-ph/9905080) the set of all directions in space is replaced by the dense subset of rational directions. The result conflicts with Euclidean geometry.
Our main result states that whenever we have a non-Euclidean norm $\|\cdot\|$ on a two-dimensional vector space $X$, there exists some $x\neq 0$ such that for every $\lambda\neq 1, \lambda>0$, there exist $y, z\in X$ verifying that…
We consider a model for random walks on random environments (RWRE) with random subset of the d-dimensional Euclidean lattice as the vertices, and uniform transition probabilities on 2d points (two "coordinate nearest points" in each of the…
We consider transient nearest neighbor random walks on the positive part of the real line. We give criteria for the finiteness of the number of cutpoints and strong cutpoints. Examples and open problems are presented.
This paper addresses to the problem of finding the (minimum) Euclidean distance between two linear varieties. This problem is, usually, solved minimising a target function. We propose a novel approach: to use the Moore-Penrose generalised…
We show that every tiling of a convex set in the Euclidean plane $\mathbb{R}^2$ by equilateral triangles of mutually different sizes contains arbitrarily small tiles. The proof is purely elementary up to the discussion of one family of…