150 citations · 496 across the 43 of their papers we have counts for
Showing 2011Show all
3 papers · 1 filter
math.CO2011★ 1 cited
Central sets defined by words of low factor complexity
Michelangelo Bucci, Svetlana Puzynina, Luca Q. Zamboni
A subset of is called an IP-set if contains all finite sums of distinct terms of some infinite sequence of natural numbers. Central…
cs.DM2011
On automatic infinite permutations
Anna Frid, Luca Zamboni
An infinite permutation is a linear ordering of . We study properties of infinite permutations analogous to those of infinite words, and show some resemblances and s…
cs.FL2011
Abelian returns in Sturmian words
Svetlana Puzynina, Luca Q. Zamboni
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 wor…