2000 character limit reached
Boyd's conjecture
Published 8 Jan 2014 in math.NT | (1401.1688v2)
Abstract: We determine the limit of the rate between the number of roots of the trinomial , , which are greater than 1 in modulus, and degree . The analogue of Boyd's Conjecture (C) for Perron numbers is a consequence of the limit, under the assumption that the conjecture of Lind-Boyd is valid. The product of these roots has also a limit when . The explicit expression of the limit by an integral is presented. The computing of the rate and the product for as well as of its limits is presented.
Paper Prompts
Sign up for free to create and run prompts on this paper.