ﻻ يوجد ملخص باللغة العربية
The Collatz Conjecture (also known as the 3x+1 Problem) proposes that the following algorithm will, after a certain number of iterations, always yield the number 1: given a natural number, multiply by three and add one if the number is odd, halve the resulting number, then repeat. In this article, for each $N$ for which the Collatz Conjecture holds we define the $N^{th}$ Collatz polynomial to be the monic polynomial with constant term $N$ and $k^{th}$ term (for $k > 1$) the $k^{th}$ iterate of $N$ under the Collatz function. In particular, we bound the moduli of the roots of these polynomials, prove theorems on when they have rational integer roots, and suggest further applications and avenues of research.
In a previous work, we introduced the Collatz polynomials; these are the polynomials $left[P_N(z)right]_{Ninmathbb{N}}$ such that $left[z^0right]P_N = N$ and $left[z^{k+1}right]P_N = cleft(left[z^kright]P_Nright)$, where $c:mathbb{N}rightarrow mathbb
Period polynomials have long been fruitful tools for the study of values of $L$-functions in the context of major outstanding conjectures. In this paper, we survey some facets of this study from the perspective of Eichler cohomology. We discuss ways
In recent years, a number of papers have been devoted to the study of roots of period polynomials of modular forms. Here, we study cohomological analogues of the Eichler-Shimura period polynomials corresponding to higher $L$-derivatives. We state gen
Let $x_1$ and $x_k$ be the least and the largest zeros of the Laguerre or Jacobi polynomial of degree $k.$ We shall establish sharp inequalities of the form $x_1 <A, x_k >B,$ which are uniform in all the parameters involved. Together with inequalitie
The Collatz conjecture is explored using polynomials based on a binary numeral system. It is shown that the degree of the polynomials, on average, decreases after a finite number of steps of the Collatz operation, which provides a weak proof of the c