Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
149 tokens/sec
GPT-4o
9 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Computation of lattice isomorphisms and the integral matrix similarity problem (2202.03526v3)

Published 7 Feb 2022 in math.NT, math.GR, and math.RA

Abstract: Let $K$ be a number field, let $A$ be a finite-dimensional $K$-algebra, let $\mathrm{J}(A)$ denote the Jacobson radical of $A$, and let $\Lambda$ be an $\mathcal{O}{K}$-order in $A$. Suppose that each simple component of the semisimple $K$-algebra $A/{\mathrm{J}(A)}$ is isomorphic to a matrix ring over a field. Under this hypothesis on $A$, we give an algorithm that given two $\Lambda$-lattices $X$ and $Y$, determines whether $X$ and $Y$ are isomorphic, and if so, computes an explicit isomorphism $X \rightarrow Y$. This algorithm reduces the problem to standard problems in computational algebra and algorithmic algebraic number theory in polynomial time. As an application, we give an algorithm for the following long-standing problem: given a number field $K$, a positive integer $n$ and two matrices $A,B \in \mathrm{Mat}{n}(\mathcal{O}{K})$, determine whether $A$ and $B$ are similar over $\mathcal{O}{K}$, and if so, return a matrix $C \in \mathrm{GL}{n}(\mathcal{O}{K})$ such that $B= CAC{-1}$. We give explicit examples that show that the implementation of the latter algorithm for $\mathcal{O}_{K}=\mathbb{Z}$ vastly outperforms implementations of all previous algorithms, as predicted by our complexity analysis.

Summary

We haven't generated a summary for this paper yet.