Certificate — where it appears
Named by 2 essays across one field — each of them below, with the objects they name alongside it.
Nothing decides whether a set of tiles tiles the plane
This collection rests on decidability — generate a pattern, forget the group, rediscover it, compare. One question in the same subject has no procedure at all: given a finite set of tiles, whether they cover the plane cannot be decided by any algorithm whatever. What can be done is two half-searches, and measuring what they leave behind.
Surrounded twice over, and covering nothing
A shape that tiles the plane can be surrounded by copies of itself for ever. A shape that tiles nothing cannot be surrounded for ever — but it can be surrounded once, and sometimes twice, and the number of times is a measurement of how much local success a global impossibility permits.
Named alongside it
The objects these essays reach for when they reach for this one.
DecidabilityLocal rulesTiling by a groupAperiodicityCase analysisEnumerationForcingHeesch numberMatching rulesWang tile