O. Parshina

collaborators

3 papers

math.CO2019

The perfect 2-colorings of infinite circulant graphs with a continuous set of odd distances

O. G. Parshina, M. A. Lisitsyna

A vertex coloring of a given simple graph $G = (V, E)$ with $k$ colors ( $k$ -coloring) is a map from its vertex set to the set of integers ${1, 2, 3, \dots, k}$ . A coloring is called pe…

math.CO2018

On arithmetic index in the generalized Thue-Morse word

Olga Parshina

Let $q$ be a positive integer. Consider an infinite word $ω = w_{0} w_{1} w_{2} \dots$ over an alphabet of cardinality $q$ . A finite word $u$ is called an arithmetic factor of $ω$ if $u=w_cw…

math.CO2018

Open and closed factors of Arnoux-Rauzy words

Olga Parshina, Luca Zamboni

A finite word $u$ is called closed if its longest repeated prefix has exactly two occurrences in $u,$ once as a prefix and once as a suffix. We study the function $f_x^c:\mathbb N…