Careful synchronisation and the diameter of transformation semigroups with few generators
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912433596006400 |
|---|---|
| author | Ryzhikov, Andrew |
| author_facet | Ryzhikov, Andrew |
| contents | A word is called carefully synchronising for a partial deterministic finite semi-automaton if it maps all states to the same state. Equivalently, it is a composition of partial transformations equal to a constant total transformation. There is a sequence of several papers providing stronger and stronger lower bounds on the length of shortest carefully synchronising words for $n$-state partial DFAs over small alphabets. It resulted in the lower bounds of $Ω(\frac{2^{n/3}}{n\sqrt{n}})$ and $Ω(\frac{4^{n/5}}{n})$ for alphabets of two and three letters respectively, obtained by de Bondt, Don, and Zantema. Using a significantly simpler construction, we improve these lower bounds to $2^{(n - 4)/3}$ and $4^{(n - 4)/5}$ respectively.
We then consider a tightly related question of the diameter of a partial DFA, which is the smallest $\ell \ge 0$ such that words of length at most $\ell$ express all the transformations induced by words in this DFA. We show that an alphabet of large enough constant size already asymptotically matches the upper bound on the diameter for arbitrary alphabet size, extending the construction of Panteleev that requires an alphabet of size exponential in the number of states. We then discuss an application to the diameter of finite semigroups of nonnegative matrices, and some open problems. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_13962 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Careful synchronisation and the diameter of transformation semigroups with few generators Ryzhikov, Andrew Discrete Mathematics Formal Languages and Automata Theory Combinatorics A word is called carefully synchronising for a partial deterministic finite semi-automaton if it maps all states to the same state. Equivalently, it is a composition of partial transformations equal to a constant total transformation. There is a sequence of several papers providing stronger and stronger lower bounds on the length of shortest carefully synchronising words for $n$-state partial DFAs over small alphabets. It resulted in the lower bounds of $Ω(\frac{2^{n/3}}{n\sqrt{n}})$ and $Ω(\frac{4^{n/5}}{n})$ for alphabets of two and three letters respectively, obtained by de Bondt, Don, and Zantema. Using a significantly simpler construction, we improve these lower bounds to $2^{(n - 4)/3}$ and $4^{(n - 4)/5}$ respectively. We then consider a tightly related question of the diameter of a partial DFA, which is the smallest $\ell \ge 0$ such that words of length at most $\ell$ express all the transformations induced by words in this DFA. We show that an alphabet of large enough constant size already asymptotically matches the upper bound on the diameter for arbitrary alphabet size, extending the construction of Panteleev that requires an alphabet of size exponential in the number of states. We then discuss an application to the diameter of finite semigroups of nonnegative matrices, and some open problems. |
| title | Careful synchronisation and the diameter of transformation semigroups with few generators |
| topic | Discrete Mathematics Formal Languages and Automata Theory Combinatorics |
| url | https://arxiv.org/abs/2506.13962 |