activity
20112026
most citedAperiodic pseudorandom number generators based on infinite words

14 citations · 46 across the 24 of their papers we have counts for

collaborators
Showing math.COShow all

20 papers · 1 filter

math.CO2026

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…

math.CO2021

Abelian Nivat's conjecture for non-rectangular patterns

Nikolai Geravker, Svetlana Puzynina

In this paper, we study the relation between periodicity of two-dimensional words and their abelian pattern complexity. A pattern in is the set of all tran…

math.CO2021

Sequences of symmetry groups of infinite words

Sergey Luchinin, Svetlana Puzynina

In this paper we introduce a new notion of a sequence of symmetry groups of an infinite word. Given a subgroup of the symmetric group , it acts on the set of finite word…

math.CO2021

Finite and infinite closed-rich words

Olga Parshina, Svetlana Puzynina

A word is called closed if it has a prefix which is also its suffix and there is no internal occurrences of this prefix in the word. In this paper we study words that are rich in c…

math.CO2020★ 1 cited

On Abelian Closures of Infinite Non-binary Words

Juhani Karhumäki, Svetlana Puzynina, Markus A. Whiteland

Two finite words and are called abelian equivalent if each letter occurs equally many times in both and . The abelian closure of an infinit…

math.CO2020

Abelian Closures of Infinite Binary Words

Svetlana Puzynina, Markus A. Whiteland

Two finite words and are called Abelian equivalent if each letter occurs equally many times in both and . The abelian closure of (the shift…