| rdfs:comment
| - In additive combinatorics, a Šindel sequence is a periodic sequence of integers with the property that its partial sums include all of the triangular numbers. For instance, the sequence that begins 1, 2, 3, 4, 3, 2 is a Šindel sequence, with the triangular partial sums 1 = 1, 3 = 1 + 2, 6 = 1 + 2 + 3,10 = 1 + 2 + 3 + 4,15 = 1 + 2 + 3 + 4 + 3 + 2,21 = 1 + 2 + 3 + 4 + 3 + 2 + 1 + 2 + 3,28 = 1 + 2 + 3 + 4 + 3 + 2 + 1 + 2 + 3 + 4 + 3, etc. Another way of describing such a sequence is that it can be partitioned into contiguous subsequences whose sums are the consecutive integers: (en)
|
| has abstract
| - In additive combinatorics, a Šindel sequence is a periodic sequence of integers with the property that its partial sums include all of the triangular numbers. For instance, the sequence that begins 1, 2, 3, 4, 3, 2 is a Šindel sequence, with the triangular partial sums 1 = 1, 3 = 1 + 2, 6 = 1 + 2 + 3,10 = 1 + 2 + 3 + 4,15 = 1 + 2 + 3 + 4 + 3 + 2,21 = 1 + 2 + 3 + 4 + 3 + 2 + 1 + 2 + 3,28 = 1 + 2 + 3 + 4 + 3 + 2 + 1 + 2 + 3 + 4 + 3, etc. Another way of describing such a sequence is that it can be partitioned into contiguous subsequences whose sums are the consecutive integers: This particular example is used in the gearing of the Prague astronomical clock, as part of a mechanism for chiming the clock's bells the correct number of times at each hour. The Šindel sequences are named after Jan Šindel, a Czech scientist in the 14th and 15th centuries whose calculations were used in the design of the Prague clock. The definition and name of these sequences were given by Michal Křížek, Alena Šolcová, and Lawrence Somer, in their work analyzing the mathematics of the Prague clock. If denotes the sum of the numbers within a single period of a periodic sequence, and is odd, then only the triangular numbers up to need to be checked, to determine whether it is a Šindel sequence. If all of these triangular numbers are partial sums of the sequence, then all larger triangular numbers will be as well. For even values of , a larger set of triangular numbers needs to be checked, up to . In the Prague clock, an auxiliary gear with slots spaced at intervals of 1, 2, 3, 4, 3, and 2 units (repeating in the example Šindel sequence in each of its rotations) is synchronized with and regulates the motion of another larger gear whose slots are spaced at intervals of 1, 2, 3, 4, 5, ..., 24 units, revolving once a day with its spacing controlling the number of chimes on each hour. In order to keep these two gears synchronized, it is important that, for every revolution of the large gear, the small gear also revolves an integer number of times. Mathematically, this means that the sum of the period of the Šindel sequence must evenly divide , the sum of spacing intervals of the large gear. For this reason it is of interest to find Šindel sequences with a given period sum . In connection with this problem, a primitive Šindel sequence, is a Šindel sequence no two of whose numbers can be replaced by their sum, forming a shorter Šindel sequence. For every there exists a unique primitive Šindel sequence having period sum equal to . Note however, that this sequence may be formed by repeating a shorter Šindel sequence more than one time. A sequence that just repeats the number 1, with any period, is a Šindel sequence, and is called the trivial Šindel sequence. If is a power of two, then the trivial Šindel sequence with period is primitive, and is the unique primitive Šindel sequence with period sum . For any other choice of , the unique primitive Šindel sequence with period sum is not trivial. (en)
|
![[RDF Data]](/fct/images/sw-rdf-blue.png)
![[cxml]](/fct/images/cxml_doc.png)
![[csv]](/fct/images/csv_doc.png)
![[text]](/fct/images/ntriples_doc.png)
![[turtle]](/fct/images/n3turtle_doc.png)
![[ld+json]](/fct/images/jsonld_doc.png)
![[rdf+json]](/fct/images/json_doc.png)
![[rdf+xml]](/fct/images/xml_doc.png)
![[atom+xml]](/fct/images/atom_doc.png)
![[html]](/fct/images/html_doc.png)