Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Tropea, Tomás"'
Autor:
Becher, Verónica, Tropea, Tomás
Fix a finite alphabet. A necklace is a circular word. For positive integers $n$ and~$k$, a necklace is $(n,k)$-perfect if all words of length $n$ occur $k$ times but at positions with different congruence modulo $k$, for any convention of the startin
Externí odkaz:
http://arxiv.org/abs/2405.17812