p-adic valuations of some sums of multinomial coefficients
We study the palindromic complexity of infinite words , the fixed points of the substitution over a binary alphabet, , , with , which are canonically associated with quadratic non-simple Parry numbers .
We study the palindromic complexity of infinite words uβ, the fixed points of the substitution over a binary alphabet, φ(0) = 0a1, φ(1) = 0b1, with a - 1 ≥ b ≥ 1, which are canonically associated with quadratic non-simple Parry numbers β.
A simple Parry number is a real number such that the Rényi expansion of is finite, of the form . We study the palindromic structure of infinite aperiodic words that are the fixed point of a substitution associated with a simple Parry number . It is shown that the word contains infinitely many palindromes if and only if . Numbers satisfying this condition are the so-called confluent Pisot numbers. If then is an Arnoux-Rauzy word. We show that if is a confluent Pisot number then...
We prove that, for any unit in a real number field of degree , there exits only a finite number of n-tuples in which have a purely periodic expansion by the Jacobi-Perron algorithm. This generalizes the case of continued fractions for . For we give an explicit algorithm to compute all these pairs.