Pseudoperiodic Words and a Question of Shevelev
We generalize the familiar notion of periodicity in sequences to a new kind of pseudoperiodicity, and we prove some basic results about it. We revisit the results of a 2012 paper of Shevelev and reprove his results in a simpler and more unified manner, and provide a complete answer to one of his pre...
Saved in:
| Main Authors: | Joseph Meleshko, Pascal Ochem, Jeffrey Shallit, Sonja Linghui Shan |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2023-10-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Subjects: | |
| Online Access: | http://dmtcs.episciences.org/9919/pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Antisquares and Critical Exponents
by: Aseem Baranwal, et al.
Published: (2023-09-01) -
Contact graphs of boxes with unidirectional contacts
by: Daniel Gonçalves, et al.
Published: (2024-05-01) -
Bears with Hats and Independence Polynomials
by: Václav Blažej, et al.
Published: (2023-10-01) -
Treewidth 2 in the Planar Graph Product Structure Theorem
by: Marc Distel, et al.
Published: (2025-03-01) -
Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly
by: Laurent Beaudou, et al.
Published: (2024-04-01)