EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

On the uniform word problem for lattices

C. J. Van Alten

Algebra universalis · 2026-05 · 87 (2)

DOI: 10.1007/s00012-026-00930-1 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Algebra universalis, online erschienen am 03.04.2026. Verfasst von C. J. Van Alten. Die Arbeit nennt 13 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: University of the Witwatersrand.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

An algorithm that decides the uniform word problem for lattices is given and shown to have $$O(n^3)$$ O ( n 3 ) running-time, which also gives an $$O(n^3)$$ O ( n 3 ) algorithm for the quasi-equational theory of lattices. This result continues a long sequence of algorithms for this problem, starting with Skolem in 1920. The algorithm makes use of Cosmadakis’ algorithm for the uniform word problem and Freese’s algorithm for the word problem for free lattices.

Förderung

  • University of the Witwatersrand

Zitieren

APA

Alten, C. J. V. (2026). On the uniform word problem for lattices. Algebra universalis, 87(2). https://doi.org/10.1007/s00012-026-00930-1

Vancouver

Alten CJV. On the uniform word problem for lattices. Algebra universalis. 2026;87(2). doi:10.1007/s00012-026-00930-1

BibTeX
@article{Alten2026,
  author = {Alten, C. J. Van},
  title = {On the uniform word problem for lattices},
  journal = {Algebra universalis},
  year = {2026},
  volume = {87},
  number = {2},
  doi = {10.1007/s00012-026-00930-1}
}
Kostenlos starten →