Abstract
We give an elementary proof of a property discovered by Xavier Grandsart: let W be a circular binary word; then the differences in the number of occurrences |W |0011 − |W |1100 , |W |1101 − |W |1011 , |W |1010 − |W |0101 and |W |0100 − |W |0010 are equal; this property is easily generalized using the De Bruijn graph.
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.
