On a problem of Molluzzo concerning Steinhaus triangles in finite cyclic groups
Jonathan Chappelon

TL;DR
This paper investigates the existence of balanced sequences in finite cyclic groups, proving Molluzzo's problem for groups of order 3^k and constructing infinitely many balanced sequences for odd n, while analyzing arithmetic progressions.
Contribution
It solves Molluzzo's problem for groups of order 3^k and constructs infinitely many balanced sequences for all odd n, advancing understanding of Steinhaus triangles in cyclic groups.
Findings
Confirmed Molluzzo's conjecture for n=3^k.
Constructed infinitely many balanced sequences for odd n.
Identified limitations for even n and arithmetic progressions.
Abstract
Let be a finite sequence of length in . The \textit{derived sequence} of is the sequence of length obtained by pairwise adding consecutive terms of . The collection of iterated derived sequences of , until length 1 is reached, determines a triangle, the \textit{Steinhaus triangle generated by the sequence }. We say that is \textit{balanced} if its Steinhaus triangle contains each element of with the same multiplicity. An obvious necessary condition for to be the length of a balanced sequence in is that divides the binomial coefficient . It is an open problem to determine whether this condition on is also sufficient. This problem was posed by Hugo Steinhaus in 1963 for and generalized by John C. Molluzzo in…
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
TopicsFinite Group Theory Research · Mathematics and Applications · Holomorphic and Operator Theory
