Related papers: Diophantine exponents for systems of linear forms …

The Diophantine sums $\sum_{n=1}^N \| n \alpha \|^{-1}$ and $\sum_{n=1}^N n^{-1} \| n \alpha \|^{-1}$ appear in many different areas including the ergodic theory of circle rotations, lattice point counting and random walks, often in…

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…

In this paper, we study the asymptotic behaviour of the number of solutions $(m, n)\in \mathbb{N}^2$ to the inequality $ | \alpha^n - \beta^m | \leq x $ when $x$ tends to infinity. Here $\alpha, \beta$ are given multiplicatively independent…

Let $d\geq 2$ and $k\geq 1$ be fixed. We prove that, for every $\epsilon>0$ and every real $\beta$, there exist integers $1\leq b_1,\ldots,b_k\leq N$ such that \[ \left\|\sum_{j=1}^k b_j^{1/d}-\beta\right\| \ll_{d,k,\epsilon}…

We study the growth rate of some power-free languages. For any integer $k$ and real $\beta>1$, we let $\alpha(k,\beta)$ be the growth rate of the number of $\beta$-free words of a given length over the alphabet $\{1,2,\ldots, k\}$. Shur…

In this paper, we find rational zeta series with $\zeta(2n)$ in terms of $\zeta(2k+1)$ and $\beta(2k)$, the Dirichlet beta function. We then develop a certain family of generalized rational zeta series using the generalized Clausen function…

We provide a lower bound for the ratio between the ordinary and uniform exponent of both simultaneous Diophantine approximation and Diophantine approximation by linear forms in any dimension. This lower bound was conjectured by Schmidt and…

We show how to determine the $k$-th bit of Chaitin's algorithmically random real number $\Omega$ by solving $k$ instances of the halting problem. From this we then reduce the problem of determining the $k$-th bit of $\Omega$ to determining…

Let $P\in \mathbb Z[X]\setminus\{0\}$ be of degree $\delta\ge 1$ and usual height $H\ge 1$, and let $\alpha\in \overline{\mathbb Q}^*$ be of degree $d\ge 2$. Mahler proved in 1931 the following transcendence measure for $e^\alpha$: for any…

In this paper we prove that given two sets $E_1,E_2 \subset \mathbb{Z}$ of positive density, there exists $k \geq 1$ which is bounded by a number depending only on the densities of $E_1$ and $E_2$ such that $k\mathbb{Z} \subset…

The approximation constant $\lambda_{k}(\zeta)$ is defined as the supremum of real $\eta$ such that $\Vert \zeta^{j}x\Vert\leq x^{-\eta}$ for $1\leq j\leq k$ has infinitely many integer solutions $x$. Here $\Vert.\Vert$ denotes the distance…

Let $\alpha,\beta \in \mathbb{R}_{>0}$ be such that $\alpha,\beta$ are quadratic and $\mathbb{Q}(\alpha)\neq \mathbb{Q}(\beta)$. Then every subset of $\mathbb{R}^n$ definable in both $(\mathbb{R},{<},+,\mathbb{Z},x\mapsto \alpha x)$ and…

Let $\varepsilon>0$ be a small constant. In the present paper we prove that whenever $\eta$ is real and constants $\lambda _i$ satisfy some necessary conditions, then there exist infinitely many prime triples $p_1,\, p_2,\, p_3$ satisfying…

Diophantine quadruples are sets of four distinct positive integers such that the product of any two is one less than a square. All known examples belong to an infinite set which can be constructed recursively. Some observations on these…

Let $\beta>1$. For $x \in [0,\infty)$, we have so-called the $\beta$-expansion of $x$ in base $\beta$ as follows: $$x= \sum_{j \leq k} x_{j}\beta^{j} = x_{k}\beta^{k}+ \cdots + x_{1}\beta+x_{0}+x_{-1}\beta^{-1} + x_{-2}\beta^{-2} + \cdots$$…

This paper investigates the exponential Diophantine equation of the form $a^x+b=c^y$, where $a, b, c$ are given positive integers with $a,c \ge 2$, and $x,y$ are positive integer unknowns. We define this form as a "Type-I transcendental…

In this paper, it is shown that if F(x , y) is an irreducible binary form with integral coefficients and degree $n \geq 3$, then provided that the absolute value of the discriminant of F is large enough, the equation |F(x , y)| = 1 has at…

In this work, we prove the following result(Theorem 1): Suppose that n is a positive integer, p an odd prime, and such that either n is congruent to 0 modulo4 and p congruent to 3 modulo8; or alternatively, n is congruent to 2 modulo4 and p…

In the paper, the authors find the best numbers $\alpha$ and $\beta$ such that $$ \overline{C}\bigl(\alpha a+(1-\alpha)b,\alpha b+(1-\alpha)a\bigr)<T(a,b) <\overline{C}\bigl(\beta a+(1-\beta)b,\beta b+(1-\beta)a\bigr) $$ for all $a,b>0$…

The aim of this paper is to prove the possibility of linearization of such equations by means of introduction of new variables. For $n=2$ such a procedure is well known, when new variables are components of spinors and they are widely used…