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 1976 for . So far, only the case has been solved, by Heiko Harborth in 1972. In this paper, we answer positively Molluzzo's problem in the case for all . Moreover, for every odd integer , we construct infinitely many balanced sequences in . This is achieved by analysing the Steinhaus triangles generated by arithmetic progressions. In contrast, for any even with , it is not known whether there exist infinitely many balanced sequences in . As for arithmetic progressions, still for even, we show that they are never balanced, except for exactly 8 cases occurring at and .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.