Predavatelj: Jean-Paul Allouche (Université Pierre et Marie Curie, Pariz, Francija)
Let us define an innocent looking 0-1 sequence as the sequence whose n-th term is the parity of the sum of the binary digits of the integer n. So that the
sequence begins with: 0 1 1 0 1 0 0 1 0 1 1 …
The talk will be a promenade among many properties and many occurrences of this sequence in various and sometimes unexpected fields: from number theory (multigrades, transcendence, continued fractions, curious infinite products, Dirichlet series, partitions of the integers, noninteger numeration bases) to combinatorics of words
and theoretical computer science, from differential geometry to
iteration of continuous functions and fractals, from physics to chess, music, games, and economics.
sequence begins with: 0 1 1 0 1 0 0 1 0 1 1 …
The talk will be a promenade among many properties and many occurrences of this sequence in various and sometimes unexpected fields: from number theory (multigrades, transcendence, continued fractions, curious infinite products, Dirichlet series, partitions of the integers, noninteger numeration bases) to combinatorics of words
and theoretical computer science, from differential geometry to
iteration of continuous functions and fractals, from physics to chess, music, games, and economics.
