Related papers: A Solution to the Lonely Runner Conjecture for Alm…
Let f(1)=1, and let f(n+1)=2^{2^{f(n)}} for every positive integer n. We conjecture that if a system S \subseteq {x_i \cdot x_j=x_k: i,j,k \in {1,...,n}} \cup {x_i+1=x_k: i,k \in {1,...,n}} has only finitely many solutions in non-negative…
Determination of stability and instability of singular points in nonlinear dynamical systems is an important issue that has attracted considerable attention in different fields of engineering and science. So far, different well-defined…
The Polyhedral Escape Problem for continuous linear dynamical systems consists of deciding, given an affine function $f: \mathbb{R}^{d} \rightarrow \mathbb{R}^{d}$ and a convex polyhedron $\mathcal{P} \subseteq \mathbb{R}^{d}$, whether, for…
The main goal of this note is to develop a metrical theory of Diophantine approximation within the framework of the de Mathan-Teulie Conjecture, also known as the `Mixed Littlewood Conjecture'. Let p be a prime. A consequence of our main…
This article studies the Cauchy problem for the Boltzmann equation with stochastic kinetic transport. Under a cut-off assumption on the collision kernel and a coloring hypothesis for the noise coefficients, we prove the global existence of…
The main theme of the article is the study of discrete systems of material points subjected to constraints not only of a geometric type (holonomic constraints) but also of a kinematic type (nonholonomic constraints). The setting up of the…
Non-linear Trajectory Optimisation (TO) methods require good initial guesses to converge to a locally optimal solution. A feasible guess can often be obtained by allocating a large amount of time for the trajectory to complete. However for…
The inhomogeneous Khintchine-Groshev Theorem is a classical generalization of Khintchine's Theorem in Diophantine approximation, by approximating points in $\mathbb{R}^m$ by systems of linear forms in $n$ variables. Analogous to the…
A possible way to resolve the singularities of general relativity is proposed based on the assumption that the description of space-time using commuting coordinates is not valid above a certain fundamental scale. Beyond that scale it is…
Textbook treatments of classical mechanics typically assume that the Lagrangian is nonsingular. That is, the matrix of second derivatives of the Lagrangian with respect to the velocities is invertible. This assumption insures that (i)…
We study the optimal transport between two probability measures on the real line, where the transport plans are laws of one-step martingales. A quasi-sure formulation of the dual problem is introduced and shown to yield a complete duality…
A new method is introduced for solving Laplace problems on 2D regions with corners by approximation of boundary data by the real part of a rational function with fixed poles exponentially clustered near each corner. Greatly extending a…
We consider the problem of approaching real numbers with rational numbers with prime denominator and with a single numerator allowed for each denominator. We obtain basic results, both probabilistic and deterministic, draw connections to…
In this article, we present several apparent paradoxes of special relativity and their respective solutions. These paradoxes have appeared since the advent of relativity in 1905, and in fact they are never paradoxes. From a didactic point…
In 1926 Khintchine introduced a topological argument proving the existence of uncountably many nontrivial singular linear forms of $n \geq 2$ variables. Throughout the years, this argument has been extensively modified and generalized. Most…
Many problems in geometric optics or convex geometry can be recast as optimal transport problems: this includes the far-field reflector problem, Alexandrov's curvature prescription problem, etc. A popular way to solve these problems…
Consider a walk in the plane made of $n$ unit steps, with directions chosen independently and uniformly at random at each step. Rayleigh's theorem asserts that the probability for such a walk to end at a distance less than 1 from its…
Given a finite sequence of events and a well-defined notion of events being interesting, the Odds-theorem (Bruss (2000)) gives an online strategy to stop on the last interesting event. It is optimal for independent events. Here we study…
We consider the Travelling Salesman Problem with Vertex Requisitions, where for each position of the tour at most two possible vertices are given. It is known that the problem is strongly NP-hard. The proposed algorithm for this problem has…
A common problem in physics and engineering is determination of the orientation of an object given its angular velocity. When the direction of the angular velocity changes in time, this is a nontrivial problem involving coupled differential…