April 2, 2024
1:50PM - 2:45PM
Enarson 318
Add to Calendar
2024-04-02 13:50:00
2024-04-02 14:45:00
When does one k-automatic set define another?
Title: When does one k-automatic set define another?Speaker: Chris Schulz (University of Waterloo)Abstract: The k-automatic sets are those subsets of N^d whose base-k representations form a regular language. Building on theorems of Büchi and Bès, we aim to characterize the partial preorder among k-automatic sets of definability over (N, +). We give a conjecture—that this preorder contains exactly three equivalence classes—and discuss our progress toward proving this conjecture. This talk is based on joint work with Alexi Block Gorman (OSU) and Jason Bell (Waterloo).URL associated with Seminar: https://research.math.osu.edu/logicseminar/
Enarson 318
OSU ASC Drupal 8
ascwebservices@osu.edu
America/New_York
public
Date Range
Add to Calendar
2024-04-02 13:50:00
2024-04-02 14:45:00
When does one k-automatic set define another?
Title: When does one k-automatic set define another?Speaker: Chris Schulz (University of Waterloo)Abstract: The k-automatic sets are those subsets of N^d whose base-k representations form a regular language. Building on theorems of Büchi and Bès, we aim to characterize the partial preorder among k-automatic sets of definability over (N, +). We give a conjecture—that this preorder contains exactly three equivalence classes—and discuss our progress toward proving this conjecture. This talk is based on joint work with Alexi Block Gorman (OSU) and Jason Bell (Waterloo).URL associated with Seminar: https://research.math.osu.edu/logicseminar/
Enarson 318
Department of Mathematics
math@osu.edu
America/New_York
public
Title: When does one k-automatic set define another?
Speaker: Chris Schulz (University of Waterloo)
Abstract: The k-automatic sets are those subsets of N^d whose base-k representations form a regular language. Building on theorems of Büchi and Bès, we aim to characterize the partial preorder among k-automatic sets of definability over (N, +). We give a conjecture—that this preorder contains exactly three equivalence classes—and discuss our progress toward proving this conjecture. This talk is based on joint work with Alexi Block Gorman (OSU) and Jason Bell (Waterloo).
URL associated with Seminar: https://research.math.osu.edu/logicseminar/
