Construction of Minkowski Sums by Cellular Automata
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910499720921088 |
|---|---|
| author | Tahay, Pierre-Adrien |
| author_facet | Tahay, Pierre-Adrien |
| contents | We give a construction in a column of a one-dimensional cellular automaton of the Minkowski sum of two sets which can themselves occur in columns of cellular automata. It enables us to obtain another construction of the set of integers that are sums of three squares, answering a question by the same author. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_16419 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Construction of Minkowski Sums by Cellular Automata Tahay, Pierre-Adrien Discrete Mathematics Formal Languages and Automata Theory F.1.1; F.2.1 We give a construction in a column of a one-dimensional cellular automaton of the Minkowski sum of two sets which can themselves occur in columns of cellular automata. It enables us to obtain another construction of the set of integers that are sums of three squares, answering a question by the same author. |
| title | Construction of Minkowski Sums by Cellular Automata |
| topic | Discrete Mathematics Formal Languages and Automata Theory F.1.1; F.2.1 |
| url | https://arxiv.org/abs/2406.16419 |