Abstract

This paper delves into the number of partitions of positive integers n into powers of 2 in which exactly m powers of 2 are used an odd number of times. The study of these numbers is motivated by their connections with the f-vectors of the binary partition polytopes.

Full Text
Paper version not known

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 call

Disclaimer: 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.