Cover Image

Recovery of cyclic words by their subwords

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Luchinin, Sergey, Puzynina, Svetlana, Rao, Michaël
Format:	Preprint
Published:	2024
Subjects:	Discrete Mathematics Combinatorics 68R15
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

WELLDOC property for words generated by morphisms
by: Puzynina, Svetlana, et al.
Published: (2026)

Additive word complexity and Walnut
by: Popoli, Pierre, et al.
Published: (2024)

Palindromic length of infinite aperiodic words
by: Rukavicka, Josef
Published: (2024)

String attractors and bi-infinite words
by: Béaur, Pierre, et al.
Published: (2024)

Subexponential upper bound on the number of rich words
by: Rukavicka, Josef
Published: (2025)

Bounds on the closed-rich constant of infinite words
by: Maity, Anuran, et al.
Published: (2026)

On the pseudorandomness of Parry--Bertrand automatic sequences
by: Popoli, Pierre, et al.
Published: (2024)

Structure and growth of $\mathbb{R}$-bonacci words
by: Dovgal, Sergey, et al.
Published: (2023)

The repetition threshold for ternary rich words
by: Currie, James D., et al.
Published: (2024)

Avoiding abelian and additive powers in rich words
by: Andrade, Jonathan, et al.
Published: (2024)

Factor-balancedness, linear recurrence, and factor complexity
by: Espinoza, Bastiàn, et al.
Published: (2026)

Universal partial tori
by: Carey, William D., et al.
Published: (2024)

Exploring the Crochemore and Ziv-Lempel factorizations of some automatic sequences with the software Walnut
by: Jahannia, Marieh, et al.
Published: (2024)

Extremal Results on Conflict-free Coloring
by: Bhyravarapu, Sriram, et al.
Published: (2023)

Orthogonal Latin Squares of Order Ten with Two Relations: A SAT Investigation
by: Bright, Curtis, et al.
Published: (2025)

Myrvold's Results on Orthogonal Triples of $10 \times 10$ Latin Squares: A SAT Investigation
by: Bright, Curtis, et al.
Published: (2025)

Introducing q-deformed binomial coefficients of words
by: Renard, Antoine, et al.
Published: (2024)

Maximal number of subword occurrences in a word
by: Fang, Wenjie
Published: (2024)

Digital Convexity and Combinatorics on Words
by: De Luca, Alessandro, et al.
Published: (2025)

On solving basic equations over the semiring of functional digraphs
by: Dennunzio, Alberto, et al.
Published: (2024)

Note on Min-k-Planar Drawings of Graphs
by: Hliněný, Petr, et al.
Published: (2024)

Hereditary Graph Product Structure and $\cal H$-clique-width
by: Hliněný, Petr, et al.
Published: (2024)

Polygonal corona limit on multigrid dual tilings
by: Lutfalla, Victor, et al.
Published: (2024)

Grid-drawings of graphs in three-dimensions
by: Balogh, Jozsef, et al.
Published: (2024)

Harmonious Colorings: bounds, heuristics and integer-linear formulations
by: Araújo, Júlio, et al.
Published: (2026)

Stack and Queue Numbers of Graphs Revisited
by: Hliněný, Petr, et al.
Published: (2023)

Stability properties for subgroups generated by return words
by: Gheeraert, France, et al.
Published: (2024)

Word-Representability of Graphs with respect to Split Recomposition
by: Dwary, Tithi, et al.
Published: (2024)

Obstructions to return preservation for episturmian morphisms
by: Berthé, Valérie, et al.
Published: (2024)

A simple algorithm for checking equivalence of counting functions on free monoids
by: Kiyashko, Petr, et al.
Published: (2024)

Visualizing Geophylogenies -- Internal and External Labeling with Phylogenetic Tree Constraints
by: Klawitter, Jonathan, et al.
Published: (2023)

Relative position in binary substitutions
by: Coons, Michael, et al.
Published: (2024)

On the rigidity of Arnoux-Rauzy words
by: Berthé, Valérie, et al.
Published: (2022)

Trifferent codes with small lengths
by: Kurz, Sascha
Published: (2023)

Circularity and repetitiveness in non-injective DF0L systems
by: Goulet-Ouellet, Herman, et al.
Published: (2025)

Towards Characterization of 5-List-Colorability of Toroidal Graphs
by: Dvořák, Zdeněk, et al.
Published: (2024)

Three-edge-coloring projective planar cubic graphs: A generalization of the Four Color Theorem
by: Inoue, Yuta, et al.
Published: (2024)

Graph theoretic and algorithmic aspect of the equitable coloring problem in block graphs
by: Furmańczyk, Hanna, et al.
Published: (2020)

Skip Letters for Short Supersequence of All Permutations
by: Tan, Oliver
Published: (2022)

From Historical Puzzles to Grammatical Constraints: Circular Partitions, Generalized Run-Length Encodings, and Polynomial-Time Decidability
by: Khormali, Omid, et al.
Published: (2026)