Related papers: On estimating the constant of simultaneous Diophan…
In this paper we develop the continuous averaging method of Treschev to work on the simultaneous Diophantine approximation and apply the result to give a new proof of the Nekhoroshev theorem. We obtain a sharp normal form theorem and an…
This paper is motivated by Davenport's problem and the subsequent work regarding badly approximable points in submanifolds of a Euclidian space. We study the problem in the area of twisted Diophantine approximation and present two different…
By analogy with the program of McKinnon-Roth, we define and study approximation constants for points of a projective variety X defined over K the function field of an irreducible and non-singular in codimension 1 projective variety defined…
We study the problem of Diophantine approximation on lines in R^2 with prime numerator and denominator.
In this paper, we revisit the old problem of compact finite difference approximations of the homogeneous Dirichlet problem in dimension 1. We design a large and natural set of schemes of arbitrary high order, and we equip this set with an…
We study the fundamental task of estimating the median of an underlying distribution from a finite number of samples, under pure differential privacy constraints. We focus on distributions satisfying the minimal assumption that they have a…
In this paper we develop a general theory of metric Diophantine approximation for systems of linear forms. A new notion of `weak non-planarity' of manifolds and more generally measures on the space of $m\times n$ matrices over $\Bbb R$ is…
We give some comments on W.M. Schmidt's theorem on Diophantine approximations with positive integers and our recent results on the topic.
We compute the sequence of best Diophantine approximations for some pairs of cubic Pisot numbers which do not satisfy the Property (F).
We consider the discrete three dimensional scan statistics. Viewed as the maximum of an 1-dependent stationary r.v.'s sequence, we provide approximations and error bounds for the probability distribution of the three dimensional scan…
A fundamental problem in numerical analysis and approximation theory is approximating smooth functions by polynomials. A much harder version under recent consideration is to enforce bounds constraints on the approximating polynomial. In…
For large $N$, we consider the ordinary continued fraction of $x=p/q$ with $1\le p\le q\le N$, or, equivalently, Euclid's gcd algorithm for two integers $1\le p\le q\le N$, putting the uniform distribution on the set of $p$ and $q$s. We…
In N.V. Krylov, Approximating value functions for controlled degenerate diffusion processes by using piece-wise constant policies, Electron. J. Probab., 4(2), 1999, it is proved under standard assumptions that the value functions of…
We aim to fill a gap in the proof of an inequality relating two exponents of uniform Diophantine approximation stated in a paper by Bugeaud. We succeed to verify the inequality in several instances, in particular for small dimension.…
The present paper is concerned with equidistribution results for certain flows on homogeneous spaces and related questions in Diophantine approximation. Firstly, we answer in the affirmative, a question raised by Kleinbock, Shi and Weiss…
Compressed Counting (CC) [22] was recently proposed for estimating the ath frequency moments of data streams, where 0 < a <= 2. CC can be used for estimating Shannon entropy, which can be approximated by certain functions of the ath…
In this paper, we explicitly find all solutions of the title Diophantine equation, using lower bounds for linear forms in logarithms and properties of continued fractions. Further, we use a version of the Baker-Davenport reduction method in…
We study approximability of subdense instances of various covering problems on graphs, defined as instances in which the minimum or average degree is Omega(n/psi(n)) for some function psi(n)=omega(1) of the instance size. We design new…
For all $s \geq 1$ and $N \geq 1$ there exist sequences $(z_1,\ldots,z_N)$ in $[0,1]^s$ such that the star-discrepancy of these points can be bounded by $$D_N^*(z_1,\ldots,z_N) \leq c \frac{\sqrt{s}}{\sqrt{N}}.$$ The best known value for…
We find upper and lower bounds on the number of rational points that are $\psi$-approximations of some $n$-dimensional $p$-adic integer. Lattice point counting techniques are used to find the upper bound result, and a Pigeon-hole principle…