Decidability of multiplicative matrix equations and related Diophantine problems
Abstract
Some new decidability results for multiplicative matrix equations over algebraic number fields are established. In particular, special instances of the so-called knapsack problem are considered. The proofs are based on effective methods for Diophantine problems in finitely generated domains as presented in the recent book of Evertse and Gy\"ory. The focus lies on explicit bounds for the size of the solutions in terms of heights as well as on bounds for the number of solutions. This approach also works for systems of symmetric matrices which do not form a semigroup. In the final section some related counting problems are investigated.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.