Saved in:
| Main Authors: | Ochem, Pascal, Rosenfeld, Matthieu |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2506.13368 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
More characterizations of morphic words
by: Badkobeh, Golnaz, et al.
Published: (2023)
by: Badkobeh, Golnaz, et al.
Published: (2023)
Pairs of square-free arithmetic progressions in infinite words
by: Delépine, Thomas, et al.
Published: (2026)
by: Delépine, Thomas, et al.
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)
Pseudoperiodic Words and a Question of Shevelev
by: Meleshko, Joseph, et al.
Published: (2022)
by: Meleshko, Joseph, et al.
Published: (2022)
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)
Contact graphs of boxes with unidirectional contacts
by: Gonçalves, Daniel, et al.
Published: (2023)
by: Gonçalves, Daniel, et al.
Published: (2023)
Letter frequency vs factor frequency in pure morphic words
by: Li, Shuo
Published: (2024)
by: Li, Shuo
Published: (2024)
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)
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)
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)
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)
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)
The characteristic sequence of the integers that are the sum of two squares is not morphic
by: Li, Shuo
Published: (2024)
by: Li, Shuo
Published: (2024)
A $σ$-morphic convex protoset
by: Džuklevski, Aleksa
Published: (2025)
by: Džuklevski, Aleksa
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)
On Vizing's problem for triangle-free graphs
by: Kang, Ross J., et al.
Published: (2023)
by: Kang, Ross J., et al.
Published: (2023)
Antisquares and Critical Exponents
by: Baranwal, Aseem, et al.
Published: (2022)
by: Baranwal, Aseem, et al.
Published: (2022)
Chvátal-Erdős condition for 2-factors with at most two components in graphs
by: Tian, Tao, et al.
Published: (2026)
by: Tian, Tao, et al.
Published: (2026)
Tight Toughness and Isolated Toughness for $\{K_2,C_n\}$-factor critical avoidable graph
by: Guan, Xiaxia, et al.
Published: (2024)
by: Guan, Xiaxia, et al.
Published: (2024)
Matchings avoiding ordered patterns
by: Barát, János, et al.
Published: (2025)
by: Barát, János, et al.
Published: (2025)
Pattern avoidance and the fundamental bijection
by: Archer, Kassie, et al.
Published: (2024)
by: Archer, Kassie, et al.
Published: (2024)
Permutations that strongly avoid 132
by: Archer, Kassie, et al.
Published: (2026)
by: Archer, Kassie, et al.
Published: (2026)
Removal paths avoiding vertices
by: Qi, Yuzhen, et al.
Published: (2024)
by: Qi, Yuzhen, et al.
Published: (2024)
Color-avoiding connected colorings and orientations
by: Pintér, József, et al.
Published: (2025)
by: Pintér, József, et al.
Published: (2025)
Color-avoiding directed paths in tournaments
by: Fox, Jacob, et al.
Published: (2025)
by: Fox, Jacob, et al.
Published: (2025)
Pattern avoidance in revised ascent sequences
by: Zhou, Robin D. P.
Published: (2025)
by: Zhou, Robin D. P.
Published: (2025)
Binary operations on pattern-avoiding cycles
by: Archer, Kassie, et al.
Published: (2025)
by: Archer, Kassie, et al.
Published: (2025)
Pattern avoidance in compositions and powers of permutations
by: Archer, Kassie, et al.
Published: (2025)
by: Archer, Kassie, et al.
Published: (2025)
On the importance sampling of self-avoiding walks
by: Bousquet-Mélou, Mireille
Published: (2011)
by: Bousquet-Mélou, Mireille
Published: (2011)
Weakly directed self-avoiding walks
by: Bacher, Axel, et al.
Published: (2010)
by: Bacher, Axel, et al.
Published: (2010)
Inversion sequences avoiding the pattern 010
by: Testart, Benjamin
Published: (2022)
by: Testart, Benjamin
Published: (2022)
List-avoiding orientations
by: Bradshaw, Peter, et al.
Published: (2022)
by: Bradshaw, Peter, et al.
Published: (2022)
Hypertree shrinking avoiding low degree vertices
by: Hylasová, Karolína, et al.
Published: (2024)
by: Hylasová, Karolína, et al.
Published: (2024)
Max-tree for d-permutations and pattern avoidance
by: Muller, Thomas
Published: (2026)
by: Muller, Thomas
Published: (2026)
On the permutations that strongly avoid the pattern 312 or 231
by: Pan, Junyao, et al.
Published: (2024)
by: Pan, Junyao, et al.
Published: (2024)
On the size of sets avoiding a general structure
by: Wang, Runze
Published: (2024)
by: Wang, Runze
Published: (2024)
Similar Items
-
More characterizations of morphic words
by: Badkobeh, Golnaz, et al.
Published: (2023) -
Pairs of square-free arithmetic progressions in infinite words
by: Delépine, Thomas, et al.
Published: (2026) -
Half-flips are 5-avoidable
by: Ochem, Pascal
Published: (2026) -
4-tangrams are 4-avoidable
by: Ochem, Pascal, et al.
Published: (2025) -
Pseudoperiodic Words and a Question of Shevelev
by: Meleshko, Joseph, et al.
Published: (2022)