Abelian returns in Sturmian words

DOI10.4204/EPTCS.63.24zbMATH Open1331.68172arXiv1108.3635OpenAlexW3098017978MaRDI QIDQ5890500FDOQ5890500

Publication date: 1 March 2016

Published in: Electronic Proceedings in Theoretical Computer Science (Search for Journal in Brave)

Abstract: In this paper we study an abelian version of the notion of return word. Our main result is a new characterization of Sturmian words via abelian returns. Namely, we prove that a word is Sturmian if and only if each of its factors has two or three abelian returns. In addition, we describe the structure of abelian returns in Sturmian words, and discuss connections between abelian returns and periodicity.

Full work available at URL: https://arxiv.org/abs/1108.3635

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cited In (1)

Title not available (Why is that?)

This page was built for publication: Abelian returns in Sturmian words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5890500)