Concept

Necklace — where it appears

A cyclic pattern counted once however it is rotated, which is how a repeating rhythm is enumerated when its starting point is not part of it. Five onsets in sixteen steps make 273 of them, and every census of timelines here is a count of necklaces.

Named by 3 essays across one field — each of them below, with the objects they name alongside it.

Euclidean up to the one thing a timeline is for. Five named timelines, each drawn above the Euclidean pattern with the same number of onsets in the same number of steps, with the rotation between them found by search. 3 of 5 are rotations of the Euclidean pattern and 2 are not Euclidean at any rotation — son clave, 3–2 and rumba clave, 3–2, whose gap sequences are 3·3·4·2·4 and 3·4·3·2·4 against the algorithm's 3·3·3·3·4. Where the match holds it holds only up to rotation, and a rotation is not a small difference: the algorithm has no way to produce a starting position, and a starting position is what a timeline is.

The rotation the necklace cannot see

Ask Bjorklund's algorithm for the world's timelines and the usual answer is that it produces them. Search every rotation of each Euclidean pattern for a match and the answer is more interesting: the tresillo is E(3,8) exactly, the bossa-nova and the standard bell pattern are rotations of theirs, and the son and rumba claves — the two best-known timelines in the world — are not Euclidean at any rotation whatever. Where the match does hold it holds up to a starting position, and a starting position is the one thing a timeline is.

rhythm · Euclidean rhythm
5 censuses: the floor of the longest gap, the ceiling of the syncopation total, and how few patterns reach both. For each census of k onsets in n steps, counted by rotation class: 3 in 8: patterns 7, floor of longest gap 3, at the floor 1, ceiling of total 14, at the ceiling 2, at both 1; 5 in 8: patterns 7, floor of longest gap 2, at the floor 2, ceiling of total 12, at the ceiling 2, at both 2; 5 in 12: patterns 66, floor of longest gap 3, at the floor 6, ceiling of total 28, at the ceiling 6, at both 6; 7 in 12: patterns 66, floor of longest gap 2, at the floor 3, ceiling of total 20, at the ceiling 38, at both 3; 5 in 16: patterns 273, floor of longest gap 4, at the floor 13, ceiling of total 79, at the ceiling 9, at both 9. The rotation-total of syncopation is taken against a metre of 2 × 2 × 2 for 8 steps, 2 × 2 × 3 for 12 steps, 2 × 2 × 2 × 2 for 16 steps. In every census drawn the evenly spaced pattern is at the floor and at the ceiling.

The other censuses keep evenness, not locating

Five onsets in sixteen suggested two rules: a named timeline's longest gap is the shortest its census allows, and its syncopation totalled over every rotation is the largest. Nine of ten named timelines across five censuses meet both — but so does the evenly spaced pattern, in all twenty-one censuses from two onsets in eight to eight in sixteen, and in four of those five censuses the named timeline is the evenly spaced pattern. What the rules describe is evenness. The quantity the frontier was built on points the other way: the evenly spaced pattern is the slowest of its census to locate in nineteen of twenty-one, the standard bell pattern is the slowest of all sixty-six patterns of seven in twelve, and among the orders of its own gaps a named timeline is usually both the most even and the slowest to locate. The son clave, whose most even order is also the fastest, is the exception the locating story was told about.

rhythm · Euclidean rhythm
With a fading memory the slowest order of the gaps 1 1 2 2 2 2 2 is not the one a perfect memory finds. For each of the 3 cyclic orders of the gaps 1, 1, 2, 2, 2, 2, 2 in 12 steps, the bits of position still unknown once listening has settled, against how many steps a listener's memory of a step takes to halve, with a mismatch costing 6. 2 2 2 1 2 1 2: 12 → 4e-9, 6 → 4e-5, 4 → 0.007, 3 → 0.070, 2 → 0.540, 1.5 → 1.130, 1 → 1.786; 2 2 2 2 1 1 2: 12 → 2e-5, 6 → 0.035, 4 → 0.335, 3 → 0.795, 2 → 1.405, 1.5 → 1.694, 1 → 2.005; 2 2 1 2 2 1 2 (the standard bell pattern): 12 → 2e-5, 6 → 0.027, 4 → 0.231, 3 → 0.535, 2 → 1.028, 1.5 → 1.368, 1 → 1.819. With perfect memory the slowest to locate is the standard bell pattern; at a half-life of 6 steps the highest floor is the order 2 2 2 2 1 1 2, and at 1 it is the order 2 2 2 2 1 1 2.

The bell pattern is slowest only to a perfect memory

Among the orders of its own gaps, a named timeline is usually both the most even and the slowest to locate — for a listener who never forgets. Give the listener a memory that halves and the result comes apart. Of six timelines slowest among their orders with perfect memory, only the fume-fume stays slowest for every forgetting listener, and the standard bell pattern, which is the fume-fume with onsets and rests exchanged and settles at exactly the same floors, is second of its three orders for every memory of half its cycle or less. The census ranking survives better, and in fourteen of twenty-one censuses it was the arithmetic of a pattern that repeats.

rhythm · Euclidean rhythm

Named alongside it

The objects these essays reach for when they reach for this one.

Euclidean rhythmMaximal evennessRotationTimelineClaveInter-onset intervalSyncopationEntropyEnumerationMemory decay

All concepts