Related papers: The Lonely Runner Conjecture
The results of difference sequences theory are applied to analytic function theory and Diophantine equations. As a result we have the equation which connects the $n$-th derivative of a function with the difference sequence for the values of…
The minimum constraint removal problem seeks to find the minimum number of constraints, i.e., obstacles, that need to be removed to connect a start to a goal location with a collision-free path. This problem is NP-hard and has been studied…
The idea of using measure theoretic concepts to investigate the size of number theoretic sets, originating with E. Borel, has been used for nearly a century. It has led to the development of the theory of metrical Diophantine approximation,…
We discuss how inhomogeneities of the universe affect observations of the gravitational lensing; (1) the bending angle, (2) the lensing statistics and (3) the time delay. In order to take account of the inhomogeneities, the Dyer-Roeder…
Walks in a directed graph can be given a partially ordered structure that extends to possibly unconnected objects, called hikes. Studying the incidence algebra on this poset reveals unsuspected relations between walks and self-avoiding…
In 1982, Lagarias showed that solving the approximate Shortest Vector Problem also solves the problem of finding good simultaneous Diophantine approximations. Here we provide a deterministic, dimension-preserving reduction in the reverse…
We prove a version of the Khinchine--Groshev theorem for Diophantine approximation of matrices subject to a congruence condition. The proof relies on an extension of the Dani correspondence to the quotient by a congruence subgroup. This…
In this report, the explicit probability density functions of the random Euclidean distances associated with equilateral triangles are given, when the two endpoints of a link are randomly distributed in 1) the same triangle, 2) two adjacent…
The article studies the reiterated homogenization of linear elliptic variational inequalities arising in problems with unilateral constrains. We assume that the coefficients of the equations satisfy and abstract hypothesis covering on each…
In this chapter we introduce the theory of Diophantine approximation via a series of basic examples from information theory relevant to wireless communications. In particular, we discuss Dirichlet's theorem, badly approximable points,…
In these notes, we begin by recalling aspects of the classical theory of metric Diophantine approximation; such as theorems of Khintchine, Jarn\'{\i}k, Duffin-Schaeffer and Gallagher. We then describe recent strengthening of various…
We establish maximal trees and graphs for the difference of average distance and proximity proving thus the corresponding conjecture posed in [4]. We also establish maximal trees for the difference of average eccentricity and remoteness and…
We generalize Dirichlet's diophantine approximation theorem to approximating any real number $\alpha$ by a sum of two rational numbers $\frac{a_1}{q_1} + \frac{a_2}{q_2}$ with denominators $1 \leq q_1, q_2 \leq N$. This turns out to be…
Considering simultaneous approximation to three numbers, we study the geometry of the sequence of best approximations. We provide a sharper lower bound for the ratio between ordinary and uniform exponent of Diophantine approximation,…
We study singularity confinement phenomena in examples of delay-differential Painlev\'e equations, which involve shifts and derivatives with respect to a single independent variable. We propose a geometric interpretation of our results in…
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.
The study of Diophantine triples taking values in linear recurrence sequences is a variant of a problem going back to Diophantus of Alexandria which has been studied quite a lot in the past. The main questions are, as usual, about existence…
A natural way to improve the detection of objects is to consider the contextual constraints imposed by the detection of additional objects in a given scene. In this work, we exploit the spatial relations between objects in order to improve…
A self-avoiding walk with small attractive interactions is described here. The existence of the connective constant is established, and the diffusive behavior is proved using the method of the lace expansion.
The permanent versus determinant conjecture is a major problem in complexity theory that is equivalent to the separation of the complexity classes VP_{ws} and VNP. Mulmuley and Sohoni (SIAM J. Comput., 2001) suggested to study a…