Saved in:
| Main Authors: | Delépine, Thomas, Ochem, Pascal, Rosenfeld, Matthieu |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2605.29853 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Words avoiding the morphic images of most of their factors
by: Ochem, Pascal, et al.
Published: (2025)
by: Ochem, Pascal, et al.
Published: (2025)
There exist infinite cube-free words over any sequence of binary alphabets
by: Bui, Vuong, et al.
Published: (2025)
by: Bui, Vuong, et al.
Published: (2025)
More characterizations of morphic words
by: Badkobeh, Golnaz, et al.
Published: (2023)
by: Badkobeh, Golnaz, et al.
Published: (2023)
Critical exponent of ternary words with few distinct palindromes
by: Dvořáková, Ľubomíra, et al.
Published: (2025)
by: Dvořáková, Ľubomíra, et al.
Published: (2025)
Critical exponent of binary words with few distinct palindromes
by: Dvořáková, L'ubomíra, et al.
Published: (2023)
by: Dvořáková, L'ubomíra, et al.
Published: (2023)
Between proper and square coloring of planar graphs, hardness and extremal graphs
by: Delépine, Thomas
Published: (2026)
by: Delépine, Thomas
Published: (2026)
Half-flips are 5-avoidable
by: Ochem, Pascal
Published: (2026)
by: Ochem, Pascal
Published: (2026)
4-tangrams are 4-avoidable
by: Ochem, Pascal, et al.
Published: (2025)
by: Ochem, Pascal, et al.
Published: (2025)
Contact graphs of boxes with unidirectional contacts
by: Gonçalves, Daniel, et al.
Published: (2023)
by: Gonçalves, Daniel, et al.
Published: (2023)
Finding lower bounds on the growth and entropy of subshifts over countable groups
by: Rosenfeld, Matthieu
Published: (2022)
by: Rosenfeld, Matthieu
Published: (2022)
Upper bounds on the average edit distance between two random strings
by: Rosenfeld, Matthieu
Published: (2024)
by: Rosenfeld, Matthieu
Published: (2024)
On Vizing's problem for triangle-free graphs
by: Kang, Ross J., et al.
Published: (2023)
by: Kang, Ross J., et al.
Published: (2023)
The lonely runner conjecture holds for eight runners
by: Rosenfeld, Matthieu
Published: (2025)
by: Rosenfeld, Matthieu
Published: (2025)
The lonely runner conjecture holds for nine runners
by: Rosenfeld, Matthieu
Published: (2025)
by: Rosenfeld, Matthieu
Published: (2025)
The Kelley--Meka bounds for sets free of three-term arithmetic progressions
by: Bloom, Thomas F., et al.
Published: (2023)
by: Bloom, Thomas F., et al.
Published: (2023)
Packing arithmetic progressions
by: Alon, Noga, et al.
Published: (2026)
by: Alon, Noga, et al.
Published: (2026)
An explicit condition for boundedly supermultiplicative subshifts
by: Bui, Vuong, et al.
Published: (2024)
by: Bui, Vuong, et al.
Published: (2024)
Local obstructions in sequences revisited
by: Rosenfeld, Matthieu, et al.
Published: (2025)
by: Rosenfeld, Matthieu, et al.
Published: (2025)
Supersimplicity and arithmetic progressions
by: Martin-Pizarro, Amador, et al.
Published: (2025)
by: Martin-Pizarro, Amador, et al.
Published: (2025)
Discrepancy in modular arithmetic progressions
by: Fox, Jacob, et al.
Published: (2021)
by: Fox, Jacob, et al.
Published: (2021)
Upper tails for arithmetic progressions revisited
by: Harel, Matan, et al.
Published: (2024)
by: Harel, Matan, 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)
On the complexity of subshifts and infinite words
by: Greenfeld, Be'eri, et al.
Published: (2024)
by: Greenfeld, Be'eri, et al.
Published: (2024)
Abundance of arithmetic progressions in $\mathcal{CR}$-sets
by: De, Dibyendu, et al.
Published: (2022)
by: De, Dibyendu, et al.
Published: (2022)
Monochromatic arithmetic progressions in the Fibonacci, Thue-Morse, and Rudin-Shapiro words
by: Joshi, Gandhar, et al.
Published: (2025)
by: Joshi, Gandhar, et al.
Published: (2025)
Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs
by: Bok, Jan, et al.
Published: (2020)
by: Bok, Jan, et al.
Published: (2020)
Asymptotically half of binary words are shuffle squares
by: He, Xiaoyu, et al.
Published: (2025)
by: He, Xiaoyu, et al.
Published: (2025)
A note on arithmetic progressions with restricted differences
by: Conlon, David, et al.
Published: (2026)
by: Conlon, David, et al.
Published: (2026)
Improved bounds for five-term arithmetic progressions
by: Leng, James, et al.
Published: (2023)
by: Leng, James, et al.
Published: (2023)
Finding arithmetic progressions in dense sets of integers
by: Peluse, Sarah
Published: (2025)
by: Peluse, Sarah
Published: (2025)
On quotients of numerical semigroups for almost arithmetic progressions
by: Liu, Feihu
Published: (2023)
by: Liu, Feihu
Published: (2023)
Bounds on the closed-rich constant of infinite words
by: Maity, Anuran, et al.
Published: (2026)
by: Maity, Anuran, et al.
Published: (2026)
Palindromic length of infinite aperiodic words
by: Rukavicka, Josef
Published: (2024)
by: Rukavicka, Josef
Published: (2024)
String attractors and bi-infinite words
by: Béaur, Pierre, et al.
Published: (2024)
by: Béaur, Pierre, et al.
Published: (2024)
An inverse theorem for generalized arithmetic progression with mild multiplicative property
by: Croot, Ernie, et al.
Published: (2024)
by: Croot, Ernie, et al.
Published: (2024)
Complexity and recurrence in infinite words and related structures
by: Greenfeld, Be'eri, et al.
Published: (2025)
by: Greenfeld, Be'eri, et al.
Published: (2025)
Antisquares and Critical Exponents
by: Baranwal, Aseem, et al.
Published: (2022)
by: Baranwal, Aseem, et al.
Published: (2022)
Asymptotics of partition parts in arithmetic progressions
by: Bringmann, Kathrin, et al.
Published: (2025)
by: Bringmann, Kathrin, et al.
Published: (2025)
On the partition regularity of arithmetic progressions and linear equations in k-IP-sets
by: Giordano, Raphaël
Published: (2025)
by: Giordano, Raphaël
Published: (2025)
On $P$-crucial square-free permutations
by: Valyuzhenich, Alexandr
Published: (2025)
by: Valyuzhenich, Alexandr
Published: (2025)
Similar Items
-
Words avoiding the morphic images of most of their factors
by: Ochem, Pascal, et al.
Published: (2025) -
There exist infinite cube-free words over any sequence of binary alphabets
by: Bui, Vuong, et al.
Published: (2025) -
More characterizations of morphic words
by: Badkobeh, Golnaz, et al.
Published: (2023) -
Critical exponent of ternary words with few distinct palindromes
by: Dvořáková, Ľubomíra, et al.
Published: (2025) -
Critical exponent of binary words with few distinct palindromes
by: Dvořáková, L'ubomíra, et al.
Published: (2023)