Computability of dimension groups
International Journal of Algebra and Computation · 13.11.2026 · 1-27
DOI: 10.1142/s0218196726500682 ↗Kurz gefasst
Fachartikel in der Zeitschrift International Journal of Algebra and Computation, online erschienen am 13.11.2026. Verfasst von Maria Sabitova.
Abstract (Originalsprache)
We investigate the computability of the set [Formula: see text] of all isomorphisms between [Formula: see text] and [Formula: see text], where [Formula: see text] is a subgroup of [Formula: see text] generated by columns of integer powers of a non-singular [Formula: see text]-matrix [Formula: see text] with integer entries. Assuming that the characteristic polynomial of [Formula: see text] is irreducible — and under an additional condition when [Formula: see text] is not prime — we prove that [Formula: see text] is computable; that is, we provide an algorithm that determines the structure in finitely many steps. We also present illustrative examples.
Zitieren
APA
Sabitova, M. (2026). Computability of dimension groups. International Journal of Algebra and Computation, 1-27. https://doi.org/10.1142/s0218196726500682
Vancouver
Sabitova M. Computability of dimension groups. International Journal of Algebra and Computation. 2026:1-27. doi:10.1142/s0218196726500682
BibTeX
@article{Sabitova2026,
author = {Sabitova, Maria},
title = {Computability of dimension groups},
journal = {International Journal of Algebra and Computation},
year = {2026},
pages = {1--27},
doi = {10.1142/s0218196726500682}
}
EUVIMED