Displaying 341 – 360 of 902

Showing per page

Completely normal elements in some finite abelian extensions

Ja Koo, Dong Shin (2013)

Open Mathematics

We present some completely normal elements in the maximal real subfields of cyclotomic fields over the field of rational numbers, relying on the criterion for normal element developed in [Jung H.Y., Koo J.K., Shin D.H., Normal bases of ray class fields over imaginary quadratic fields, Math. Z., 2012, 271(1–2), 109–116]. And, we further find completely normal elements in certain abelian extensions of modular function fields in terms of Siegel functions.

Complex Hyperbolic Surfaces of Abelian Type

Holzapfel, R. (2004)

Serdica Mathematical Journal

2000 Mathematics Subject Classification: 11G15, 11G18, 14H52, 14J25, 32L07.We call a complex (quasiprojective) surface of hyperbolic type, iff – after removing finitely many points and/or curves – the universal cover is the complex two-dimensional unit ball. We characterize abelian surfaces which have a birational transform of hyperbolic type by the existence of a reduced divisor with only elliptic curve components and maximal singularity rate (equal to 4). We discover a Picard modular surface of...

Complexité des suites de Rudin-Shapiro généralisées

J.-P. Allouche, J. O. Shallit (1993)

Journal de théorie des nombres de Bordeaux

La complexité d’une suite infinie est définie comme la fonction qui compte le nombre de facteurs de longueur k dans cette suite. Nous prouvons ici que la complexité des suites de Rudin-Shapiro généralisées (qui comptent les occurrences de certains facteurs dans les développements binaires d’entiers) est ultimement affine.

Complexité et automates cellulaires linéaires

Valérie Berthé (2010)

RAIRO - Theoretical Informatics and Applications

The aim of this paper is to evaluate the growth order of the complexity function (in rectangles) for two-dimensional sequences generated by a linear cellular automaton with coefficients in / l , and polynomial initial condition. We prove that the complexity function is quadratic when l is a prime and that it increases with respect to the number of distinct prime factors of l.

Complexity of Hartman sequences

Christian Steineder, Reinhard Winkler (2005)

Journal de Théorie des Nombres de Bordeaux

Let T : x x + g be an ergodic translation on the compact group C and M C a continuity set, i.e. a subset with topological boundary of Haar measure 0. An infinite binary sequence a : { 0 , 1 } defined by a ( k ) = 1 if T k ( 0 C ) M and a ( k ) = 0 otherwise, is called a Hartman sequence. This paper studies the growth rate of P a ( n ) , where P a ( n ) denotes the number of binary words of length n occurring in a . The growth rate is always subexponential and this result is optimal. If T is an ergodic translation x x + α ...

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...

Currently displaying 341 – 360 of 902