Digital Convexity and Combinatorics on Words
Fuente:
arXiv
Saved in:
| Main Authors: | De Luca, Alessandro, Fici, Gabriele, Frosini, Andrea |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Some Results on Digital Segments and Balanced Words
by: De Luca, Alessandro, et al.
Published: (2022)
by: De Luca, Alessandro, et al.
Published: (2022)
The Shortest Interesting Binary Words
by: Fici, Gabriele
Published: (2024)
by: Fici, Gabriele
Published: (2024)
Dorst-Smeulders Coding for Arbitrary Binary Words
by: De Luca, Alessandro, et al.
Published: (2025)
by: De Luca, Alessandro, et al.
Published: (2025)
The repetition threshold for ternary rich words
by: Currie, James D., et al.
Published: (2024)
by: Currie, James D., et al.
Published: (2024)
Avoiding abelian and additive powers in rich words
by: Andrade, Jonathan, et al.
Published: (2024)
by: Andrade, Jonathan, et al.
Published: (2024)
Group Actions and Some Combinatorics on Words with $\mathbf{vtm}$
by: Machacek, John
Published: (2025)
by: Machacek, John
Published: (2025)
Some Remarks on Palindromic Periodicities
by: Fici, Gabriele, et al.
Published: (2024)
by: Fici, Gabriele, et al.
Published: (2024)
Restivo Salemi property for $α$-power free languages with $α\geq 5$ and $k\geq 3$ letters
by: Rukavicka, Josef
Published: (2023)
by: Rukavicka, Josef
Published: (2023)
Generalized De Bruijn Words, Invertible Necklaces, and the Burrows-Wheeler Transform
by: Fici, Gabriele, et al.
Published: (2025)
by: Fici, Gabriele, et al.
Published: (2025)
From Historical Puzzles to Grammatical Constraints: Circular Partitions, Generalized Run-Length Encodings, and Polynomial-Time Decidability
by: Khormali, Omid, et al.
Published: (2026)
by: Khormali, Omid, et al.
Published: (2026)
Mapped Exponent and Asymptotic Critical Exponent of Words
by: Foster, Eva, et al.
Published: (2025)
by: Foster, Eva, et al.
Published: (2025)
A Connection Between Unbordered Partial Words and Sparse Rulers
by: Saarela, Aleksi, et al.
Published: (2024)
by: Saarela, Aleksi, et al.
Published: (2024)
Effective Computation of Generalized Abelian Complexity for Pisot Type Substitutive Sequences
by: Couvreur, Jean-Michel, et al.
Published: (2025)
by: Couvreur, Jean-Michel, et al.
Published: (2025)
Introducing q-deformed binomial coefficients of words
by: Renard, Antoine, et al.
Published: (2024)
by: Renard, Antoine, et al.
Published: (2024)
The reflection complexity of sequences over finite alphabets
by: Allouche, Jean-Paul, et al.
Published: (2024)
by: Allouche, Jean-Paul, et al.
Published: (2024)
Pseudoperiodic Words and a Question of Shevelev
by: Meleshko, Joseph, et al.
Published: (2022)
by: Meleshko, Joseph, et al.
Published: (2022)
Dyck Words, Pattern Avoidance, and Automatic Sequences
by: Mol, Lucas, et al.
Published: (2023)
by: Mol, Lucas, et al.
Published: (2023)
Morphisms and BWT-run Sensitivity
by: Fici, Gabriele, et al.
Published: (2025)
by: Fici, Gabriele, et al.
Published: (2025)
Unclustered BWTs of any Length over Non-Binary Alphabets
by: Fici, Gabriele, et al.
Published: (2025)
by: Fici, Gabriele, et al.
Published: (2025)
The Smallest String Attractors of Fibonacci and Period-Doubling Words
by: Banbara, Mutsunori, et al.
Published: (2026)
by: Banbara, Mutsunori, et al.
Published: (2026)
Clustering of return words in languages of interval exchanges
by: Dolce, Francesco, et al.
Published: (2025)
by: Dolce, Francesco, et al.
Published: (2025)
Low complexity binary words avoiding $(5/2)^+$-powers
by: Currie, James, et al.
Published: (2025)
by: Currie, James, et al.
Published: (2025)
Mapping words to powers by morphisms
by: Saarela, Aleksi
Published: (2025)
by: Saarela, Aleksi
Published: (2025)
Subword enumeration up to stack-sorting equivalence
by: Campbell, John M., et al.
Published: (2026)
by: Campbell, John M., et al.
Published: (2026)
Computing the k-binomial complexity of generalized Thue--Morse words
by: Golafshan, M., et al.
Published: (2024)
by: Golafshan, M., et al.
Published: (2024)
The Narayana Morphism and Related Words
by: Shallit, Jeffrey
Published: (2025)
by: Shallit, Jeffrey
Published: (2025)
Consecutive Power Occurrences in Sturmian Words
by: Bell, Jason, et al.
Published: (2024)
by: Bell, Jason, et al.
Published: (2024)
Self-Verifying Predicates in Büchi Arithmetic
by: Khodier, Mazen, et al.
Published: (2025)
by: Khodier, Mazen, et al.
Published: (2025)
Careful synchronisation and the diameter of transformation semigroups with few generators
by: Ryzhikov, Andrew
Published: (2025)
by: Ryzhikov, Andrew
Published: (2025)
The Repetition Threshold for Rote Sequences
by: Ollinger, Nicolas, et al.
Published: (2024)
by: Ollinger, Nicolas, et al.
Published: (2024)
String Attractors for Automatic Sequences
by: Schaeffer, Luke, et al.
Published: (2020)
by: Schaeffer, Luke, et al.
Published: (2020)
Some Fibonacci-Related Sequences
by: Cloitre, Benoit, et al.
Published: (2023)
by: Cloitre, Benoit, et al.
Published: (2023)
Runs in Paperfolding Sequences
by: Shallit, Jeffrey
Published: (2024)
by: Shallit, Jeffrey
Published: (2024)
Asymptotic bounds for the number of closed and privileged words
by: Gabric, Daniel
Published: (2022)
by: Gabric, Daniel
Published: (2022)
Linear Recurrence Sequence Automata and the Addition of Abstract Numeration Systems
by: Carton, Olivier, et al.
Published: (2024)
by: Carton, Olivier, et al.
Published: (2024)
On shortest products for nonnegative matrix mortality
by: Ryzhikov, Andrew
Published: (2024)
by: Ryzhikov, Andrew
Published: (2024)
Automatic Abelian Complexities of Parikh-Collinear Fixed Points
by: Rigo, Michel, et al.
Published: (2024)
by: Rigo, Michel, et al.
Published: (2024)
Banach density of generated languages: Dichotomies in topology and dimension
by: Kleinberg, Jon, et al.
Published: (2026)
by: Kleinberg, Jon, et al.
Published: (2026)
Repetition Threshold for Binary Automatic Sequences
by: Allouche, J. -P., et al.
Published: (2024)
by: Allouche, J. -P., et al.
Published: (2024)
Ten Squares Force an Overlap
by: Shallit, Jeffrey
Published: (2026)
by: Shallit, Jeffrey
Published: (2026)
Similar Items
-
Some Results on Digital Segments and Balanced Words
by: De Luca, Alessandro, et al.
Published: (2022) -
The Shortest Interesting Binary Words
by: Fici, Gabriele
Published: (2024) -
Dorst-Smeulders Coding for Arbitrary Binary Words
by: De Luca, Alessandro, et al.
Published: (2025) -
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)