Abstract
We show that 2 ⌈ log 2 ( m ) ⌉ 2^{\lceil \log _2 (m) \rceil } is the least number of symmetric differences that a family of m m sets can produce. Furthermore we give two characterizations of the set-theoretic structure of the families for which that lower bound is actually attained.
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.
