Related papers: Best rational approximations of an irrational numb…
Continued fractions have a long history in number theory, especially in the area of Diophantine approximation. The aim of this expository paper is to survey the main results on the theory of $p$--adic continued fractions, i.e. continued…
This article gives an introduction to optimal transport, a mathematical theory that makes it possible to measure distances between functions (or distances between more general objects), to interpolate between objects or to enforce…
We first survey the current state of the art concerning the dynamical properties of multidimensional continued fraction algorithms defined dynamically as piecewise fractional maps and compare them with algorithms based on lattice reduction.…
We refine Khintchine Transference Principle which relates the measure of simultaneous rational approximation of an $n$ real numbers with the measure of linear independence of these $n$ numbers. Khintchine's inequalities are known to be…
We define a collection of topological Ramsey spaces consisting of equivalence relations on $\omega$ with the property that the minimal representatives of the equivalence classes alternate according to a fixed partition of $\omega$. To prove…
Over the past a few years, research and development has made significant progresses on big data analytics. A fundamental issue for big data analytics is the efficiency. If the optimal solution is unable to attain or not required or has a…
The classical continued fraction is generalized for studying the rational approximation problem on multi-formal Laurent series in this paper, the construction is called m-continued fraction. It is proved that the approximants of an…
Sequence models are a critical component of modern NLP systems, but their predictions are difficult to explain. We consider model explanations though rationales, subsets of context that can explain individual model predictions. We find…
Discrete maximum principles in the approximation of partial differential equations are crucial for the preservation of qualitative properties of physical models. In this work we enforce the discrete maximum principle by performing a simple…
A paradigm for a global algebraic number theory of the reals is formulated with the purpose of providing a unified setting for algebraic and transcendental number theory. This is achieved through the study of subgroups of nonstandard models…
Laplace's method is used to approximate intractable integrals in a statistical problems. The relative error rate of the approximation is not worse than $O_p(n^{-1})$. We provide the first statistical lower bounds showing that the $n^{-1}$…
In this paper, we introduce the polynomial continued fraction, a close relative of the well-known simple continued fraction expansions which are widely used in number theory and in general. While they may not possess all the intriguing…
Gallagher's theorem is a sharpening and extension of the Littlewood conjecture that holds for almost all tuples of real numbers. We provide a fibre refinement, solving a problem posed by Beresnevich, Haynes and Velani in 2015. Hitherto,…
This paper discusses the semantics and proof theory of Nilsson's probabilistic logic, outlining both the benefits of its well-defined model theory and the drawbacks of its proof theory. Within Nilsson's semantic framework, we derive a set…
A recursive approach for shrinking coefficients of an atomic decomposition is proposed. The corresponding algorithm evolves so as to provide at each iteration a) the orthogonal projection of a signal onto a reduced subspace and b) the index…
In the setting where we have $n$ independent observations of a random variable $X$, we derive explicit error bounds in total variation distance when approximating the number of observations equal to the maximum of the sample (in the case…
Motivated by the need to better understand the properties of sparse cutting-planes used in mixed integer programming solvers, the paper [2] studied the idealized problem of how well a polytope is approximated by the use of sparse valid…
We give explicit and asymptotic lower bounds for the quantity $|e^{s/t}-M/N|$ by studying a generalized continued fraction expansion of $e^{s/t}$. In cases $|s|\geq 3$ we improve existing results by extracting a large common factor from the…
The computational complexity of reasoning within the Dempster-Shafer theory of evidence is one of the main points of criticism this formalism has to face. To overcome this difficulty various approximation algorithms have been suggested that…
In this paper, we present the concept of Approximate grammar and how it can be used to extract information from a documemt. As the structure of informational strings cannot be defined well in a document, we cannot use the conventional…