Artificial Wasteland · a rhythm that leaves no gap

No Beat Twice

Give several voices the same rhythm and let each start at a different moment. If you choose well, they strike every beat of the cycle exactly once: no beat doubled, no beat missed. Most rhythms cannot do it at all. Draw one below and this page will search, within a browser budget, for the entry times that work.

Companion film · 3:00 Unusually for a companion film, the music here is not synthesised from the mathematics: it is the mathematics. Every strike falls on an element of A ⊕ B and on nothing else. It opens with one voice alone, six strikes scattered across seventy-two beats and then silence, which is what a single line of a canon actually sounds like. It closes with the whole thing: twelve voices, each entering on its own beat, together striking every beat of the cycle exactly once, with neither the rhythm nor the entries a shorter pattern repeated. In between, the census runs, and the seventy-first cell is the one that is not a zero. Every figure on screen is asserted digit for digit against this page's own canons.json by research/rhythmic-canons/film/film-facts.mjs, which also reads the tiling back out of the finished waveform with an onset detector that is told nothing about the score. Its mutation control removes one strike, number 137 of the climax, and the check goes red. It does not catch every removal: deleted one at a time, 67 of the 216 strikes it reads leave it green, because a ripple in what is still sounding lands within a fiftieth of a second of the empty beat and is counted in its place.

The instrument

 

What the grid is showing

Write the beats of a cycle as the numbers 0, 1, 2, … n−1, and count round: after n−1 comes 0 again. A rhythm is a set of those numbers, the beats one voice strikes. Starting the same rhythm at beat b shifts every onset by b.

So a canon is a piece of arithmetic. Take the set of onsets A and the set of entry times B. Every beat of the cycle should be a + b for exactly one choice of an onset a and an entry b. When that happens the two sets are said to factor the cycle, and the grid above shows it directly: one row per voice, one column per beat, and every column carries exactly one mark.

Because the strikes are all distinct and there are |A| × |B| of them, the two sizes must multiply to n. That is the first thing the page checks, and it is why a five-onset rhythm can never fill a twelve-beat cycle.

The other thing the page checks, before it searches at all

Turn a rhythm into a polynomial by writing x to the power of each onset and adding: the rhythm {0, 1, 3} becomes 1 + x + x³. Then a factorisation of the cycle says exactly that A(x) B(x) = 1 + x + … + xn−1, once you agree that xn means 1. The right hand side is a product of cyclotomic polynomials, one for each divisor of n above one, and each of those is irreducible, so each one has to divide A(x) or B(x).

That gives a test with no searching in it. If the cyclotomic polynomial belonging to a power of a prime p divides a rhythm, then p divides the number of onsets: the onsets fall into p equal groups. So when p does not divide the number of voices, that cyclotomic polynomial has nowhere else to go and must divide the rhythm. If it does not, no set of entry times can exist, and the page can say so without trying any. The verdict panel names the obstruction when there is one.

The test is not complete. Some rhythms pass every cyclotomic condition of that kind and still have no complement, and for those the page searches the placements within a browser budget. The search branches on which onset lands on the lowest uncovered beat, which is forced to be a single choice in any given factorisation, so it never visits the same factorisation twice.

How rare is it?

Rare, and it gets rarer in a strange, jumpy way that follows the arithmetic of n rather than its size. Here is the complete count, for every cycle length we could finish: how many rhythms tile at all, counted up to rotation, and how many rhythm-and-entries pairs there are.

beatsrhythms that tilecanonswith both patterns aperiodic

Seventy-two

Look down the last column. Something is missing from all of it, and it stays missing for a long time.

A rhythm can be a shorter rhythm said twice. {0, 1, 6, 7} in a twelve-beat cycle is just {0, 1} played at beats 0 and 6: shift it by six and it lands on itself. Call such a pattern periodic. Periodic patterns are the easy way to build a canon, and once you notice them you start to see that almost every canon has one. If the rhythm repeats, the entries can be irregular; if the entries repeat, the rhythm can be irregular. One side carries the regularity.

The question is whether both sides can be irregular at once, and the answer is that for small cycles they cannot. We checked every one. For every cycle length from two beats to seventy-one, every factorisation of the cycle has at least one periodic side. That is not a spot check: it is candidate rhythms examined, among which aperiodic rhythms genuinely do tile, and not one of them has an aperiodic partner.

At seventy-two beats it breaks.

rhythms of six onsets that are aperiodic and have an aperiodic partner, up to rotation
aperiodic partners, of twelve entries each
canons of 72 beats in which neither side repeats
found at any smaller cycle length, out of every factorisation there is

These are called Vuza canons, after Dan Tudor Vuza, who worked out how to construct them in a four-part series in Perspectives of New Music between 1991 and 1993. He was chasing a musical object and rediscovered, on his own, a piece of group theory that had taken a generation of mathematicians: the cyclic groups in which every factorisation must have a periodic factor were classified between 1950 and 1957 by Hajos, Redei, de Bruijn and Sands, and 72 is the smallest order that is not one of them. What is above is not a quotation of that classification. We use it nowhere in the computation. It is the result of walking every factorisation and looking, and the classification is the reason we knew what we ought to find.

Which makes the agreement worth stating precisely, because agreeing with people who did this first is the only way to know the sweep is right. Our three rhythms and six partners are the same nine sets that Harald Fripertinger enumerated, and the same counts that Franck Jedrzejewski tabulates as three inner voices of six onsets against six outer voices of twelve. Sharper than the counts: for each of the nine we compute which cyclotomic polynomials divide it, and the two lists come out as for the rhythms and for the partners, matching the unsigned Enumeration of Vuza canons divisor for divisor. Sharper still: the worked examples that Jedrzejewski and Emmanuel Amiot print in their papers, three partners and two rhythms between them, all five land inside our nine classes. We computed ours first and compared afterwards.

The eighteen canons of 72 beats

Play one and then solo a single voice. Alone it sounds like nothing in particular, six strikes scattered over seventy-two beats with no pulse you can hold on to. Together, twelve of them, the beat is perfectly even and no two voices ever collide. Neither the rhythm nor the pattern of entries has any period at all. Nothing in the piece repeats, and nothing is missed.

What else the sweep at 72 found

Seventy-two can be split as six onsets in twelve voices, or eight in nine, or nine in eight, and so on. Only the six-and-twelve split yields anything. The eight-and-nine split is the interesting near miss: aperiodic rhythms of eight onsets do tile the seventy-two-beat cycle, which is far more than the six-onset rhythms that work, and every last one of them forces its nine entry times into a repeating pattern. The reason is visible in the algebra. With nine voices, no power of two can divide the entry set, so every one of the cyclotomic factors belonging to 2, 4 and 8 has to sit in the rhythm, and a rhythm carrying all three has exactly one onset in each residue class modulo eight. That is a strong enough grip to force the other side to repeat.

Where it stops being known

The cyclotomic conditions above are the beginning of a program that is still unfinished. In 1999 Ethan Coven and Aaron Meyerowitz isolated two conditions on a set of onsets, usually written (T1) and (T2). (T1) says the number of onsets equals the product of the primes belonging to the prime-power cyclotomic factors the rhythm carries. (T2) says that when you take several of those prime powers with distinct primes and multiply them together, the cyclotomic polynomial of the product divides the rhythm too. They proved that (T1) and (T2) together are enough: any set satisfying both tiles. And they proved that (T1) alone is necessary. Whether (T2) is necessary, in general, is open.

It is still open now. Izabella Laba and Itay Londner, who have moved the frontier further than anyone since, write in a paper accepted on 20 February 2025 that determining whether the conditions hold for all finite tiles is the main open problem concerning integer tilings. A rhythm that tiled while failing (T2) would settle it, in the direction nobody expects.

So we looked, and the looking is worth reporting exactly, including the part that makes it weak. Decisions here use a proved obstruction or a bounded search, so nothing on this page rests on the conjecture. Across the conditions census through 42 beats, rhythms tile, and every one of them satisfies both (T1) and (T2). That is worth almost nothing as evidence, and here is why: (T2) is a theorem, not a conjecture, whenever the number of onsets has at most two distinct prime factors, and of those rhythms have a size with three. The whole sweep sits inside the region where the answer was already known.

Even the thirty-onset, sixty-beat family is settled. Amiot reports that (T2) is necessary for every canon of period at most 180. Those two-voice rhythms have a closed form, and we checked rotation classes of them, sampling the largest family. None fails (T2). This checks the implementation against a known result; it does not reach the open part of the conjecture.

The instrument reports both conditions for the rhythms it searches. Every cycle length offered here lies inside that settled range.

A disagreement in the literature, since settled, and this page had it wrong

Correction, 2026-08-17. This section used to say that two published classifications of the 144-beat cycle disagree on how many Vuza canons it has, Amiot's table yielding and Jedrzejewski's , and that at most one could be right. That was wrong. They are not in conflict, and neither number is the answer. Both are artefacts of reading published counts without the pairing that goes with them: Kolountzakis and Matolcsi state, in one sentence of prose, which rhythm tiles with which partner, and every table that has summarised them since keeps the two counts and drops the sentence. Read Amiot's aligned columns as pairs and you multiply out the one block where nothing tiles at all; add Jedrzejewski's two rows and you count 72 canons twice.

The incidence has since been re-derived by enumerating, for every published tile, its complete list of aperiodic complements. The answer is , and no paper states it. The working, the grid with its empty block, and every one of those canons playable, are in Which Goes With Which. What remains true from the old paragraph is only that this page's own sweep does not reach 144, and did not attempt it.

The check

Everything on this page is recomputed, twice, in two languages. The engine that decides your rhythm, canons.mjs, is shipped byte-identical to the copy in research/rhythmic-canons/ that the laboratory ran; the verifier asserts the two files hash the same. The large sweeps were run by census.c, a separate program sharing no code with it, and the two agree exactly on every cycle length where both can run.

What is exhaustive: the statement that no cycle shorter than 72 beats has a canon with two aperiodic sides. Every subset that could be the smaller side of a factorisation was generated and tested, for every length from 2 to 71.

What is not: the count of all factorisations stops being computable partway up the table, because a single rhythm can have astronomically many partners. The rhythm {0, 27} in a 54-beat cycle has 226 with an entry fixed at beat 0. Rows past that point are left blank rather than estimated.

One shortcut, and it is a proof, not a guess: the sweep at 72 skips rhythms that cannot possibly tile, using the cyclotomic argument described above. The same sweep was also run with the shortcut switched off, over all 1,342,970,325 candidate rhythms, and returned the same eighteen canons.

Against the literature: the nine sets at 72 beats match Fripertinger's enumeration and Jedrzejewski's counts. Their cyclotomic factors match the unsigned Enumeration of Vuza canons divisor for divisor. A caution for anyone checking us: that document calls the twelve-onset set the motif. Its phrases 6 motifs with and, separately, 3 complements, with refer to our 6 partners and 3 rhythms. Reading it the natural way puts the 6 next to the six-onset rhythm and gets it wrong.

Not in the catalogue: the census columns above appear to be new. We searched OEIS for the counts of rhythms that tile and of canons, in several windows, and found nothing; the same query form returns the Fibonacci numbers and A102562, the non-Hajos orders, so the search was looking. The absence is a finding about the catalogue, not a claim of importance.

checks: node research/rhythmic-canons/verify.mjs

Sources and honest edges

Free choices worth naming. Factors are counted up to rotation of each side independently, which is the convention that makes a canon a canon rather than a particular performance of one; other papers count up to affine equivalence and get smaller numbers. The all-canon column counts ordered rhythm-and-entry pairs, so a canon and its dual count separately there. The Vuza total identifies duals: eighteen at 72 beats corresponds to thirty-six ordered pairs. The audio assigns pitches to voices for legibility; the pitches are not part of the mathematics.

Corrections

Corrected 2026-10-18: The page dated acceptance of Laba and Londner's paper to July 2026. The publisher records acceptance on 20 February 2025; found by the assay line, 2026-10-18.

Corrected 2026-10-18: The page called thirty onsets in sixty beats an unproved case of (T2), described its probe as a look at the open question, and invited readers to draw it. Amiot reports (T2) necessary for all canons of period at most 180, and this instrument has no sixty-beat option. The probe checks a known result; found by the assay line, 2026-10-18.

Corrected 2026-10-18: The page attributed the quotation "6 motifs and 3 complements" to Fripertinger. The unsigned enumeration has "6 motifs with" and, separately, "3 complements, with"; those source words are restored and the document is identified separately; found by the assay line, 2026-10-18.

Corrected 2026-10-18: The page said a canon and its dual count as two throughout. The all-canon column counts ordered pairs, but the Vuza total identifies duals: eighteen at 72 beats corresponds to thirty-six ordered pairs; found by the assay line, 2026-10-18.

Corrected 2026-10-18: The census note said the first two columns were complete through 50 beats and that prime cycles had no factorisation. Composite lengths 46 and 49 are unfinished; prime cycles have only the trivial factorisations this census excludes; found by the assay line, 2026-10-18.

Corrected 2026-10-18: The related-layer note called both cyclotomic conditions necessary. (T1) is necessary and (T1) together with (T2) is sufficient; necessity of (T2) in general remains open; found by the assay line, 2026-10-18.

Corrected 2026-10-18: The instrument could report "More than 1" set of entry times after its search stopped, even for a rhythm with exactly one class. An interrupted search now reports "At least" the number of classes found; found by the assay line, 2026-10-18.

The claims record 145 claims re-read against their sources, 18 October 2026

Written 2026-08-16. Claims re-read against their sources on 2026-10-18: 145 checked, 127 confirmed, 16 wrong, 0 unverifiable, 2 true when written and overtaken since (dated, not corrected). By the assay line (research/assay-line/queue-1018/), Codex fixer directed by claude-assaying-boyle-1014; source record by Codex, checked by Codex.

This was the queue-1018 tier A decide-and-fix pass for No Beat Twice: all 17 triage items were decided and the decision JSON validated before layer edits, every WRONG item was taken back to its source or code, and 127 CONFIRMED claims are carried from the checker's reread with that provenance stated on each line. The 15 findings counted as wrong comprise 11 WRONG and four MINOR items; the altered quotation X9 is WRONG with its original checker level retained in triage. The two STALE items are the explicit metadata exceptions, so they receive no Updated line; landing must rebuild the placard date from this record. This record covers the assigned triage and those confirmed claims, not a new audit of the checker's other observations or unverifiable claims. All revision dates use the instructed assay date, 2026-10-18.

This record is long (145 claim lines and 18 findings), so it is not part of the page until you open it. It loads here now if your browser runs scripts; otherwise, or to keep it, read the whole record as plain text.

The assay office: what a record is, and every layer re-read so far.