Sets of Linear Forms Which Are Hard to Compute
Michael Kaminski, Igor E. Shparlinski · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2021
We present a uniform description of sets of m linear forms in n variables over the field of rational numbers whose computation requires m(n - 1) additions. Our result is based on bounds on the height of the annihilating polynomials in the Perron theorem and an effective form of the Lindemann-Weierstrass theorem which is due to Sert (1999).