Abstract
For a polynomial P of degree n and an m-tuple Λ=(λ1,…,λm) of distinct complex numbers, the dope matrix of P with respect to Λ is DP(Λ)=(δij)i∈[1,m],j∈[0,n], where δij=1 if P(j)(λi)=0, and δij=0 otherwise. Our first result is a combinatorial characterization of the 2-row dope matrices (for all pairs Λ); using this characterization, we solve the associated enumeration problem. We also give upper bounds on the number of m×(n+1) dope matrices, and we show that the number of m×(n+1) dope matrices for a fixed m-tuple Λ is maximized when Λ is generic. Finally, we resolve an “extension” problem of Nathanson and present several open problems.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
