Joint Mathematics Meetings AMS Special Session

Current as of Saturday, January 25, 2020 03:30:05

Joint Mathematics Meetings

• Colorado Convention Center, Denver, CO
• January 15-18, 2020 (Wednesday - Saturday)
• Meeting #1154

Associate secretaries:

Michel L Lapidus, AMS lapidus@math.ucr.edu
Hortensia Soto, MAA hortensia.soto@unco.edu

• Wednesday January 15, 2020, 8:00 a.m.-10:50 a.m.
  AMS Special Session on Sequences, Words, and Automata, I
  Room 403, Meeting Room Level, Colorado Convention Center
  Organizers:
  Eric Rowland, Hofstra University eric.rowland@hofstra.edu
  Manon Stipulanti, Hofstra University
  

  • 8:00 a.m.
    Combinatorics of Kaprekar's Junction Numbers.
    Max Alekseyev*, George Washington University
    Neil Sloane, The OEIS Foundation, Inc.
    (1154-11-1093)
  • 8:30 a.m.
    Bow Sequences.
    Melissa Dennison*, Baldwin Wallace University
    (1154-11-2289)
  • 9:00 a.m.
    Automatic sequences and curves over finite fields.
    Andrew Bridy*, Yale University
    (1154-11-1900)
  • 9:30 a.m.
    Substitutive systems and a finitary version of Cobham's theorem.
    Jakub Byszewski*, Jagiellonian University
    (1154-05-1737)
  • 10:00 a.m.
    Syntactic Tokens.
    Andrzej Ehrenfeucht*, Computer Science Dept. University of Colorado Boulder
    (1154-05-263)
  • 10:30 a.m.
    Automorphisms of the Free Group and Perfectly Clustering Words.
    Mélodie Lapointe*, LaCIM, Université du Québec à Montréal
    (1154-05-1181)
• Wednesday January 15, 2020, 2:15 p.m.-6:05 p.m.
  AMS Special Session on Sequences, Words, and Automata, II
  Room 403, Meeting Room Level, Colorado Convention Center
  Organizers:
  Eric Rowland, Hofstra University eric.rowland@hofstra.edu
  Manon Stipulanti, Hofstra University
  

  • 2:15 p.m.
    Duluthian Developments in the Anti-Powerful Words World.
    Colin Defant*, Princeton University
    (1154-05-162)
  • 2:45 p.m.
    Increasing consecutive patterns in words.
    Mingjia Yang*, Rutgers University
    Doron Zeilberger, Rutgers University
    (1154-05-1466)
  • 3:15 p.m.
    The abelian complexity of infinite words and the Frobenius problem.
    Ian Kaye, University of Winnipeg
    Narad Rampersad*, University of Winnipeg
    (1154-68-201)
  • 3:45 p.m.
    Abelian subshifts.
    Svetlana Puzynina*, Saint Petersburg State University, Russia
    (1154-05-1299)
  • 4:15 p.m.
    On non-repetitive complexity of Arnoux-Rauzy words.
    Kateřina Medková, Department of Mathematics, FNSPE, Czech Technical University in Prague, Czech Republic
    Edita Pelantová, Department of Mathematics, FNSPE, Czech Technical University in Prague, Czech Republic
    Elise Vandomme*, Liège, Belgium
    (1154-05-1534)
  • 4:45 p.m.
    The repetition threshold for binary rich words.
    James D. Currie, The University of Winnipeg
    Lucas Mol*, The University of Winnipeg
    Narad Rampersad, The University of Winnipeg
    (1154-05-444)
  • 5:15 p.m.
    Nyldon words.
    Émilie Charlier, Université de Liège
    Manon Philibert, Université Aix-Marseille
    Manon Stipulanti*, Université de Liège and Hofstra University
    (1154-05-933)
  • 5:45 p.m.
    New Results on Nyldon Words Derived Using an Algorithm from Hall Set Theory.
    Swapnil Garg*, MIT
    (1154-05-2347)