2021/12/09 by Cheng-Chao Huang, Huang, Cheng-Chao
Computer Science · Mathematics · #Advanced Differential Equations and Dynamical Systems #Computational Complexity (cs.CC) #FOS: Computer and information sciences #FOS: Mathematics #Number Theory (math.NT) #Numerical Methods and Algorithms #Polynomial and algebraic computation #Symbolic Computation (cs.SC)
paper · pdf · doi:10.48550/arxiv.2112.05004
openalex publication_date 2021/12/09 · openalex created_date 2022/11/04 · openalex updated_date 2026/07/28
In this paper, we study linear forms \
lambda =\n
beta1
mathrme
alpha1+
cdots+
betam
mathrme
alpham, where\n\αi and \βi are algebraic numbers. An explicit lower bound for the\nabsolute value of \λ is proved, which is derived from "th 'eor `eme de\nLindemann--Weierstrass effectif" via constructive methods in algebraic\ncomputation. Besides, the existence of \λ with an explicit upper bound\nis established on the result of counting algebraic numbers.\n