Back to search

Institutional Repository of Vilnius University

The Explicit Isomorphism Problem on Global Fields /

Abstract

dc:description

This dissertation studies the algorithmic problem of finding isomorphisms to matrix algebras over a global field. Over number fields, a polynomial quantum algorithm is provided under the Generalised Riemann Hypothesis. This relies on computing a presentation of a central simple algebra using Amitsur cohomology. Then, finding an isomorphism to a matrix algebra is equivalent to solving a certain equation. This equation is solved by computing S-units in an extension of the base field. Over function fields, existing results for algebras over a rational function field are given a new interpretation using the language of vector bundles. An algorithmic theory of vector bundles over algebraic curves as pairs of lattices is developed. This suggests an approach for solving the isomorphism problem over function fields of higher genera.

Degree

thesis:*
Grantor dc:publisher
Institutional Repository of Vilnius University
Year dc:date
2025

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Montessinos, Mickael Gerard Bernard,
Contributors dc:contributor
  • Dubickas, Artūras

Subjects

dc:subject × 1

Rights

dc:rights
Statement dc:rights
  • info:eu-repo/semantics/openAccess
Language dc:language
eng

Identifiers

dc:identifier.*

Chain of custody

source
Harvested from
Vilnius University
Base URL
epublications.vu.lt/oai
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Montessinos, Mickael Gerard Bernard,. The Explicit Isomorphism Problem on Global Fields /. Institutional Repository of Vilnius University, 2025. https://repository.vu.lt/VU:ELABAETD222743134&prefLang=en_US