Algorithmic Aspects of Left-Orderings of Solvable Baumslag–Solitar Groups via its Dynamical Realization

Ho "Turbo", Meng-Che; Le, Khanh; Rossegger, Dino

doi:10.1007/978-3-031-64309-5_7

Datensatz Zitierlink:

http://hdl.handle.net/20.500.12708/208506
https://doi.org/10.34726/8205

Titel:

Algorithmic Aspects of Left-Orderings of Solvable Baumslag–Solitar Groups via its Dynamical Realization

Zitat:

Ho “Turbo,” M.-C., Le, K., & Rossegger, D. (2024). Algorithmic Aspects of Left-Orderings of Solvable Baumslag–Solitar Groups via its Dynamical Realization. In L. L. Patey, E. Pimentel, L. Galeotti, & F. Manea (Eds.), Twenty Years of Theoretical and Practical Synergies : 20th Conference on Computability in Europe, CiE 2024, Amsterdam, The Netherlands, July 8–12, 2024, Proceedings (pp. 72–84). Springer. https://doi.org/10.34726/8205

reposiTUm-DOI:

10.34726/8205

CatalogPlus:

AC17574862

Verlags-DOI:

10.1007/978-3-031-64309-5_7

Publikationstyp:

Konferenzbeitrag - Full-Paper Contribution

Sprache:

Englisch

Autor_innen:

Ho "Turbo", Meng-Che
Le, Khanh
Rossegger, Dino

Organisationseinheit:

E104-02 - Forschungsbereich Computational Logic

Erschienen in:

Twenty Years of Theoretical and Practical Synergies : 20th Conference on Computability in Europe, CiE 2024, Amsterdam, The Netherlands, July 8–12, 2024, Proceedings

ISBN:

978-3-031-64309-5

Band:

14773

Datum (veröffentlicht):

2024

Veranstaltungsname:

20th Conference on Computability in Europe

Veranstaltungszeitraum:

8-Jul-2024 - 12-Jul-2024

Veranstaltungsort:

Amsterdam, Niederlande (die)

Umfang:

Verlag:

Springer, Cham

Peer Reviewed:

Keywords:

group action; countable Borel equivalence relation; Baumslag Solitar groups; orderable groups; dynamical realization

Abstract:

We answer a question of Calderoni and Clay [4] by showing that the conjugation equivalence relation of left orderings of the Baumslag-Solitar groups BS(1,n) is hyperfinite for any n. Our proof relies on a classification of BS(1,n)’s left-orderings via its one-dimensional dynamical realizations. We furthermore use the effectiveness of the dynamical realizations of BS(1,n) to study algorithmic properties of the left-orderings on BS(1,n).

Projekttitel:

Algorithmische Komplexität von Strukturen und deren Äquivalenzrelationen: 101026834 (European Commission)

Forschungsschwerpunkte:

Mathematical and Algorithmic Foundations: 100%

Wissenschaftszweig:

1020 - Informatik: 5%
1010 - Mathematik: 95%

Lizenz:

Urheberrechtsschutz

Enthalten in den Sammlungen:

Conference Paper