Related papers: Sharp bounds for symmetric and asymmetric Diophant…
We study properties of Diophantine exponents of lattices and so-called related "weak" uniform approximations introduced in recent papers by Oleg German, in the simplest two-dimensional case. In contrast to the multidimensional case, in the…
In this paper, we obtain sharp Strichartz estimates for solutions of the wave equation $\square_\gg\phi=0$ where $\gg$ is a rough Lorentzian metric on a 4 dimensional space-time $\MM$. This is the last step of the proof of the bounded $L^2$…
The paper is mostly a survey on recent results in Diophantine approximation, with emphasis on properties of exponents measuring various notions of Diophantine <approximation.
In this paper we prove an inequality for individual and uniform Diophantine exponents in the case of simultaneous approximation. This inequality is better than Jarnik's for small values of the uniform exponent.
We analyse the convergence of the proximal gradient algorithm for convex composite problems in the presence of gradient and proximal computational inaccuracies. We derive new tighter deterministic and probabilistic bounds that we use to…
We study the problem of Diophantine approximation on lines in $\mathbb{R}^d$ under certain primality restrictions.
In this paper, we introduce telescoping continued fractions to find lower bounds for the error term $r_n$ in Stirling's approximation $\displaystyle n! = \sqrt{2\pi}n^{n+1/2}e^{-n}e^{r_n}.$ This improves lower bounds given earlier by…
In this paper, we study Diophantine exponents $w_n$ and $w_n ^{*}$ for Laurent series over a finite field. Especially, we deal with the case $n=2$, that is, quadratic approximation. We first show that the range of the function $w_2-w_2…
Fix an integer $n\ge 2$. To each non-zero point $\mathbf{u}$ in $\mathbb{R}^n$, one attaches several numbers called exponents of Diophantine approximation. However, as Khintchine first observed, these numbers are not independent of each…
An inequality, recently proposed by Franson [Phys. Rev. A 54, 3808 (1996)] is analyzed and improved. The inequality connects the change of the expectation value of an observable with the uncertainty of this observable. A strict bound on the…
Consider the vanishing locus of a real analytic function on $\mathbb{R}^n$ restricted to $[0,1]^n$. We bound the number of rational points of bounded height that approximate this set very well. Our result is formulated and proved in the…
In this paper we present a new approach to prove effective results in Diophantine approximation. We then use it to prove an effective theorem on the simultaneous approximation of two algebraic numbers satisfying an algebraic equation with…
We provide several asymptotic expansions of the prime counting function $\pi(x)$ and related functions. We define an {\it asymptotic continued fraction expansion} of a complex-valued function of a real or complex variable to be a possibly…
Convergence rate estimates in limit theorems for sums of independent random variables are considered.
We obtain sharp lower and upper bounds for the number of maximal (under inclusion) independent sets in trees with fixed number of vertices and diameter. All extremal trees are described up to isomorphism.
The Hausdorff dimension of the set of simultaneously tau well approximable points lying on a curve defined by a polynomial P(X)+alpha, where P(X) is a polynomial with integer coefficients and alpha is in R, is studied when tau is larger…
Linear differential equations and recurrences reveal many properties about their solutions. Therefore, these equations are well-suited for representing solutions and computing with special functions. We identify a large class of existing…
For an ergodic Brownian diffusion with invariant measure $\nu$, we consider a sequence of empirical distributions ($\nu$n) n$\ge$1 associated with an approximation scheme with decreasing time step ($\gamma$n) n$\ge$1 along an adapted…
This paper presents a saddlepoint approximation of the random-coding union bound of Polyanskiy et al. for i.i.d. random coding over discrete memoryless channels. The approximation is single-letter, and can thus be computed efficiently.…
We study the $P_1$ finite element approximation of the best constant in the classical Hardy inequality over bounded domains containing the origin in $\mathbb{R}^N$, for $N \geq 3$. Despite the fact that this constant is not attained in the…