Explicit affine formulas for distances between tuples in classical discrete structures
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912952130469888 |
|---|---|
| author | Molina-Mounier, Arthur |
| author_facet | Molina-Mounier, Arthur |
| contents | Answering a question of Ben Yaacov, Ibarlucía, and Tsankov [5], we show an explicit way to construct an affine formula for the distance between two $n$-tuples in a $\{0,1\}$-valued $\varnothing$-structure, using $\lceil \log_2 n \rceil$ quantifier alternations. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_07623 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Explicit affine formulas for distances between tuples in classical discrete structures Molina-Mounier, Arthur Logic 03C66 Answering a question of Ben Yaacov, Ibarlucía, and Tsankov [5], we show an explicit way to construct an affine formula for the distance between two $n$-tuples in a $\{0,1\}$-valued $\varnothing$-structure, using $\lceil \log_2 n \rceil$ quantifier alternations. |
| title | Explicit affine formulas for distances between tuples in classical discrete structures |
| topic | Logic 03C66 |
| url | https://arxiv.org/abs/2603.07623 |