arXiv · 2506.03932
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.
Explore related subjects
Keep this discovery
Sebastian Heintze, Armand Noubissie, Robert F. Tichy. 2025-06-04. Decidability of multiplicative matrix equations and related Diophantine problems. https://doi.org/10.2140/cnt.2025.14.251
Cite the original work for its findings. Save a collection to share your selection of sources.