Displaying 861 – 880 of 1538

Showing per page

On simultaneous rational approximation to a real number and its integral powers

Yann Bugeaud (2010)

Annales de l’institut Fourier

For a positive integer n and a real number ξ , let λ n ( ξ ) denote the supremum of the real numbers λ such that there are arbitrarily large positive integers q such that | | q ξ | | , | | q ξ 2 | | , ... , | | q ξ n | | are all less than q - λ . Here, | | · | | denotes the distance to the nearest integer. We study the set of values taken by the function λ n and, more generally, we are concerned with the joint spectrum of ( λ 1 , ... , λ n , ... ) . We further address several open problems.

On subsequences of convergents to a quadratic irrational given by some numerical schemes

Benoît Rittaud (2010)

Journal de Théorie des Nombres de Bordeaux

Given a quadratic irrational α , we are interested in how some numerical schemes applied to a convenient function f provide subsequences of convergents to α . We investigate three numerical schemes: secant-like methods and formal generalizations, which lead to linear recurring subsequences; the false position method, which leads to arithmetical subsequences of convergents and gives some interesting series expansions; Newton’s method, for which we complete a result of Edward Burger [1] about the existence...

On substitution invariant Sturmian words: an application of Rauzy fractals

Valérie Berthé, Hiromi Ei, Shunji Ito, Hui Rao (2007)

RAIRO - Theoretical Informatics and Applications

Sturmian words are infinite words that have exactly n+1 factors of length n for every positive integer n. A Sturmian word sα,p is also defined as a coding over a two-letter alphabet of the orbit of point ρ under the action of the irrational rotation Rα : x → x + α (mod 1). A substitution fixes a Sturmian word if and only if it is invertible. The main object of the present paper is to investigate Rauzy fractals associated with two-letter invertible substitutions. As an application, we give...

On systems of linear inequalities

Masami Fujimori (2003)

Bulletin de la Société Mathématique de France

We show in detail that the category of general Roth systems or the category of semi-stable systems of linear inequalities of slope zero is a neutral Tannakian category. On the way, we present a new proof of the semi-stability of the tensor product of semi-stable systems. The proof is based on a numerical criterion for a system of linear inequalities to be semi-stable.

On terms of linear recurrence sequences with only one distinct block of digits

Diego Marques, Alain Togbé (2011)

Colloquium Mathematicae

In 2000, Florian Luca proved that F₁₀ = 55 and L₅ = 11 are the largest numbers with only one distinct digit in the Fibonacci and Lucas sequences, respectively. In this paper, we find terms of a linear recurrence sequence with only one block of digits in its expansion in base g ≥ 2. As an application, we generalize Luca's result by finding the Fibonacci and Lucas numbers with only one distinct block of digits of length up to 10 in its decimal expansion.

Currently displaying 861 – 880 of 1538