Palindromic complexity of infinite words associated with non-simple Parry numbers
L'ubomíra Balková, Zuzana Masáková
Abstract
We study the palindromic complexity of infinite words uβ, the fixed points of the substitution over a binary alphabet, ϕ(0)=0a1, ϕ(1)=0b1, with a-1≥ b≥ 1, which are canonically associated with quadratic non-simple Parry numbers β.
Create a lesson
Related papers
Combinatorics of hyperplane arrangements and Witten zeta function at the origin
Kam Cheong Au, Kazuhiro Onodera
Proof of the Pach-Tardos conjecture
Lior Gishboliner, Xiangyu Li
Longest cycles intersect linearly in highly connected graphs
Jie Ma, Bo Ning, Ziyuan Zhao
Cutting a convex body into fat parts and approximating Euclidean distance by graph distances
János Pach, Gábor Tardos
A counterexample to the quantum Hedetniemi conjecture
Julius A. Zeiss
Schrijver-Delsarte rigidity in association schemes and undecidability of quantum graph homomorphism
Lorenzo Ciardo, Iris Hebbeker, Gideo Joubert et al.