Saved in:
| Main Authors: | Bui, Vuong, Rosenfeld, Matthieu |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2512.03670 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
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)
An explicit condition for boundedly supermultiplicative subshifts
by: Bui, Vuong, et al.
Published: (2024)
by: Bui, Vuong, et al.
Published: (2024)
The complexity of finite smooth words over binary alphabets
by: Cassaigne, Julien, et al.
Published: (2026)
by: Cassaigne, Julien, et al.
Published: (2026)
Orientable sequences over non-binary alphabets
by: Alhakim, Abbas, et al.
Published: (2024)
by: Alhakim, Abbas, et al.
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)
Local obstructions in sequences revisited
by: Rosenfeld, Matthieu, et al.
Published: (2025)
by: Rosenfeld, Matthieu, et al.
Published: (2025)
A convolutional approach to bounding the number of polyominoes
by: Bui, Vuong
Published: (2025)
by: Bui, Vuong
Published: (2025)
A characterization of the Carathéodory number for $H$-convexity
by: Bui, Vuong
Published: (2025)
by: Bui, Vuong
Published: (2025)
A short proof of an upper bound on the growth constant of polyiamonds
by: Bui, Vuong
Published: (2025)
by: Bui, Vuong
Published: (2025)
Growth of bilinear maps III: Decidability
by: Bui, Vuong
Published: (2022)
by: Bui, Vuong
Published: (2022)
An asymptotic lower bound on the number of polyominoes
by: Bui, Vuong
Published: (2022)
by: Bui, Vuong
Published: (2022)
Growth of recurrences with mixed multifold convolutions
by: Bui, Vuong
Published: (2024)
by: Bui, Vuong
Published: (2024)
Reduced complexities for sequences over finite alphabets
by: Campbell, John M., et al.
Published: (2025)
by: Campbell, John M., et al.
Published: (2025)
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)
Explicit entropy bounds for symmetric nearest-neighbor subshifts
by: Bui, Vuong
Published: (2026)
by: Bui, Vuong
Published: (2026)
Hadwiger's conjecture holds for strongly monotypic polytopes
by: Bui, Vuong
Published: (2024)
by: Bui, Vuong
Published: (2024)
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)
On the number of words of $N=3 \,n$ letters with a three-letter alphabet
by: Serra, Pablo
Published: (2025)
by: Serra, Pablo
Published: (2025)
Words avoiding the morphic images of most of their factors
by: Ochem, Pascal, et al.
Published: (2025)
by: Ochem, Pascal, et al.
Published: (2025)
The reflection complexity of sequences over finite alphabets
by: Allouche, Jean-Paul, et al.
Published: (2024)
by: Allouche, Jean-Paul, et al.
Published: (2024)
The number of polyiamonds is supermultiplicative
by: Bui, Vuong
Published: (2023)
by: Bui, Vuong
Published: (2023)
Every generating polytope is strongly monotypic
by: Bui, Vuong
Published: (2022)
by: Bui, Vuong
Published: (2022)
Bounding Klarner's constant from above using a simple recurrence
by: Bui, Vuong
Published: (2024)
by: Bui, Vuong
Published: (2024)
A bound on the joint spectral radius using the diagonals
by: Bui, Vuong
Published: (2020)
by: Bui, Vuong
Published: (2020)
A topological version of Hedetniemi's conjecture for equivariant spaces
by: Bui, Vuong, et al.
Published: (2023)
by: Bui, Vuong, et al.
Published: (2023)
Growth of bilinear maps II: Bounds and orders
by: Bui, Vuong
Published: (2021)
by: Bui, Vuong
Published: (2021)
A note on cube-free problems
by: Meng, Yuchen
Published: (2023)
by: Meng, Yuchen
Published: (2023)
On the complexity of subshifts and infinite words
by: Greenfeld, Be'eri, et al.
Published: (2024)
by: Greenfeld, Be'eri, et al.
Published: (2024)
There are infinitely many Hilbert cubes of dimension 3 in the set of squares
by: Bremner, Andrew, et al.
Published: (2026)
by: Bremner, Andrew, et al.
Published: (2026)
The mapping index through the lens of the cross-index
by: Bui, Vuong, et al.
Published: (2026)
by: Bui, Vuong, et al.
Published: (2026)
Inequalities in Fourier analysis on binary cubes
by: Crmarić, Tonći, et al.
Published: (2025)
by: Crmarić, Tonći, et al.
Published: (2025)
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)
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)
On existence of a compatible triangulation with the double circle order type
by: Bui, Hong Duc
Published: (2025)
by: Bui, Hong Duc
Published: (2025)
$p$-th order generalized Fibonacci cubes and maximal cubes in Fibonacci $p$-cubes
by: Mollard, Michel
Published: (2025)
by: Mollard, Michel
Published: (2025)
Asymptotically half of binary words are shuffle squares
by: He, Xiaoyu, et al.
Published: (2025)
by: He, Xiaoyu, et al.
Published: (2025)
Similar Items
-
Pairs of square-free arithmetic progressions in infinite words
by: Delépine, Thomas, et al.
Published: (2026) -
An explicit condition for boundedly supermultiplicative subshifts
by: Bui, Vuong, et al.
Published: (2024) -
The complexity of finite smooth words over binary alphabets
by: Cassaigne, Julien, et al.
Published: (2026) -
Orientable sequences over non-binary alphabets
by: Alhakim, Abbas, et al.
Published: (2024) -
Finding lower bounds on the growth and entropy of subshifts over countable groups
by: Rosenfeld, Matthieu
Published: (2022)