In Schläfli notation — the system for naming regular star polygons — these are $\{7/2\}$ and $\{7/3\}$ [1]. Both appear in Tool’s artwork, in Thelemic symbolism, in medieval Islamic geometric patterns, and on the floor plans of cathedrals. They are the most visually intricate star polygons that can be drawn in a single closed stroke before the figure becomes illegible.

Both of them have a property that five-pointed and six-pointed stars do not share: they visit every vertex before closing. This is a consequence of 7 being prime. And it turns out to matter for how rhythmic accent cycles are built.

The Schläfli Symbol

A regular star polygon $\{n/k\}$ is constructed by placing $n$ points evenly on a circle and connecting every $k$-th point in sequence until the path closes. The structural key is a single number:

If $d = 1$, the traversal visits all $n$ vertices before returning to the start — a single connected figure. If $d > 1$, the path visits only $n/d$ vertices before closing, and the full figure consists of $d$ separate copies of the smaller star $\{(n/d)\,/\,(k/d)\}$.

The most familiar example of the disconnected case: $\{6/2\}$, the Star of David. Here $\gcd(6,2) = 2$, so the figure breaks into two copies of $\{3/1\} = \{3\}$ — two overlapping equilateral triangles. The traversal starting at vertex 1 visits $1 \to 3 \to 5 \to 1$, leaving vertices 2, 4, 6 entirely unvisited.

The pentagram $\{5/2\}$ is connected: $\gcd(5,2)=1$, traversal $1 \to 3 \to 5 \to 2 \to 4 \to 1$, all five vertices.

For $n=7$:

• $\{7/2\}$: $\gcd(7,2)=1$, traversal $1 \to 3 \to 5 \to 7 \to 2 \to 4 \to 6 \to 1$, all seven vertices.
• $\{7/3\}$: $\gcd(7,3)=1$, traversal $1 \to 4 \to 7 \to 3 \to 6 \to 2 \to 5 \to 1$, all seven vertices.

Both connected. Neither leaves any vertex unvisited.

The Group Theory

The traversal of $\{n/k\}$ is an instance of a standard construction in modular arithmetic: the orbit of an element under repeated addition in $\mathbb{Z}/n\mathbb{Z}$.

Label the $n$ vertices $0, 1, \ldots, n-1$. Starting at vertex 0, the traversal visits:

The orbit of 0 under the action of $+k$ is the subgroup of $\mathbb{Z}/n\mathbb{Z}$ generated by $k$. By a standard result, this subgroup has size $n / \gcd(n,k)$.

• When $\gcd(n,k) = 1$: orbit size $= n$. The traversal visits every vertex.
• When $\gcd(n,k) = d > 1$: orbit size $= n/d$. The traversal visits only a fraction of the vertices.

For prime $n$: $\gcd(n,k) = 1$ for every $1 \leq k \leq n-1$, without exception. Every traversal is complete. There is no step size that traps the path in a proper sub-orbit before visiting all vertices. This follows directly from the fact that a prime has no divisors other than 1 and itself, so $\mathbb{Z}/p\mathbb{Z}$ has no non-trivial subgroups (Lagrange’s theorem: any subgroup of a group of prime order must have order 1 or $p$).

This is the specific property that makes 7 — and any prime — rhythmically fertile.

The Contrast with Six

The comparison with $n = 6$ is the clearest illustration.

In $\mathbb{Z}/6\mathbb{Z}$, the possible step sizes are 1, 2, 3, 4, 5. Their orbits:

The only step sizes that visit all six vertices are 1 and 5 — both of which just traverse the hexagon itself, not a star. Every non-trivial star polygon on six points gets trapped. $\{6/2\}$ visits only half the vertices. $\{6/3\}$ visits only two. There is no connected six-pointed star that isn’t either the hexagon or a compound figure.

In $\mathbb{Z}/7\mathbb{Z}$, every step from 2 to 5 generates the full group:

All four non-trivial step sizes give connected traversals. Both are stars. Both visit every vertex. This is not a coincidence: it is the algebraic signature of primality.

From Geometry to Rhythm

The connection to drumming is direct. Here is the mechanism.

Consider a repeating rhythmic figure of 7 beats — a bar of 7/8, say, with positions 1 through 7. An earlier post discussed Euclidean rhythms: the algorithm that distributes $k$ onset positions as evenly as possible among $n$ slots. That is a problem of selection — which of the $n$ positions to activate.

The star polygon traversal asks a different question. Given that all $n$ positions are present, in what order of emphasis should they be related, such that each accent is a fixed distance from the last? The traversal of $\{n/k\}$ answers this: accent position $1$, then $1+k$, then $1+2k$, and so on modulo $n$.

For $\{7/2\}$: the accent cycle within a single bar runs $1 \to 3 \to 5 \to 7 \to 2 \to 4 \to 6$. Each featured beat is two positions ahead of the last.

Now project this across multiple bars. In bar 1, the primary accent sits on beat 1. In bar 2, if the accent shifts by 2, it lands on beat 3. Bar 3: beat 5. Bar 4: beat 7. Bar 5: beat 2. Bar 6: beat 4. Bar 7: beat 6. Bar 8: beat 1 again.

The accent takes seven bars to return to its starting position. Because $\gcd(2,7) = 1$, the step of 2 generates all of $\mathbb{Z}/7\mathbb{Z}$: every beat position receives the accent exactly once before the cycle resets. The resulting large-scale figure is $7 \times 7 = 49$ beats long — a super-phrase built from a single local rule.

The $\{7/3\}$ traversal generates the same exhaustiveness with a different path. Step 3 gives $1 \to 4 \to 7 \to 3 \to 6 \to 2 \to 5$: a seven-bar accent cycle that visits every position before repeating, but with wider spacing between accented beats, creating a different feel over the same underlying meter.

A six-beat figure with step 2 cannot do this. The accent visits only beats 1, 3, 5 — half the cycle — and loops back without touching beats 2, 4, 6. A drummer building phrase-level architecture from a six-beat grid is working with a more fragmented material.

Two Problems, One Prime

It is worth stating the relationship between the star polygon approach and Euclidean rhythms precisely, because the two are sometimes conflated [2].

The Euclidean algorithm distributes $k$ onsets among $n$ positions with maximal evenness. The result is a subset of the $n$ positions — a selection. The primality of $n$ matters here too: because $\gcd(k,p) = 1$ for prime $p$ and any $1 \leq k \leq p-1$, the Euclidean rhythm $E(k,p)$ always achieves its theoretical maximum of evenness. There are no divisibility shortcuts that cause clumping.

The star polygon traversal selects no subset — it relates all $n$ positions via a cyclic permutation. The primality of $n$ matters here because it guarantees that every non-trivial cyclic permutation (every step size $k$ with $1 < k < n$) generates the full group, visiting all positions before repeating.

Same arithmetic property — $\gcd(k,p) = 1$ for all non-zero $k$ — but the two problems ask different things of it. Euclidean rhythms use it to guarantee dense coverage. Star polygon traversals use it to guarantee no sub-orbit trapping.

The Compound Structure

Written out explicitly, the $\{7/2\}$ accent pattern over seven bars looks like this — with bold marking the featured beat in each bar:

Each bar is metrically identical. The large-scale accent — which beat carries the phrase-level emphasis — traces the traversal path of the $\{7/2\}$ star polygon across the seven-bar cycle.

This is the kind of large-scale rhythmic architecture visible in a great deal of Tool’s output. Whether Danny Carey explicitly constructs accent cycles from star polygon traversal paths, or whether the same structure emerges from his intuitive sense of how prime time signatures behave, produces the same result. The mathematics and the musical instinct point toward the same pattern.

Why the Heptagram

The full mathematical picture of why seven-fold symmetry is special — why the regular heptagon cannot be constructed by compass and straightedge, what the minimal polynomial of $\cos(2\pi/7)$ implies about the heptagon’s position outside the constructible world, and how the Galois group of the cyclotomic field over $\mathbb{Q}$ carries the obstruction — is developed in the companion post The Impossible Heptagon.

The short version, for the purposes of this post: seven is the smallest odd prime that is not a Fermat prime ($2^{2^j}+1$). This algebraic accident places it outside the reach of ruler-and-compass construction — the heptagon exists as an ideal but cannot be manifested by the classical tools. Its star polygons are the accessible shadows of an inaccessible form. And its primality, in both the constructibility sense and the traversal sense, is precisely what makes it inexhaustible as a rhythmic resource.

The Fibonacci structure in “Lateralus” [3], the group theory underlying twelve-tone equal temperament [4], and the Euclidean rhythm algorithm [5] are all different facets of the same observation: mathematical structure, introduced as compositional constraint, generates musical complexity that cannot easily be produced by intuition alone. The star polygon is another instance. The drummer who keeps a heptagram on his kit has found, by a non-mathematical route, an object with a precise and interesting mathematical identity.

References

[1] Coxeter, H.S.M. (1973). Regular Polytopes (3rd ed.). Dover. Ch. 2.

[2] Toussaint, G. (2013). The Geometry of Musical Rhythm: What Makes a “Good” Rhythm Good? CRC Press.

[3] See Fibonacci and Lateralus on this blog.

[4] See Twelve-TET and Group Theory on this blog.

[5] See Euclidean Rhythms on this blog.

The scientific reflex here is usually impatience. “Sacred geometry” occupies an uncomfortable cultural space — mathematically dressed, factually thin, reliant on the listener not checking claims too carefully. The golden ratio does not appear everywhere in nature. Most things described as sacred in this tradition are better described as things the speaker found surprising before learning a more precise vocabulary.

But the heptagon is genuinely strange. Not for the reasons usually given. For a different reason — a theorem.

The regular heptagon cannot be constructed with compass and straightedge.

Not “it is difficult.” Not “no one has found a construction yet.” The regular seven-sided polygon — all sides equal, all interior angles equal — is provably impossible to construct using an unmarked ruler and compass in finitely many steps. This has been known since 1801.

The Classical Constraint

Greek geometry restricted its tools deliberately. An unmarked straightedge draws lines through two known points. A compass draws circles centred at a known point with a given radius. No angle trisection. No markings. No graduated instruments. Just these two operations, applied one at a time, finitely many times.

Within this constraint, a great deal is achievable. A perpendicular bisector. An equilateral triangle. A regular pentagon — which requires the golden ratio and takes some work, but is reachable. A regular hexagon (trivially: six equilateral triangles around a centre).

Then: nothing for the heptagon. Greek geometers left no construction. Medieval Islamic mathematicians, who knew the regular polygon problem well, left no construction. Albrecht Dürer, in his 1525 Underweysung der Messung, gave an approximate construction that falls short by a small but nonzero margin. Each generation encountered the same wall.

In 1796, an 18-year-old Gauss proved that the regular 17-gon is constructible — a result so unexpected that he reportedly decided at that moment to become a mathematician rather than a philologist. In his 1801 Disquisitiones Arithmeticae he gave the complete characterisation of which regular polygons are constructible and which are not [1]. The heptagon was definitively placed among the impossible.

Gauss’s Theorem

A regular $n$-gon is constructible with compass and straightedge if and only if $n$ has the form

where $k \geq 0$ and the $p_i$ are distinct Fermat primes — primes of the form $2^{2^j} + 1$.

The Fermat primes currently known:

Five Fermat primes are known, all identified by the seventeenth century. Fermat himself conjectured that all numbers of this form are prime; he was wrong from $j = 5$ onward. Whether any further Fermat primes exist remains an open problem.

The constructible regular polygons therefore include the triangle (3), square (4), pentagon (5), hexagon (6), octagon (8), decagon (10), 15-gon, 17-gon, 257-gon, 65537-gon, and products of these with powers of 2. The 65537-gon was actually fully constructed by Johann Gustav Hermes, who spent around ten years on the computation in the 1880s and deposited a manuscript reportedly filling a large trunk at the University of Göttingen, where it remains.

Seven is prime, but $7 \neq 2^{2^j} + 1$ for any $j$ — it is not a Fermat prime. Therefore the regular heptagon is not on the list. It is not constructible.

The Algebra Behind the Geometry

Why does the structure of Fermat primes determine constructibility? The connection goes through algebra [2][3].

Every compass-and-straightedge construction corresponds to solving a sequence of equations of degree at most 2. Bisecting an angle, finding an intersection of a line and a circle — each step is a quadratic operation. After $k$ such steps, the numbers reachable lie in some field extension of $\mathbb{Q}$ (the rationals) with degree over $\mathbb{Q}$ at most $2^k$. Constructibility therefore requires the degree of the relevant extension to be a power of 2.

To construct a regular $n$-gon, you need to construct the angle $2\pi/n$, which requires constructing $\cos(2\pi/n)$. The question is: over what kind of field extension does $\cos(2\pi/n)$ sit?

For $n = 7$: let $\omega = e^{2\pi i/7}$, a primitive 7th root of unity. The minimal polynomial of $\omega$ over $\mathbb{Q}$ is the 7th cyclotomic polynomial

which is irreducible over $\mathbb{Q}$, giving $[\mathbb{Q}(\omega) : \mathbb{Q}] = 6$. Since $\cos(2\pi/7) = (\omega + \omega^{-1})/2$, and since $\omega$ satisfies a degree-2 polynomial over $\mathbb{Q}(\cos 2\pi/7)$, we get

Specifically, $c = \cos(2\pi/7)$ is the root of the irreducible cubic

or equivalently, $\alpha = 2\cos(2\pi/7)$ satisfies

The three roots of this cubic are $2\cos(2\pi/7)$, $2\cos(4\pi/7)$, and $2\cos(6\pi/7)$. By Vieta’s formulas their sum is $-1$ and their product is $1$ — which can be verified directly from the identity $\cos(2\pi/7) + \cos(4\pi/7) + \cos(6\pi/7) = -1/2$.

The degree of the extension is 3. Three is not a power of 2. Therefore $\cos(2\pi/7)$ cannot be reached by any tower of quadratic extensions of $\mathbb{Q}$. Therefore the regular heptagon is not constructible. $\square$

Compare the pentagon: $\cos(2\pi/5) = (\sqrt{5}-1)/4$, satisfying the quadratic $4x^2 + 2x - 1 = 0$. Degree 2 — a power of 2. Constructible.

The 17-gon: the Galois group of $\mathbb{Q}(\zeta_{17})/\mathbb{Q}$ is $(\mathbb{Z}/17\mathbb{Z})^* \cong \mathbb{Z}/16\mathbb{Z}$, order $16 = 2^4$. The extension decomposes into four quadratic steps. This is exactly what Gauss computed at 18.

For 7: $(\mathbb{Z}/7\mathbb{Z})^* \cong \mathbb{Z}/6\mathbb{Z}$, order $6 = 2 \times 3$. The factor of 3 is the obstruction. The Galois group is not a 2-group, so the extension cannot be decomposed into quadratic steps. The heptagon is out of reach.

Sacred, Precisely

The phrase “sacred geometry” usually does work that “elegant mathematics” could do more honestly. But the heptagon is a case where something with genuine mathematical content sits underneath the mystical framing.

The Platonic tradition held that certain geometric forms exist as ideals — perfect, unchanging, more real than their physical approximations. The philosopher’s claim is that the heptagon exists in a realm beyond its material instantiation. The mathematician’s claim is: the heptagon is perfectly well-defined — seven equal sides, seven equal angles — but it cannot be reached from $\mathbb{Q}$ by the operations available to ruler and compass. You can approximate it to any desired precision. You can construct it exactly using origami, which allows angle trisection and is strictly more powerful than compass and straightedge [4]. But the classical constructive program — the one that reaches the pentagon, the hexagon, the 17-gon, the 65537-gon — cannot reach the heptagon.

There is a precise mathematical sense in which it lies outside the constructible world. Whether that constitutes sacredness is a question for a different kind of argument. But it is not nothing. The Pythagoreans were working without Galois theory; they had an intuition without the theorem. The theorem, when it came, confirmed that intuition about seven while explaining it more clearly than they could.

Carey’s intuition — that 7 sits outside the ordinary — is, by this route, formally correct.

What the Heptagram Is

The regular heptagon may be impossible to construct exactly, but the heptagram — the seven-pointed star — is perfectly drawable. Connecting every second vertex of an approximate regular heptagon gives $\{7/2\}$ in Schläfli notation [5]; connecting every third vertex gives $\{7/3\}$. Both are closed figures. Both appear throughout pre-modern symbolic traditions, which is unsurprising: they are the most intricate star polygons drawable with a single pen stroke before complexity outruns visibility.

They are also generators of rhythmic structure. Because 7 is prime, every star polygon on seven points visits all seven vertices in a single closed traversal — a property that does not hold for six-pointed or eight-pointed stars. This turns out to matter for how drum patterns are built across multiple bars. That connection — from the primality of 7 to the architecture of rhythmic accent cycles — is the subject of the companion post, Star Polygons and Drum Machines.

The broader series on mathematics in Tool’s music began with the Fibonacci structure embedded in the time signatures and syllable counts of “Lateralus” [6], and the group-theoretic structure underlying twelve-tone equal temperament provides the same algebraic scaffolding seen here [7].

References

[1] Gauss, C.F. (1801). Disquisitiones Arithmeticae. Leipzig: Fleischer. (§VII.)

[2] Stewart, I. (2004). Galois Theory (3rd ed.). CRC Press. Ch. 4.

[3] Conway, J.H. & Guy, R.K. (1996). The Book of Numbers. Springer. pp. 190–202.

[4] Hull, T. (2011). Solving cubics with creases: The work of Beloch and Lill. The American Mathematical Monthly, 118(4), 307–315. DOI: 10.4169/amer.math.monthly.118.04.307

[5] Coxeter, H.S.M. (1973). Regular Polytopes (3rd ed.). Dover. Ch. 2.

[6] See Fibonacci and Lateralus on this blog.

[7] See Twelve-TET and Group Theory on this blog.