Depth

Series — page 6

A field says what an essay is about. A series follows one idea essay by essay — from the question that introduces it to the one that assumes all the others.
A resolution refutation of four clauses on three variables. A derivation tree: the given clauses at the top, each later clause obtained by cancelling one variable between two clauses above it, ending in the empty clause.

Resolution

  1. 1 A proof with one rule
  2. 2 Two literals make an arrow
  3. 3 A failed search is a proof
  4. 4 A contradiction that is only a sum
  5. 5 Two terms made equal, and no more
  6. +3 more
8 essays · logic
The 7 7th roots of unity. 7 points spaced evenly around the unit circle, at the vertices of a regular 7-sided polygon.

Roots of unity

  1. 1 The polygon an equation forces
  2. 2 Every third coefficient
  3. 3 On the circle and never home
  4. 4 The sums of roots of unity that add to nothing
  5. 5 The sums that obey a smaller equation
  6. +3 more
8 essays · algebra
The four ways to glue a square's edges in pairs. Squares with their edges arrowed to show which is glued to which and which way round, each with the vertices, edges and faces the gluing leaves, and the surface those numbers name.

Surface classification

  1. 1 Every surface is a sphere with handles
  2. 2 Every word driven to a normal form
  3. 3 The third number a surface needs
  4. 4 Every way to pair a polygon's edges
  5. 5 The surface a random gluing makes
  6. +3 more
8 essays · topology
Every relabelling of a 4-gon's corners, and the 8 that are motions. All 24 permutations of the corners drawn one by one, with the 8 that preserve every distance marked; the rest deform the polygon and are not symmetries.

Symmetry groups

  1. 1 Eight ways to leave a square alone
  2. 2 Colourings nobody can tell apart
  3. 3 The blocks a subgroup cuts out
  4. 4 Twenty-four ways to set a cube down
  5. 5 Necklaces made of symmetries
  6. +3 more
8 essays · algebra
The plane divided by nearest neighbour. 10 sites, and every point of the rectangle shaded by which site is closest to it. The boundaries are the places where two sites tie.

Voronoi

  1. 1 The plane, divided by whoever is nearest
  2. 2 One dimension up, and the circles disappear
  3. 3 Every site in the middle of its own cell
  4. 4 When the sites are not the same size
  5. 5 The tree inside the triangulation
  6. +3 more
8 essays · geometry
Every way of choosing one thing from each of 4 pairs. A table with one row per choice function on a small family of pairs, each row giving what it takes from each pair, with the row a stated rule names picked out.

Axiom of choice

  1. 1 The choice nobody can write down
  2. 2 A function that adds and is nowhere a line
  3. 3 Infinitely many guessers, finitely many wrong
  4. 4 The choice inside a countable union
  5. 5 A spanning tree for every graph
  6. +2 more
7 essays · logic
Every triangulation of a 6-gon. All 14 ways of cutting a convex 6-gon into triangles with non-crossing diagonals — the 4th Catalan number, counted by drawing them.

Catalan numbers

  1. 1 One sequence, counting everything
  2. 2 Counting the paths that go wrong
  3. 3 One word, and four objects
  4. 4 The equation a sequence satisfies
  5. 5 The solid whose corners are triangulations
  6. +2 more
7 essays · discrete
Two points, and everything one round of compass and straightedge adds. Two starting points with the line and circles they permit, and the four points where those objects cross.

Constructible numbers

  1. 1 What two points can build
  2. 2 Every step is a square root
  3. 3 The cube that will not double
  4. 4 The angle that will not divide by three
  5. 5 Which polygons can be drawn
  6. +2 more
7 essays · computation
A chord of x², and the curve under it. The curve x² with one chord drawn across it, the region between them shaded, and the midpoint heights of both marked. The comparison is computed at four hundred sample points.

Convexity

  1. 1 The curve of the average, and the average of the curve
  2. 2 A line under every point
  3. 3 The function seen from its tangents
  4. 4 Where the guarantee stops
  5. 5 Three points, however many there are
  6. +2 more
7 essays · analysis
The de Bruijn graph on 2 letters and words of 3, and the cycle through it. A graph whose vertices are short words and whose arrows are words one letter longer, with a closed walk using every arrow exactly once marked, and the cyclic sequence it spells.

De bruijn

  1. 1 Every word once, around a cycle
  2. 2 Every necklace, in order
  3. 3 A memory of four bits
  4. 4 A page that knows where it is
  5. 5 A cycle for every pair
  6. +2 more
7 essays · computation
The most triangle-free edges on 6 points. A graph on 6 points carrying 9 edges and no triangle, found by examining every graph on those points, with the two sides its edges cross between drawn apart.

Extremal graphs

  1. 1 The edge that forces a triangle
  2. 2 Moves that only ever add edges
  3. 3 The densest graph without a square
  4. 4 The fewest triangles an edge density allows
  5. 5 As many points as two steps allow
  6. +2 more
7 essays · discrete
A product of 3 polynomials, and what its coefficients count. The coefficients of a product of small polynomials, with the combinations of choices that reach one marked total written out beneath it.

Generating functions

  1. 1 A polynomial that counts
  2. 2 The product that deals the labels
  3. 3 The coefficient that is a polynomial
  4. 4 Coins hidden in the roots
  5. 5 The roots every matching polynomial keeps real
  6. +2 more
7 essays · discrete
The whirling squares. Squares with Fibonacci sides 1, 1, 2, 3, 5, 8, 13, each attached to the long side of what came before. They fill a 13 by 21 rectangle exactly.

Golden ratio

  1. 1 The rectangle that eats itself
  2. 2 Three gaps and no more
  3. 3 The diagonal no unit measures
  4. 4 Tiles that never repeat
  5. 5 The numbers that come after the golden ratio
  6. +2 more
7 essays · geometry
A point, a ray, and 9 crossings. A closed curve wound into a spiral corridor, with a marked point, a ray from it and every crossing marked; an odd count means the point is inside.

Jordan curve

  1. 1 Which side of the line is inside
  2. 2 A curve that has area
  3. 3 Every loop is a circle in disguise
  4. 4 Two pieces, in every dimension
  5. 5 A ball whose outside is not one
  6. +2 more
7 essays · topology
All 16 trees on 4 labelled points. Every tree on 4 labelled points, drawn one by one. There are 16 of them, which is 4 to the power 2.

Labelled trees

  1. 1 Sixteen trees on four points
  2. 2 Cars that park, and trees that grow
  3. 3 A random tree is one part in e leaves
  4. 4 A labelling every tree seems to have
  5. 5 Every function is a tree with two marks
  6. +2 more
7 essays · discrete
Which axioms hold on which frames. A table of frames against modal axioms, each cell decided by checking the axiom under every valuation.

Modal logic

  1. 1 The axiom is the shape of the graph
  2. 2 Two diagrams the language cannot tell apart
  3. 3 Worlds built out of sentences
  4. 4 The axiom with no property of the arrows
  5. 5 Necessity that means provable
  6. +2 more
7 essays · logic
Arithmetic on a dial of 12. A dial with 12 positions. Starting at 8 and stepping forward 9 places lands on 5, because the walk passes the top 1 time on the way.

Modular arithmetic

  1. 1 Numbers that wrap
  2. 2 Two dials at once
  3. 3 Multiplying every number on the dial at once
  4. 4 A root lifted one digit at a time
  5. 5 A number that is its own square
  6. +2 more
7 essays · discrete
A largest flow of 5 through two wide ends and a narrow middle. A network with a capacity on every road, the amount a largest flow sends along each, and the cut whose capacity equals that flow's value drawn as a line separating the places.

Network flow

  1. 1 The bottleneck is the whole story
  2. 2 When several pairs share the roads
  3. 3 One tree for every cut
  4. 4 Three places cut apart
  5. 5 The cheapest way to send
  6. +2 more
7 essays · discrete
An angle of 60° cut in three with one mark. A circle with a marked point on it, a straightedge laid through that point so the segment between the extended diameter and the circle equals the radius, and the third-angle it makes.

Neusis

  1. 1 The mark that changes what is reachable
  2. 2 Two instruments with one reach
  3. 3 A quintic a sliding mark reaches
  4. 4 A curve that divides any angle
  5. 5 The spiral that measures its own circle
  6. +2 more
7 essays · computation
Pascal's triangle mod 2, 32 rows. Only the odd entries are drawn; the pattern that appears is the Sierpiński triangle.

Pascals triangle

  1. 1 Pascal's triangle, in two colours
  2. 2 The run that lands one place along
  3. 3 Every entry counts the routes to it
  4. 4 The carries decide the divisibility
  5. 5 A remainder read two digits at a time
  6. +2 more
7 essays · discrete

All essays