Crossref
On the factor complexity associated with a family of multidimensional continued fraction algorithms
Combinatorics and Number Theory · 13.11.2026 · 15 (4) · 239-292
DOI: 10.2140/cnt.2026.15.239 ↗Kurz gefasst
Fachartikel in der Zeitschrift Combinatorics and Number Theory, online erschienen am 13.11.2026. Verfasst von Thomas Garrity und 1 weiteren Autor:innen. Die Arbeit nennt 35 Literaturangaben.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
Garrity, T., & Osterman, O. V. (2026). On the factor complexity associated with a family of multidimensional continued fraction algorithms. Combinatorics and Number Theory, 15(4), 239-292. https://doi.org/10.2140/cnt.2026.15.239
Vancouver
Garrity T, Osterman OV. On the factor complexity associated with a family of multidimensional continued fraction algorithms. Combinatorics and Number Theory. 2026;15(4):239-292. doi:10.2140/cnt.2026.15.239
BibTeX
@article{Garrity2026,
author = {Garrity, Thomas and Osterman, Otto Vaughn},
title = {On the factor complexity associated with a family of multidimensional continued fraction algorithms},
journal = {Combinatorics and Number Theory},
year = {2026},
volume = {15},
number = {4},
pages = {239--292},
doi = {10.2140/cnt.2026.15.239}
}
EUVIMED