Automating John P. D'Angelo's method to study Complete Polynomial Sequences
Shalosh B. Ekhad, Doron Zeilberger
TL;DR
This paper automates John P. D'Angelo's method for analyzing complete polynomial sequences, linking number theory and complex geometry, and provides a systematic approach to study these sequences efficiently.
Contribution
It introduces a fully automated process for D'Angelo's method, enabling systematic analysis of complete polynomial sequences and their geometric implications.
Findings
Automated method for studying complete polynomial sequences
Established connections between number theory and complex geometry
Enhanced understanding of critical dimensions in complex geometry
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematics and Applications · History and Theory of Mathematics · Polynomial and algebraic computation