Abstract
The number of members of a family of sequences of length n of zeros and ones whose members differ from one another in at most 2 k places is shown to be necessarily no more than ∑ l = 0 k ( n l ) A generalization to a similar statement about families of sequences of integers, and the relation of this theorem to a result of Katona are also described.
Sign-in/Register to access full text options 
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.
