Optimal factorizations of rational numbers using factorization trees
From MaRDI portal
Abstract: Let denote the -metric Mahler measure of the algebraic number . Recent work of the first author established that the infimum in is attained by a single point for all sufficiently large . Nevertheless, no efficient method for locating is known. In this article, we define a new tree data structure, called a factorization tree, which enables us to find when . We establish several basic properties of factorization trees, and use these properties to locate in previously unknown cases.
Recommendations
- Optimal factorizations of families of trees
- On recursive computation of coprime factorizations of rational matrices
- Optimal algorithm for algebraic factoring
- Asymptotically Fast Factorization of Integers
- A Rigorous Time Bound for Factoring Integers
- Computation of coprime factorizations of rational matrices
- An algorithm for factorization of matrices with rational elements
- scientific article; zbMATH DE number 3968702
- On some factorization problems
Cites work
- Factorization of certain cyclotomic functions
- Lehmer's problem for polynomials with odd coefficients
- On metric heights
- On the metric Mahler measure
- On the Product of the Conjugates outside the unit circle of an Algebraic Integer
- The t-metric Mahler measures of surds and rational numbers
- The parametrized family of metric Mahler measures
Cited in
(5)
This page was built for publication: Optimal factorizations of rational numbers using factorization trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5248575)