🔢 mathematics

Counting Truchet Tile Balls

This paper presents a method for counting the distinct balls that can be created by applying Truchet-like patterns to the pentagonal and hexagonal faces of a classic football.

Original authors: Thomas Fernique

Published 2026-07-29

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Thomas Fernique

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are a mathematician, but instead of solving equations on a chalkboard, you are playing with a giant, cosmic ball of LEGOs. This isn't just about stacking blocks; it's about a branch of math called combinatorics, which is essentially the art of counting possibilities. Think of it like figuring out how many different ways you can arrange a deck of cards or how many unique passwords you can make with a specific set of letters. But here, the "cards" are the panels on a soccer ball, and the "passwords" are the patterns painted on them.

To understand the puzzle, you need two main ideas. First, there's the Truchet tile. Imagine a square tile with a curved line drawn on it. If you rotate that tile, the line looks different. If you have a whole floor covered in these tiles, and you can spin each one however you like, you can create millions of wild, winding patterns. Second, there's the concept of symmetry. If you have a soccer ball and you spin it around, it looks the same from the outside, even if the patterns on the inside have shifted. The big question in this field is: "If I have a bunch of these spinning tiles and I stick them onto a ball, how many truly unique balls can I make?" It sounds simple, but it's tricky because a ball that looks different might just be the same ball turned around in your hand. This matters because it helps us understand the hidden order in complex shapes, from viruses to soccer balls, and it turns a simple game of decoration into a deep mathematical adventure.

Now, let's talk about the specific adventure Thomas Fernique took in this paper. He looked at a very specific type of soccer ball design created by an artist named Jon-Paul Wheatley. Wheatley designed panels for the pentagons (the 5-sided shapes) and hexagons (the 6-sided shapes) that look like Truchet tiles. The magic of Wheatley's design is that no matter how you rotate a panel, it always connects perfectly with its neighbors because the edges match up. This means you can spin every single one of the 20 hexagons on the ball in three different ways, while the 12 pentagons stay the same (because their design is perfectly symmetrical).

If you just did the math without thinking about the ball spinning, you'd get a huge number: 3 to the power of 20. That's over 3 billion different-looking balls. But here's the catch: if you make a ball and then spin the whole thing, it's still the same ball, just viewed from a different angle. So, the real question is: how many distinct balls are there if we ignore the ones that are just rotated versions of each other?

Fernique used a powerful mathematical tool called Burnside's Lemma to solve this. You can think of this tool as a super-smart filter. It takes all 3 billion possibilities and filters out the duplicates that are just rotations of the same object. The paper calculates exactly how many times the ball can be rotated (there are 60 different ways to spin a soccer ball so it looks like itself) and counts how many patterns stay the same after each specific spin.

The result? After filtering out all the "just-turned-around" duplicates, the number of truly unique balls drops from 3 billion to 58,130,055. That is still a massive number—about 58 million different soccer balls. To put that in perspective, the paper notes that this is roughly the number of footballs manufactured in the entire world every single year. If you laid all these unique balls out on the ground, they would cover about 243 hectares, which is roughly the size of Hyde Park in London. If you stacked them up like oranges at a market, they would fill a cube with sides 76 meters long, or about 175 Olympic-sized swimming pools.

The paper doesn't stop there. It also asks a "what if" question: What if we used different patterns that could be rotated in more ways? The authors show that if you change the patterns so the pentagons have 5 possible orientations and the hexagons have 5, the number of unique balls explodes to a staggering 388,051,072,794,677,890,625. That number is so big that if you stacked them up, they would cover the entire Earth, including the oceans, to a depth of about 5,700 meters—higher than Mount Ararat. The authors call this a "Flood of balls."

So, the paper doesn't just count tiles; it uses a classic soccer ball and some clever math to show us the difference between "looking different" and "being different." It proves that even with a simple set of rules, the universe of possibilities is vast enough to fill a park, a city, or even the whole planet, depending on how you play the game.

Technical Summary: Counting Truchet Tile Balls

Problem Statement
This note addresses the combinatorial problem of determining the exact number of distinct balls that can be constructed by decorating the faces of a truncated icosahedron (the geometry of a classic football, comprising 12 pentagons and 20 hexagons) with specific Truchet-like patterns. The specific design under consideration, created by Jon-Paul Wheatley, utilizes panels where each side features a centered thick colored line. A critical constraint of this design is that adjacent panels always match regardless of orientation, allowing each of the 20 hexagonal faces to be independently rotated into three distinct states. While pentagonal faces possess rotational symmetry rendering their orientation irrelevant, the hexagonal faces contribute a raw combinatorial space of $3^{20}$ (approximately 3.48 billion) potential configurations. However, many of these configurations are identical under rigid motions (rotations) of the sphere. The objective is to calculate the number of unique balls up to rigid motion.

Methodology
The paper employs the Burnside Lemma (also known as the Cauchy-Frobenius Lemma) to solve this enumeration problem. The methodology proceeds as follows:

Group Definition ( $G$ ): The group $G$ is defined as the set of all rigid motions (rotations) that map the truncated icosahedron onto itself. The paper identifies $|G| = 60$ , derived from the symmetry group of the icosahedron:
- 24 rotations of $\pm 72^\circ$ and $\pm 144^\circ$ around axes passing through opposite pentagon centers (6 axes).
- 20 rotations of $\pm 120^\circ$ around axes passing through opposite hexagon centers (10 axes).
- 15 rotations of $180^\circ$ around axes passing through the midpoints of opposite edges shared by hexagons (15 axes).
- 1 identity transformation.
Set Definition ( $X$ ): The set $X$ represents the total number of possible ball configurations without considering symmetry. The paper generalizes this by defining $p$ as the number of distinct patterns (orientations) available for a pentagonal panel and $q$ for a hexagonal panel. For the specific Wheatley design, $p=1$ and $q=3$ .
Fixed Point Calculation ( $|X_g|$ ): For each element $g \in G$ , the number of configurations fixed by that rotation is calculated based on the orbit structure of the faces:
- Case 1 ( $\pm 72^\circ, \pm 144^\circ$ ): The 2 pentagons on the axis form orbits of size 1; the remaining 10 pentagons and 20 hexagons form orbits of size 5. This yields $|X_g| = p^4 q^4$ . There are 24 such rotations.
- Case 2 ( $\pm 120^\circ$ ): The 2 hexagons on the axis form orbits of size 1; the remaining 12 pentagons and 18 hexagons form orbits of size 3. This yields $|X_g| = p^4 q^8$ . There are 20 such rotations.
- Case 3 ( $180^\circ$ ): All faces form orbits of size 2. This yields $|X_g| = p^6 q^{10}$ . There are 15 such rotations.
- Case 4 (Identity): All faces form orbits of size 1. This yields $|X_g| = p^{12} q^{20}$ . There is 1 such rotation.
Application of Burnside's Formula: The number of distinct orbits (unique balls) is calculated as:
$|X/G| = \frac{1}{60} \left( 24p^4q^4 + 20p^4q^8 + 15p^6q^{10} + p^{12}q^{20} \right)$

Key Results

Specific Case (Wheatley Design): Substituting $p=1$ and $q=3$ into the derived formula yields exactly 58,130,055 distinct balls.
Generalized Case: The paper also explores a hypothetical variation where pentagons have 5 orientations and hexagons have 5 orientations ( $p=5, q=5$ ). This results in approximately $3.88 \times 10^{20}$ distinct balls.

Significance and Claims
The paper claims to provide the exact enumeration of these designs, correcting the "crude estimate" of $3^{20}$ by accounting for rotational symmetry. The author contextualizes the magnitude of the result for the specific Wheatley design (58 million) by comparing it to the global annual production of footballs. Furthermore, the paper offers physical analogies to visualize the scale of the combinatorial space:

The 58 million balls would cover approximately 243 hectares if laid out densely (roughly the area of Hyde Park).
Stacked densely, they would form a cube with 76-meter sides or fill 175 Olympic-sized swimming pools.
In the generalized $p=5, q=5$ scenario, the resulting volume would cover the entire Earth (including oceans) to a depth of roughly 5,700 meters.

The work serves as a mathematical note demonstrating the application of group theory to a recreational geometry problem, bridging the gap between abstract combinatorics and tangible physical scale.

Technical Summary: Counting Truchet Tile Balls

More like this