Search arXiv⌕ Search

arXiv · 2610.14080

Zeros and Their Distribution for Leonardo Polynomials

Abstract

We investigate the zeros of Leonardo polynomials and their distribution in the complex plane. We show that the structure of the zeros differs between even and odd degrees. For even degrees, all zeros are simple and purely imaginary, with imaginary parts lying in \((-2,2)\). For odd degrees, there is exactly one positive real zero, whereas no negative real or purely imaginary zeros occur. We obtain two-sided bounds for the unique positive real zero, prove that it decreases strictly to zero as the degree increases through odd values, and determine its asymptotic behavior. Using the relation between Leonardo and Fibonacci polynomials together with a complex trigonometric parametrization, we transform the zero equation into a family of fixed-point problems. Suitable invariant disks are constructed, and the corresponding mappings are shown to be contractions. This yields a constructive description of the complete zero set, proves the simplicity of all zeros, and provides geometrically convergent iterations for their numerical approximation. The method also provides explicit control over the approximation error. Finally, we establish a degree-dependent vertical strip containing all zeros and show that its width tends to zero as the degree increases. Consequently, the zeros become uniformly concentrated near the imaginary axis. Numerical examples illustrate the convergence of the proposed method, the associated error estimates, and the resulting zero distributions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Muhammet Karagöz, Nihal Özgür. 2026-10-08. Zeros and Their Distribution for Leonardo Polynomials. https://arxiv.org/abs/2610.14080

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Collatz/Bařina a$n$+b conjecture proofs by 16/64: Cayley a$n$+b tree not Cantor-Gödel-Conway-Wolfram undecidable

Lothar Collatz considered biperiodic iterations, and conjectured that picturing $n\mathrm{\to3}n\mathrm{+1}$ iterations for odd numbers and $n\mathrm{\to}n/2$ for even numbers, and proving that all natural numbers have a root path to the `trivial' cyclic root $(c=4)\to2\to1\to c\to\dots$, would connect elementary graph theory and number theory. John H. Conway replied that a$n$+b conjectures, except 1$n$+1, are undecidable due to a-periodic even $a\,\nmid\;$n$=a$n$_\text{odd}$+b successors. Biperiodic a$n$+b conjectures give disproofs of undecidability by Cantor diagonals, Gödel numbers, Conway unpredictability, and Wolfram irreducibility. The Cayley tree of Collatz-Conway $a\,\nmid\;$n$=a$n$_\text{odd}$+b numbers paired with Cantor binary tree numbers $y_{\ge0}$ is the $E=V=F=\mathbb{N}_0$ tree $T_{\ge 0}$ with its cyclic root $c=1a+1$ paired with $0$ and arrows ($E$dges) to wondrously ordered same-colour arrowhead nodes $a\,\nmid\;$n$=a$n$_\text{odd}$+b ($V$ertices) with same-numbered upwardly open sites above (sur$F$aces), paired with well-ordered root paths $y$, projecting to the Cartesian $y$-axis well-ordered sites $n$, paired with wondrously ordered root paths $y$. Tree $T_{\ge0}$ transforms into the integer Cartesian upper half graph $C_H$, providing a Hamiltonian tour from and back to the root $c$ at its origin $(0,0)$. The infinite Turing-Leibniz tape $T_L$ of proven $an_{odd}+b$ conjectures shows Turing-computable roots $c_{η\ge1}=2^{2^{η-1}+1}$ and $c$-expressible lowest trunk nodes $c^2$, 'cotree density' Hamiltonian tour proofs, and 'root-trunk' proofs $c^2<\frac{c}{2}(c-1)^2$. The $c$-roots generate also proven Mersenne prime $a=c-1$ conjectures: Collatz$_{\eta1}$ 3$n$+1 ($16<18$) and Bařina$_{\eta2}$ $7n\pm1$ ($64<196$).

math.GM↗

Formalization of Langlands's Second Main Lemma for Local Epsilon Factors

We describe the Lean 4 formalization of Langlands's Second Main Lemma for local epsilon factors over nonarchimedean local fields, in mixed and equal characteristic. The lemma compares the induction expressions attached to compatible characters of the intermediate fields of a bicyclic extension of prime-square degree. We explain the mathematical constructions and comparisons that constitute the proof, and identify their Lean declarations.

math.GM↗

A Local Proof of Langlands's First Main Lemma for Local Epsilon Factors over Nonarchimedean Local Fields

We give a complete local proof of Langlands's First Main Lemma for local epsilonfactors over nonarchimedean local fields. The proof builds on Dwork's p-adic calculations and Langlands's formulation of the local method. The present paper reformulates these calculations in a common normalization and extends the argument to equal characteristic. A more systematic treatment of stationary parameters and conductor cases is intended to make the calculations easier to follow. The author has also completed a local proof of Langlands's Second Main Lemma. Together with the present result and Langlands's remaining reductions, this gives a complete proof of the local construction of local epsilon factors envisioned by Langlands.

math.GM↗