14 citations · 46 across the 24 of their papers we have counts for
32 papers
On possible values of the group complexity function of infinite words
Maksim Launer, Svetlana Puzynina, Ekaterina Voloshinova
A classical notion of a factor complexity of an infinite word is defined as a function counting, for each , the number of distinct factors (or blocks of consecutive lette…
On abelian periodicity of purely morphic words
Arina Filimonova, Svetlana Puzynina
Deciding periodicity of infinite words generated by morphisms is a classical result in combinatorics on words from 80's by Harju, Linna and Pansiot. In this paper, we are intereste…
Bounds on the closed-rich constant of infinite words
Anuran Maity, Svetlana Puzynina
A finite word is called \textit{closed} if it has length at most 1 or it contains a proper factor that occurs both as a prefix and as a suffix but does not have internal occurr…
WELLDOC property for words generated by morphisms
Svetlana Puzynina, Vladimir Schavelev
In this paper, we study an abelian-type property of infinite words called well distributed occurrences, or WELLDOC for short. An infinite word on a -ary alphabet has the WEL…
Recovery of cyclic words by their subwords
Sergey Luchinin, Svetlana Puzynina, Michaël Rao
A problem of reconstructing words from their subwords involves determining the minimum amount of information needed, such as multisets of scattered subwords of a specific length or…
Abelian Combinatorics on Words: a Survey
Gabriele Fici, Svetlana Puzynina
We survey known results and open problems in abelian combinatorics on words. Abelian combinatorics on words is the extension to the commutative setting of the classical theory of c…