Automating John P. D'Angelo's method to study Complete Polynomial Sequences
Number Theory
2021-11-05 v1 Combinatorics
Complex Variables
Abstract
In this article, dedicated to the memory of Ron Graham, we fully automate John P. D'Angelo's method for studying complete polynomial sequences, for which Ron Graham, back in 1964, gave a beautiful necessary and sufficient conditions. D'Angelo found surprising connection of these elementary (but deep) number-theoretic questions to determining certain critical dimensions in complex geometry.
Cite
@article{arxiv.2111.02832,
title = {Automating John P. D'Angelo's method to study Complete Polynomial Sequences},
author = {Shalosh B. Ekhad and Doron Zeilberger},
journal= {arXiv preprint arXiv:2111.02832},
year = {2021}
}
Comments
6 pages; accompanied by a Maple package available from https://sites.math.rutgers.edu/~zeilberg/mamarim/mamarimhtml/jpda.html Exclusively published in the Personal Journal of Shalosh B. Ekhad and Doron Zeilberger and arxiv.org