Abstract
A conjecture of Erdös that a set of n distinct numbers having the most linear combinations with coefficients 0,1 all equal are n integers of smallest magnitude is here proven. The result follows from a theorem of Stanley that implies that the integers from n have the most such linear combinations having k distinct values for every k. The same result is shown to hold for complex numbers and vectors in Hilbert space. It is shown that the number of linear combinations taking on k distinct values is maximized by the same configuration, for every k. Generalization to the case in which irregular distinctness restrictions are imposed is also given.
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.
