University of Cambridge > Talks.cam > Discrete Analysis Seminar > Nivat's Conjecture and expansive dynamics

Nivat's Conjecture and expansive dynamics

Add to your list(s) Download to your calendar using vCal

  • UserBryna Kra, Northwestern University, Chicago
  • ClockWednesday 24 October 2012, 16:00-17:00
  • HouseMR11, CMS.

If you have a question about this talk, please contact Ben Green.

The Morse-Hedlund Theorem states that an infinite word in a finite alphabet is periodic if and only if there is exists a positive integer n such that the complexity (the number of words of length n) is bounded by n, and a natural approach to this theorem is via analyzing the dynamics of the Z-action associated to the word. In two dimensions, a conjecture of Nivat states that if there exist positive integers n and k such that the complexity (the number of n by k rectangles) is bounded by nk. Associating a Z^2 dynamical system to the infinite word, we show that periodicity is equivalent to a statement about the expansive subspaces of the action. As a corollary, we prove a weaker form of Nivat’s conjecture, under a stronger bound on the complexity function. This is joint work with Van Cyr.

This talk is part of the Discrete Analysis Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2017 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity