Polynomial Coefficient Enumeration
Tewodros Amdeberhan, Richard P. Stanley

TL;DR
This paper investigates the enumeration of polynomial coefficients over fields, providing formulas for counting specific coefficient types in polynomial powers and exploring related combinatorial enumeration problems.
Contribution
It introduces new formulas for counting coefficients of polynomial powers over finite fields and connects these results to lattice path and convex polytope enumeration.
Findings
Matrix formula for coefficients of polynomial powers over finite fields
Enumeration results linking polynomials to lattice paths
Connections between polynomial coefficients and convex polytope points
Abstract
Let be a polynomial over a field . This paper considers such questions as the enumeration of the number of nonzero coefficients of or of the number of coefficients equal to . For instance, if then a matrix formula is obtained for the number of coefficients of that are equal to , as a function of . Many additional results are obtained related to such areas as lattice path enumeration and the enumeration of integer points in convex polytopes.
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
TopicsAdvanced Combinatorial Mathematics · Advanced Mathematical Identities · Algebraic structures and combinatorial models
