2 papers
math.LO2025
Isomorphism Spectra and Computably Composite Structures
Joey Lakerdas-Gayle
Adapting a result of Bazhenov, Kalimullin, and Yamaleev, we show that if a Turing degree is the degree of categoricity of a computable structure and is n…
math.CO2022
The lexicographically least square-free word with a given prefix
Siddharth Berera, Andrés Gómez-Colunga, Joey Lakerdas-Gayle +6
The lexicographically least square-free infinite word on the alphabet of non-negative integers with a given prefix is denoted . When is the empty word, this word was…