CeVis
  1. Center of Complex Systems and Visualization
  2. Lehre
  3. Oberseminar

In dem regelmäßig stattfindenden Oberseminar tragen Gäste aus aller Welt über Forschungsarbeiten zu Themen vor, die mit der Arbeit von CeVis und MeVis in Verbindung stehen, und Mitarbeiter von CeVis und MeVis präsentieren ihre neusten Ergebnisse.


C(M)eVis-Oberseminar am 3.5.2000


Datum: Mittwoch, der 18.10.2000
Zeit: 11.00 Uhr s.t.
Ort: Seminarraum Mandelbrot
Referent: Prof. Dr. Jean-Paul Allouche (CNRS, LRI, Orsay)
Palindrome complexity of infinite sequences

The spectrum of one-dimensional discrete continuous Schrödinger operators with potentials taking only finitely many values can be determined when the sequence of potentials has ``good combinatorial properties''. An example is when the sequence of potentials contains arbitrarily long palindromes (and is minimal). On the other hand a well-known measure of ``complexity'' of such a sequence is the complexity function that counts for each integer n the number of blocks of length n. We thus introduce and will study the palindrome complexity of an infinite sequence on a finite alphabet: it counts the number of palindromic blocks of length n.

This is a joint work with M. Baake, J. Cassaigne, and D. Damanik.


A. Rodenhausen, 25.9.2000