Related papers: On estimating the constant of simultaneous Diophan…
In this paper, new relations between the derivatives of the Legendre polynomials are obtained, and by these relations, new upper bounds for the Legendre coefficients of differentiable functions are presented. These upper bounds are sharp…
We investigate some Diophantine approximation constants related to the simultaneous approximation of $(\zeta,\zeta^{2},\ldots,\zeta^{k})$ for Liouville numbers $\zeta$. For a certain class of Liouville numbers including the famous…
In this technical note, we give two extensions of the classical Fano inequality in information theory. The first extends Fano's inequality to the setting of estimation, providing lower bounds on the probability that an estimator of a…
Dirichlet's uniform approximation theorem is a fundamental result in Diophantine approximation that gives an optimal rate of approximation with a given bound. We study uniform Diophantine approximation properties on the Hecke group $\mathbf…
Based on new explicit estimates for the prime counting function, we improve the currently known estimates for the particular sequence $C_n = np_n - \sum_{k \leq n}p_k$, $n \geq 1$, involving the prime numbers.
This paper is concerned with the study of diagonal Diophantine inequalities of fractional degree $ \theta ,$ where $ \theta >2$ is real and non-integral. For fixed non-zero real numbers $ \lambda_i $ not all of the same sign we write…
We obtain some new inequalities between the ordinary and the uniform Diophantine exponents for simultaneous Diophantine approximation to four real numbers.
It is well-known that an algorithm exists which approximates the NP-complete problem of Set Cover within a factor of ln(n), and it was recently proven that this approximation ratio is optimal unless P = NP. This optimality result is the…
In this paper, we extend the theory of simultaneous Diophantine approximation to infinite dimensions. Moreover, we discuss Dirichlet-type theorems in a very general framework and define what it means for such a theorem to be optimal. We…
We study problems on covering $[0,1)$ by shrinking intervals centered at the points $\{q_n x\}$, where $(q_n)_{n\in \mathbb{N}}$ is a given real-valued sequence and $x \in [0,1)$ is random. For real-valued lacunary sequences…
The goal of this PhD thesis is to study a diophantine approximation problem stated by Schmidt in 1967. The problem aim to study the approximation of a subspace of $\mathbb{R}^n$ by rational subspaces, not necessarily of the same dimension,…
We study the optimal rectangular-discrepancy approximation of permutons by finite permutations. We transfer bounds from discrepancy theory to this more restricted setup. Moreover, we show that superlinear approximation can occur only for…
We demonstrate a simple analytic argument that may be used to bound the Levy concentration function of a sum of independent random variables. The main application is a version of a recent inequality due to Rudelson and Vershynin, and its…
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…
The objective of this paper is to (partially) address the issue of finding an analogue to Khintchine's theorem for IFS Fractals. We study the convergence case for Diophantine approximations, and show an improved result for higher…
We give bounds on the number of solutions to the Diophantine equation (X+1/x)(Y+1/y) = n as n tends to infinity. These bounds are related to the number of solutions to congruences of the form ax+by = 1 modulo xy.
Many results related to quantitative problems in the metric theory of Diophantine approximation are asymptotic, such as the number of rational solutions to certain inequalities grows with the same rate almost everywhere modulo an asymptotic…
The Sinc approximation is a function approximation formula that attains exponential convergence for rapidly decaying functions defined on the whole real axis. Even for other functions, the Sinc approximation works accurately when combined…
If two probability density functions (PDFs) have values for their first $n$ moments which are quite close to each other (upper bounds of their differences are known), can it be expected that the PDFs themselves are very similar? Shown below…
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…