Speciality: 01.01.09 (Discrete mathematics and mathematical cybernetics)
Birth date: 7.05.1982
E-mail:
Website: https://math.nsc.ru/~puzynina
Keywords: infinite words, Sturmian words, periodicity, equitable partitions.
UDC: 621.391.15, 519.714, 519.17

Subject:

Combinatorics, coding theory, graph theory.

Main publications:

1. S. A. Puzynina, “On periodicity of generalized two-dimensional infinite words”, Information and Computation, 207:11 (2009), 1315–1328
2. J. Karhumäki, S. A. Puzynina, “Locally catenative sequences and Turtle graphics”, RAIRO-Theor. Inf. Appl., 45 (2011), 311–330
3. S. A. Puzynina, S. V. Avgustinovich, “On periodicity of two-dimensional words”, Theoretical Computer Science, 391 (2008), 178–187
4. S. A. Puzynina, “Perfect colorings of the infinite rectangular grid”, Bayreuther Mathematischen Schriften, 74 (2005), 317–331
5. S. Avgustinovich, J. Karhumäki, S. Puzynina, “On abelian versions of Critical Factorization Theorem.”, RAIRO-Theor. Inf. Appl., 2011

Publications in Math-Net.Ru

Presentations in Math-Net.Ru

Personal pages:

• 
• 

Organisations:

• Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk
• University of Turku, Department of Mathematics and Statistics
• Novosibirsk State University