{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/a-kit-for-linear-forms-in-three-logarithms","title":"A kit for linear forms in three logarithms","arxiv_id":"2205.08899","date":"2022-05-18","proceeding":null,"authors":["Maurice Mignotte","Paul Voutier"],"abstract":"We provide a technique to obtain explicit bounds for problems that can be reduced to linear forms in three complex logarithms of algebraic numbers. This technique can produce bounds significantly better than general results on lower bounds for linear forms in logarithms. We give worked examples to demonstrate both the use of our technique and the improvements it provides. Publicly shared code is also available.","url_abs":"https://arxiv.org/abs/2205.08899v3","url_pdf":"https://arxiv.org/pdf/2205.08899v3.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"links_only","authors_date_abstract":"arXiv metadata, CC0 1.0 (https://info.arxiv.org/help/license), from the Kaggle arXiv metadata snapshot of 2026-09-12"},"code_links":[{"paper_slug":"a-kit-for-linear-forms-in-three-logarithms","repo_url":"https://github.com/pjcazorla/differences-between-perfect-and-prime-powers","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}