The Genealogy Theorem for Monic Prime‑Generating Polynomials
The Genealogy Theorem for Monic Prime‑Generating Polynomials
We formulate and prove a Genealogical Theorem for prime-generating monic integer polynomials evaluated on the non-negative integers. The key result states that any such polynomial with run length L > 1 admits a unique parent with run L − 1 under a canonical shift of the argument. This induces rooted genealogical trees whose leaves correspond to structural maxima for the prime run length. We provide full formal proofs, structural corollaries, and computational examples, including a monic quartic with run L = 38 and a monic cubic with run L = 31 in the canonical setting. Another example is the quartic polynomial of length L=49.
monic polynomials, computational number theory, genealogy theorem, prime sequences, number theory, prime‑generating polynomials, prime numbers, prime runs, polynomial translation, polynomial genealogy, integer polynomials
monic polynomials, computational number theory, genealogy theorem, prime sequences, number theory, prime‑generating polynomials, prime numbers, prime runs, polynomial translation, polynomial genealogy, integer polynomials
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!