Complexity of finite Borel asymptotic dimension
We show that the set of locally finite Borel graphs with finite Borel asymptotic dimension is $\boldsymbol {\Sigma }^1_2$ -complete. The result is based on a combinatorial characterization of finite Borel asymptotic dimension for graphs generated by a single Borel function. As an application o...
Tallennettuna:
| Päätekijät: | , |
|---|---|
| Aineistotyyppi: | Artigo |
| Kieli: | Inglês |
| Julkaistu: |
Cambridge University Press
2026-01-01
|
| Sarja: | Forum of Mathematics, Sigma |
| Aiheet: | |
| Linkit: | https://www.cambridge.org/core/product/identifier/S2050509426101807/type/journal_article |
| Tagit: |
Ei tageja, Lisää ensimmäinen tagi!
|