A polynomial time test to detect numbers with many exceptional points

DOI10.1142/S1793042121500184zbMath1475.11189arXiv2111.01002WikidataQ114071940 ScholiaQ114071940MaRDI QIDQ4992592

Ryan Carpenter, Charles L. Samuels

Publication date: 9 June 2021

Published in: International Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2111.01002

zbMATH Keywords

Mahler measurelinear optimizationexceptional pointsmetric Mahler measure

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Heights (11G50) PV-numbers and generalizations; other special algebraic numbers; Mahler measure (11R06) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Cites Work

• Unnamed Item
• Continued fraction expansions in connection with the metric Mahler measure
• The parametrized family of metric Mahler measures
• Linear and nonlinear programming.
• Counting exceptional points for rational numbers associated to the Fibonacci sequence
• Factorization of certain cyclotomic functions
• On metric heights
• A lower bound for the height in abelian extensions
• Linear programming. Foundations and extensions.
• Lehmer's problem for polynomials with odd coefficients
• Metric heights on an abelian group
• A collection of metric Mahler measures
• The Infimum in the Metric Mahler Measure
• On a question of Lehmer and the number of irreducible factors of a polynomial
• An effective lower bound for the height of algebraic numbers
• On the product of the conjugates outside the unit circle of an algebraic number
• On the Product of the Conjugates outside the unit circle of an Algebraic Integer
• On the metric Mahler measure

This page was built for publication: A polynomial time test to detect numbers with many exceptional points