Papers
Topics
Authors
Recent
Search
2000 character limit reached

Bounds for zeros of Collatz polynomials, with necessary and sufficient strictness conditions

Published 14 Dec 2020 in math.CV | (2012.08006v4)

Abstract: In a previous paper, we introduced the Collatz polynomials $P_N(z)$, whose coefficients are the terms of the Collatz sequence of the positive integer $N$. Our work in this paper expands on our previous results, using the Enestr\"om-Kakeya Theorem to tighten our old bounds of the roots of $P_N(z)$ and giving precise conditions under which these new bounds are sharp. In particular, we confirm an experimental result that zeros on the circle ${z\in\mathbb{C}: |z| = 2}$ are rare: the set of $N$ such that $P_N(z)$ has a root of modulus 2 is sparse in the natural numbers. We close with some questions for further study.

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.