On a property discovered by Xavier Grandsart
Pierre Arnoux

TL;DR
This paper presents a straightforward proof of a property related to circular binary words, showing that specific differences in occurrence counts are equal, which was originally discovered by Xavier Grandsart.
Contribution
The paper provides a simple and clear proof of a property concerning occurrence differences in circular binary words, clarifying a previously known but complex result.
Findings
Differences in occurrence counts are equal for circular binary words.
The proof simplifies understanding of the property.
Supports further research in combinatorics on words.
Abstract
We give a simple proof of the property discovered by Xavier Grandsart: let be a circular binary word; then the differences in the number of occurences , , and are equal.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Advanced Combinatorial Mathematics · Advanced Mathematical Identities
