Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Critical exponent of ...
Article

Critical exponent of ternary words with few distinct palindromes

Ľubomíra Dvořáková (1), Lucas Mol (2), Pascal Ochem (3)
(1) Czech Technical University in Prague [ČVUT]
(2) Thompson Rivers University [TRU]
(3) Laboratoire d'Informatique, de Robotique et de Microélectronique de Montpellier [LIRMM]
Download article
Open on arXiv
Submitted on
July 29, 2025
Accepted on
March 19, 2026
Published on
March 30, 2026
Last modified on
March 30, 2026
Volume 28
vol. 28:2
Combinatorics
DOI
10.46298/dmtcs.16125
License
Attribution 4.0 International (CC BY 4.0)
Indicators
335
Views
362
Downloads

Critical exponent of ternary words with few distinct palindromes

Ľubomíra Dvořáková (1), Lucas Mol (2), Pascal Ochem (3)
(1) Czech Technical University in Prague [ČVUT]
(2) Thompson Rivers University [TRU]
(3) Laboratoire d'Informatique, de Robotique et de Microélectronique de Montpellier [LIRMM]
Abstract
We study infinite ternary words that contain few distinct palindromes. In particular, we classify such words according to their critical exponent.
Keywords
  • Combinatorics
Preview
Loading PDF preview...