The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying 361 – 380 of 906

Showing per page

Complexity of infinite words associated with beta-expansions

Christiane Frougny, Zuzana Masáková, Edita Pelantová (2004)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

We study the complexity of the infinite word u β associated with the Rényi expansion of 1 in an irrational base β > 1 . When β is the golden ratio, this is the well known Fibonacci word, which is sturmian, and of complexity ( n ) = n + 1 . For β such that d β ( 1 ) = t 1 t 2 t m is finite we provide a simple description of the structure of special factors of the word u β . When t m = 1 we show that ( n ) = ( m - 1 ) n + 1 . In the cases when t 1 = t 2 = = t m - 1 or t 1 > max { t 2 , , t m - 1 } we show that the first difference of the complexity function ( n + 1 ) - ( n ) takes value in { m - 1 , m } for every n , and consequently we determine...

Complexity of infinite words associated with beta-expansions

Christiane Frougny, Zuzana Masáková, Edita Pelantová (2010)

RAIRO - Theoretical Informatics and Applications

We study the complexity of the infinite word uβ associated with the Rényi expansion of 1 in an irrational base β > 1. When β is the golden ratio, this is the well known Fibonacci word, which is Sturmian, and of complexity C(n) = n + 1. For β such that dβ(1) = t1t2...tm is finite we provide a simple description of the structure of special factors of the word uβ. When tm=1 we show that C(n) = (m - 1)n + 1. In the cases when t1 = t2 = ... tm-1or t1 > max{t2,...,tm-1} we show that the first difference of...

Comportement asympotique des hauteurs des points de Heegner

Guillaume Ricotta, Nicolas Templier (2009)

Journal de Théorie des Nombres de Bordeaux

Le terme principal de la moyenne, sur les discriminants quadratiques satisfaisant la condition de Heegner, de la hauteur de Néron-Tate des points de Heegner d’une courbe elliptique rationnelle E a été déterminé dans [13]. Les auteurs ont également conjecturé l’expression du terme suivant. Dans cet article, il est démontré que cette expression est correcte et une asymptotique précise, qui sauve une puissance dans le terme d’erreur, est obtenue. Les annulations des coefficients de Fourier de formes...

Comportement local moyen de la fonction de Brjuno

Michel Balazard, Bruno Martin (2012)

Fundamenta Mathematicae

We describe the average behaviour of the Brjuno function Φ in the neighbourhood of any given point of the unit interval. In particular, we show that the Lebesgue set of Φ is the set of Brjuno numbers and we find the asymptotic behaviour of the modulus of continuity of the integral of Φ.

Composite positive integers whose sum of prime factors is prime

Florian Luca, Damon Moodley (2020)

Archivum Mathematicum

In this note, we show that the counting function of the number of composite positive integers n x such that β ( n ) = p n p is a prime is of order of magnitude at least x / ( log x ) 3 and at most x / log x .

Composite rational functions expressible with few terms

Clemens Fuchs, Umberto Zannier (2012)

Journal of the European Mathematical Society

We consider a rational function f which is ‘lacunary’ in the sense that it can be expressed as the ratio of two polynomials (not necessarily coprime) having each at most a given number of terms. Then we look at the possible decompositions f ( x ) = g ( h ( x ) ) , where g , h are rational functions of degree larger than 1. We prove that, apart from certain exceptional cases which we completely describe, the degree of g is bounded only in terms of (and we provide explicit bounds). This supports and quantifies the intuitive...

Currently displaying 361 – 380 of 906