University COVID-19 update

The University of Waterloo is constantly updating our most Frequently Asked Questions.

Questions about buildings and services? Visit the list of Modified Services.

Please note: The University of Waterloo is closed for all events until further notice.

Algebra SeminarExport this event to calendar

Wednesday, September 30, 2020 — 2:30 PM EDT

Seda Albayrak, Department of Pure Mathematics, University of Waterloo

"A Strong version of Cobham’s theorem"

Cobham’s theorem is a fundamental result in the theory of automatic sequences. It says that if a sequence is both p- and q-automatic with p and q multiplicatively independent integers that are each at least two, then this sequence is ultimately periodic. Using automatic sequences, one can define automatic sets. A long-known dichotomy for the growth of automatic sets says that they are either sparse (growth function is poly-logarithmically bounded) or non-sparse. We consider sparse automatic sets and show that if S is a sparse p-automatic set and T is a sparse q-automatic set with p and q multiplicatively independent integers that are greater than or equal to two, then the intersection of S and T is finite. In fact, we can find an explicit bound for the cardinality of the intersection in terms of the sizes of the automata that accept the sets S and T.

Zoom meeting: https://us02web.zoom.us/j/87636005367?pwd=T2p6ZkJlSUp1d093K3d6NkhFZEVJdz09

S M T W T F S
30
31
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
1
2
3
  1. 2021 (46)
    1. June (11)
    2. May (1)
    3. April (4)
    4. March (11)
    5. February (9)
    6. January (10)
  2. 2020 (103)
    1. December (10)
    2. November (12)
    3. October (4)
    4. September (3)
    5. August (1)
    6. July (5)
    7. June (1)
    8. May (3)
    9. March (16)
    10. February (26)
    11. January (22)
  3. 2019 (199)
  4. 2018 (212)
  5. 2017 (281)
  6. 2016 (335)
  7. 2015 (211)
  8. 2014 (235)
  9. 2013 (251)
  10. 2012 (135)