Related papers: Two estimates concerning classical Diophantine app…
In a series of recent papers, W. M. Schmidt and L. Summerer developed a new theory by which they recover all major generic inequalities relating exponents of Diophantine approximation to a point in $\mathbb{R}^n$, and find new ones. Given a…
Let $u_n$ be a fixed non-degenerate binary recurrence sequence with positive discriminant, $w$ a fixed non-zero integer and $p_1,p_2,\dots,p_s$ fixed, distinct prime numbers. In this paper we consider the Diophantine equation $u_n+u_m=w…
In this paper, we study inhomogeneous Diophantine approximation with rational numbers of reduced form. The central object to study is the set $W(f,\theta)$ as follows, \begin{eqnarray*} \left\{x\in [0,1]:\left…
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…
In this paper, we study properties of the Diophantine exponents $w_n$ and $w_n^{*}$ for Laurent series over a finite field. We prove that for an integer $n\geq 1$ and a rational number $w>2n-1$, there exist a strictly increasing sequence of…
We present a unified approach which gives completely elementary proofs of three weighted sum formulae for double zeta values. This approach also leads to new evaluations of sums relating to the harmonic numbers, the alternating double zeta…
In this paper, we consider the Diophantine equation $\lambda_1U_{n_1}+\ldots+\lambda_kU_{n_k}=wp_1^{z_1} \cdots p_s^{z_s},$ where $\{U_n\}_{n\geq 0}$ is a fixed non-degenerate linear recurrence sequence of order greater than or equal to 2;…
A basic question of Diophantine approximation, which is the first issue we discuss, is to investigate the rational approximations to a single real number. Next, we consider the algebraic or polynomial approximations to a single complex…
We prove that there is no fpt-algorithm that can approximate the dominating set problem with any constant ratio, unless FPT= W[1]. Our hardness reduction is built on the second author's recent W[1]-hardness proof of the biclique problem.…
This paper addresses a problem recently raised by Laurent and Nogueira about inhomogeneous Diophantine approximation with coprime integers. As a corollary of our main theorem we obtain an improvement of the best known exponent of…
New formulas for approximation of zeta-constants were derived on the basis of a number-theoretic approach constructed for the irrationality proof of certain classical constants. Using these formulas it's possible to approximate certain…
We give several results related to inhomogeneous approximations to two real numbers and badly approximable numbers. Our results are related to classical theorems by A. Khintchine (1926) and to an original method invented by Y. Peres and W.…
Let $[\,\cdot\,]$ be the floor function. In this paper we show that whenever $\eta$ is real, the constants $\lambda_i$ satisfy some necessary conditions, then for any fixed $1<c<38/37$ there exist infinitely many prime triples $p_1,\,…
We introduce a deficiency-based representation and approximation framework for values of the Riemann zeta function. The method is based on comparing two nonlinear accumulation mechanisms: global transformation of a base partial sum and…
This paper uses W. M. Schmidt's idea formulated in 1967 to generalise the classical theory of Diophantine approximation to subspaces of $\mathbb{R}^n$. Given two subspaces of $\mathbb{R}^n$ $A$ and $B$ of respective dimensions $d$ and $e$…
We prove a strong simultaneous Diophantine approximation theorem for values of additive and multiplicative functions provided that the functions have certain regularity on the primes.
We study the sharp constant $W_{n}(D)$ in Wiener's inequality for positive definite functions \[ \int_{\mathbb{T}^{n}}|f|^{2}\,dx\le W_{n}(D)|D|^{-1}\int_{D}|f|^{2}\,dx,\quad D\subset \mathbb{T}^{n}. \] N. Wiener proved that…
For any $T \geq 1$, there are constants $R=R(T) \geq 1$ and $\zeta=\zeta(T)>0$ and a randomized algorithm that takes as input an integer $n$ and two strings $x,y$ of length at most $n$, and runs in time $O(n^{1+\frac{1}{T}})$ and outputs an…
We study multipoint Pad\'e approximants of type $(n,n)$ for the Hurwitz zeta function $f(a)=\zeta(s,a)$ with $\Re s>1$, constructed at quantile nodes $a_{n,j}=n\alpha_{n,j}$ generated by a real-analytic density $\kappa$ on…
For any $\beta>1$, let $T_\beta$ be the classical $\beta$-transformations. Fix $x_0\in[0,1]$ and a nonnegative real number $\hat{v}$, we compute the Hausdorff dimension of the set of real numbers $x\in[0,1]$ with the property that, for…