Searcharxiv⌕ Search

arXiv subjects

Yann Bugeaud

Publications and source records attributed to Yann Bugeaud.

At least 55 records · Page 3Linked to original sources
arXiv2018

Hausdorff dimension in inhomogeneous Diophantine approximation

Let $α$ be an irrational real number. We show that the set of $ε$-badly approximable numbers \[ \mathrm{Bad}^\varepsilon (α) := \{x\in [0,1]\, : \, \liminf_{|q| \to \infty} |q| \cdot \| qα-x \| \geq \varepsilon \} \] has full Hausdorff dimension for some positive $ε$ if and only if $α$ is singular on average. The condition is equivalent to the average $\frac{1}{k} \sum_{i=1, \cdots, k} \log a_i$ of the logarithms of the partial quotients $a_i$ of $α$ going to infinity with $k$. We also consider one-sided approximation, obtain a stronger result when $a_i$ tends to infinity, and establish a partial result in higher dimensions.

math.NT↗
arXiv2018

Nonarchimedean quadratic Lagrange spectra and continued fractions in power series fields

Let ${\bf F}_q$ be a finite field of order a positive power $q$ of a prime number. We study the nonarchimedean quadratic Lagrange spectrum defined by Parkkonen and Paulin by considering the approximation by elements of the orbit of a given quadratic power series in ${\bf F}_q((Y^{-1}))$, for the action by homographies and anti-homographies of ${\rm PGL}_2({\bf F}_q[Y])$ on ${\bf F}_q((Y^{-1})) \cup \{\infty\}$. While their approach used geometric methods of group actions on Bruhat--Tits trees, ours is based on the theory of continued fractions in power series fields.

math.NT↗
arXiv2017

Metrical results on the distribution of fractional parts of powers of real numbers

Denote by {$\times$} the fractional part. We establish several new metrical results on the distribution properties of the sequence ({x n }) n$\ge$1. Many of them are presented in a more general framework, in which the sequence of functions (x $\rightarrow$ x n) n$\ge$1 is replaced by a sequence (fn) n$\ge$1 , under some growth and regularity conditions on the functions fn.

math.NT↗
arXiv2017

S-parts of values of univariate polynomials, binary forms and decomposable forms at integral points

Let $S$ be a finite set of primes. The $S$-part $[m]_S$ of a non-zero integer $m$ is the largest positive divisor of $m$ that is composed of primes from $S$. In 2013, Gross and Vincent proved that if $f(X)$ is a polynomial with integer coefficients and with at least two roots in the complex numbers, then for every integer $x$ at which $f(x)$ is non-zero, we have (*) $[f(x)]_S\leq c\cdot |f(x)|^d$, where $c$ and $d$ are effectively computable and $d<1$. Their proof uses Baker-type estimates for linear forms in complex logarithms of algebraic numbers. As an easy application of the $p$-adic Thue-Siegel-Roth theorem we show that if $f(X)$ has degree $n\geq 2$ and no multiple roots, then an inequality such as (*) holds for all $d>1/n$, provided we do not require effectivity of $c$. Further, we show that such an inequality does not hold anymore with $d=1/n$ and sufficiently small $c$. In addition we prove a density result, giving for every $ε>0$ an asymptotic estimate with the right order of magnitude for the number of integers $x$ with absolute value at most $B$ such that $f(x)$ has $S$-part at least $|f(x)|^ε$. The result of Gross and Vincent, as well as the other results mentioned above, are generalized to values of binary forms and decomposable forms at integral points. Our main tools are Baker type estimates for linear forms in complex and $p$-adic logarithms, the $p$-adic Subspace Theorem of Schmidt and Schlickewei, and a recent general lattice point counting result of Barroero and Widmer.

math.NT↗
arXiv2017

A new complexity function, repetitions in Sturmian words, and irrationality exponents of Sturmian numbers

We introduce and study a new complexity function in combinatorics on words, which takes into account the smallest second occurrence time of a factor of an infinite word. We characterize the eventually periodic words and the Sturmian words by means of this function. Then, we establish a new result on repetitions in Sturmian words and show that it is best possible. Let $b \ge 2$ be an integer. We deduce a lower bound for the irrationality exponent of real numbers whose sequence of $b$-ary digits is a Sturmian sequence over $\{0,1,\ldots, b-1\}$ and we prove that this lower bound is best possible. As an application, we derive some information on the $b$-ary expansion of $\log(1+\frac{1}{a})$,for any integer $a \ge 34$.

math.NT↗
arXiv2017

On the digital representation of smooth numbers

Let $b \ge 2$ be an integer. Among other results, we establish, in a quantitative form, that any sufficiently large integer which is not a multiple of $b$ cannot have simultaneously only few distinct prime factors and only few nonzero digits in its representation in base $b$.

math.NT↗
arXiv2016

On the expansions of real numbers in two integer bases

Let $r$ and $s$ be multiplicatively independent positive integers. We establish that the $r$-ary expansion and the $s$-ary expansion of an irrational real number, viewed as infinite words on $\{0, 1, \ldots , r-1\}$ and $\{0, 1, \ldots , s-1\}$, respectively, cannot have simultaneously a low block complexity. In particular, they cannot be both Sturmian words.

math.NT↗
arXiv2016

$S$-parts of terms of integer linear recurrence sequences

Let $S = \{q_1, \ldots , q_s\}$ be a finite, non-empty set of distinct prime numbers. For a non-zero integer $m$, write $m = q_1^{r_1} \ldots q_s^{r_s} M$, where $r_1, \ldots , r_s$ are non-negative integers and $M$ is an integer relatively prime to $q_1 \ldots q_s$. We define the $S$-part $[m]_S$ of $m$ by $[m]_S := q_1^{r_1} \ldots q_s^{r_s}$. Let $(u_n)_{n \ge 0}$ be a linear recurrence sequence of integers. Under certain necessary conditions, we establish that for every $\varepsilon > 0$, there exists an integer $n_0$ such that $[u_n]_S\leq |u_n|^{\varepsilon}$ holds for $n > n_0$. Our proof is ineffective in the sense that it does not give an explicit value for $n_0$. Under various assumptions on $(u_n)_{n \ge 0}$, we also give effective, but weaker, upper bounds for $[u_n]_S$ of the form $|u_n|^{1 -c}$, where $c$ is positive and depends only on $(u_n)_{n \ge 0}$ and $S$.

math.NT↗
arXiv2016

Hausdorff dimension and uniform exponents in dimension two

In this paper we prove the Hausdorff dimension of the set of (nondegenerate) singular two-dimensional vectors with uniform exponent $μ$ $\in$ (1/2, 1) is 2(1 -- $μ$) when $μ$ $\ge$ $\sqrt$ 2/2, whereas for $μ$ \textless{} $\sqrt$ 2/2 it is greater than 2(1 -- $μ$) and at most (3 -- 2$μ$)(1 -- $μ$)/(1 + $μ$ + $μ$ 2). We also establish that this dimension tends to 4/3 (which is the dimension of the set of singular two-dimensional vectors) when $μ$ tends to 1/2. These results improve upon previous estimates of R. Baker, joint work of the first author with M. Laurent, and unpublished work of M. Laurent. We also prove a lower bound on the packing dimension that is strictly greater than the Hausdorff dimension for $μ$ $\ge$ 0.565. .. .

math.NT↗
arXiv2016

On the digital representation of integers with bounded prime factors

Let $b \ge 2$ be an integer. Not much is known on the representation in base $b$ of prime numbers or of numbers whose prime factors belong to a given, finite set. Among other results, we establish that any sufficiently large integer which is not a multiple of $b$ and has only small (in a suitable sense) prime factors has at least four nonzero digits in its representation in base $b$.

math.NT↗
arXiv2016

On the expansions of real numbers in two multiplicative dependent bases

Let $r \ge 2$ and $s \ge 2$ be multiplicatively dependent integers. We establish a lower bound for the sum of the block complexities of the $r$-ary expansion and of the $s$-ary expansion of an irrational real number, viewed as infinite words on $\{0, 1, \ldots , r-1\}$ and $\{0, 1, \ldots , s-1\}$, and we show that this bound is best possible.

math.NT↗
arXiv2016

Absolute real root separation

While the separation (the minimal nonzero distance) between roots of a polynomial is a classical topic, its absolute counterpart (the minimal nonzero distance between their absolute values) does not seem to have been studied much. We present the general context and give tight bounds for the case of real roots.

math.NT↗
arXiv2016

On uniform approximation to real numbers

Let $n \ge 2$ be an integer and $ξ$ a transcendental real number. We establish several new relations between the values at $ξ$ of the exponents of Diophantine approximation $w_n, w_{n}^{\ast}, \hat{w}_{n}$, and $\hat{w}_{n}^{\ast}$. Combining our results with recent estimates by Schmidt and Summerer allows us to refine the inequality $\hat{w}_{n}(ξ) \le 2n-1$ proved by Davenport and Schmidt in 1969.

math.NT↗
arXiv2016

Effective irrationality measures for real and $p$-adic roots of rational numbers close to $1$, with an application to parametric families of Thue-Mahler equations

We show how the theory of linear forms in two logarithms allows one to get effective irrationality measures for $n$-th roots of rational numbers ${a \over b}$, when $a$ is very close to $b$. We give a $p$-adic analogue of this result under the assumption that $a$ is $p$-adically very close to $b$, that is, that a large power of $p$ divides $a-b$. As an application, we solve completely certain families of Thue-Mahler equations. Our results illustrate, admittedly in a very special situation, the strength of the known estimates for linear forms in logarithms.

math.NT↗
arXiv2015

On the $b$-ary expansions of $\log (1 + \frac{1}{a})$ and ${\mathrm e}$

Let $b \ge 2$ be an integer and $ξ$ an irrational real number. We prove that, if the irrationality exponent of $ξ$ is equal to $2$ or slightly greater than $2$, then the $b$-ary expansion of $ξ$ cannot be `too simple', in a suitable sense. Our result applies, among other classical numbers, to badly approximable numbers, non-zero rational powers of ${\mathrm e}$, and $\log (1 + \frac{1}{a})$, provided that the integer $a$ is sufficiently large. It establishes an unexpected connection between the irrationality exponent of a real number and its $b$-ary expansion.

math.NT↗
arXiv2015

Hankel determinants, Padé approximations, and irrationality exponents

The irrationality exponent of an irrational number $ξ$, which measures the approximation rate of $ξ$ by rationals, is in general extremely difficult to compute explicitly, unless we know the continued fraction expansion of $ξ$. Results obtained so far are rather fragmentary, and often treated case by case. In this work, we shall unify all the known results on the subject by showing that the irrationality exponents of large classes of automatic numbers and Mahler numbers (which are transcendental) are exactly equal to $2$. Our classes contain the Thue--Morse--Mahler numbers, the sum of the reciprocals of the Fermat numbers, the regular paperfolding numbers, which have been previously considered respectively by Bugeaud, Coons, and Guo, Wu and Wen, but also new classes such as the Stern numbers and so on. Among other ingredients, our proofs use results on Hankel determinants obtained recently by Han.

math.NT↗
arXiv2015

Diophantine approximation of Mahler numbers

Suppose that $F(x)\in\mathbb{Z}[[x]]$ is a Mahler function and that $1/b$ is in the radius of convergence of $F(x)$. In this paper, we consider the approximation of $F(1/b)$ by algebraic numbers. In particular, we prove that $F(1/b)$ cannot be a Liouville number. If $F(x)$ is also regular, we show that $F(1/b)$ is either rational or transcendental, and in the latter case that $F(1/b)$ is an $S$-number or a $T$-number.

math.NT↗