한
Spatial atlas

VOYAGE TWENTY-TWO · FINDING WHAT MUST APPEAR WITHOUT COUNTING IT ALL

When Choices Outgrow the Universe — From Counting Possibilities to Inevitable Structure

Thirteen beats made from short and long syllables already give 377 rhythms, and twenty has 627 integer partitions. Add vertices, edges, colors, and symmetry, and possibility quickly outruns enumeration. From Baghdad, Patan, and Hangzhou through Paris, Berlin, Cambridge, Budapest, and Urbana, watch mathematics move from listing every case to proving structure even among cases never inspected.

QUESTION FOR THE ROUTE

When possibilities outnumber any feasible inspection, how can we count exactly, remove duplicates, and prove that some pattern must appear?

WHAT THE LINE DOES NOT CLAIM

This route does not begin combinatorics with one inventor in Paris in 1654. It does not rename prosodic recurrence as modern binary, give every triangular array to Pascal, turn probabilistic existence into a construction algorithm, or treat computer checking as proof without human reduction. The map line is an edited comparison among questions of counting, paths, partitions, symmetry, and inevitability—not a proven single transmission route; writing, working, and publication bases remain distinct at each pin.

The camera rests on each city while you read, then eases through the runway between scenes. Select any marker or scene link to travel in either direction.

The same route, four questions

A lens never hides a scene or proves a cause. It changes which places you compare first, and the URL preserves your choice.

Whole routeTranslation networksCommercial demandObservation and institutionsPatronage and power

The whole-route view keeps problem, cognitive change, place, movement, and evidence boundary at equal weight. Choose a lens when you want to test a different explanation against the same scenes.

15 scroll-controlled map scenes

Live map · 지도를 불러오는 중…

01 / 15 · c. 1000 CE

Baghdad

  1. 01 · c. 1000 CE

    Baghdad · Composition

    Calculating Power-Expansion Coefficients in a Triangular Array — al-Karaji

    In algebraic works written in Baghdad, al-Karaji treated rules for expanding powers of a binomial and a triangular arrangement of coefficients. Parts of his own text are lost, but al-Samaw’al’s later work preserves the method. This is not labeled the lone invention of the modern ‘Pascal triangle’; binomial knowledge developed through several authors and transmission networks in the Islamic world.

    PAUSE AND ASK

    Can coefficients be reused instead of multiplying a high power of (a+b) from scratch?

    How the idea changed

    Move from separate expansions to a recursive triangle in which neighboring coefficients build the next row.

    What this place made possible

    Baghdad’s networks of books, scholars, and administrative calculation supported long-form algebraic rules drawing on multiple arithmetic traditions.

    How it moved

    Several arithmetic and algebraic traditions → al-Karaji’s Baghdad writings → preservation and extension by al-Samaw’al → later binomial calculation

    Do not overclaim

    Parts of al-Karaji’s work are reconstructed through al-Samaw’al. It is not declared the sole first instance of modern induction notation or the so-called Pascal triangle.

    Evidence sources
    • MacTutor — Al-Karaji

      Supports: Al-Karaji’s Baghdad algebra, a triangular arrangement of binomial coefficients, and transmission through al-Samaw’al

    Stable link to this scene
    BaghdadPatan

  2. 02 · c. 1150 CE

    Patan · Main activity

    Counting Every Rhythm of Short and Long Syllables — Hemachandra

    In the courtly and scholarly setting of Patan in Gujarat, Hemachandra explained a recurrence for rhythms of a fixed duration made from short syllables of one beat and long syllables of two. The numbers follow what is now called the Fibonacci recurrence, but they stand on earlier prosodic work associated with Pingala, Virahanka, and Gopala. They are not projected backward as one person’s invention of modern binary notation or the Fibonacci sequence.

    PAUSE AND ASK

    How do rhythms filling n beats with one- and two-beat syllables relate to the previous two lengths?

    How the idea changed

    Instead of listing rhythms, split by a short or long final syllable to obtain F(n)=F(n−1)+F(n−2).

    What this place made possible

    Patan’s Chaulukya court and Jain scholarly networks supported sustained work spanning prosody, grammar, lexicography, and history.

    How it moved

    Pingala’s prosodic tradition → recurrences associated with Virahanka and Gopala → Hemachandra’s systematization → later histories of sequences and combinatorial interpretation

    Do not overclaim

    The shared recurrence is not recast as modern binary notation or a proven direct source for Fibonacci’s European work. The pin marks Hemachandra’s working center, not a known writing room.

    Evidence sources
    Stable link to this scene
    PatanHangzhou

  3. 03 · 1261 CE

    Hangzhou · Composition

    Preserving and Extending an Already Known Triangular Array — Yang Hui

    Yang Hui of Qiantang, today’s Hangzhou, included a triangular coefficient array in his 1261 work and credited it to the earlier Jia Xian. Printing and mathematical teaching made the recurrence reusable across problems. The array is not remembered only under Pascal’s name, nor is Yang recast as its first creator.

    PAUSE AND ASK

    What remains invariant when one triangle moves among equations, powers, and combinations?

    How the idea changed

    Read a table of numbers not as one answer but as a recurrence tool shared by many calculations.

    What this place made possible

    The print, educational, and commercial setting of the Southern Song capital region helped reproduce calculation books for wider readers.

    How it moved

    Jia Xian’s eleventh-century method → Yang Hui’s 1261 record and attribution → transmission in Chinese mathematical books → comparison in global histories

    Do not overclaim

    Yang Hui himself credited Jia Xian. Hangzhou marks the author’s region and scholarly network, not a proven print shop or invention site.

    Evidence sources
    • MacTutor — Yang Hui

      Supports: Yang Hui’s Qiantang identity, his 1261 work, and his attribution of the triangular array to Jia Xian

    Stable link to this scene
    HangzhouParis

  4. 04 · 1654 CE

    Paris · Composition

    Linking Choice, Powers, and Chance through One Triangle — Pascal

    Pascal’s Treatise on the Arithmetical Triangle did not invent an array already known in several mathematical cultures. It did organize adjacent sums, binomial coefficients, combinations, and gambling probabilities within one sustained argument. Correspondence with Fermat also stimulated probability calculations, but probability and combinatorics were not born all at once in Paris in 1654.

    PAUSE AND ASK

    Why can one triangle answer both ‘choose r from n’ and a fair division of an interrupted game?

    How the idea changed

    Unify an array’s recurrence as a proof device for choices, binomial powers, and probability.

    What this place made possible

    Parisian correspondence, print, salons, and readers interested in games of chance encouraged rules to be organized as proofs.

    How it moved

    Coefficient arrays across cultures → Pascal’s systematic treatise plus Fermat correspondence → a standard diagram in probability and combinatorics education

    Do not overclaim

    Pascal was not the first creator of the triangular array, and the 1654 treatise and correspondence did not complete all of combinatorics and probability at once.

    Evidence sources
    • MacTutor — Blaise Pascal

      Supports: The 1654 arithmetical-triangle treatise, its use in combinations and chance, and earlier histories of the array

    Stable link to this scene
    ParisLeipzig

  5. 05 · 1666 CE

    Leipzig · Publication

    Dreaming of a Universal Art for Possible Combinations — Leibniz

    At twenty, Leibniz published his Dissertation on the Art of Combinations in Leipzig, imagining a general method for analyzing complex concepts into basic elements and arranging their combinations. It helped circulate combinatoria as a broad program, but it was not a completed modern textbook of graphs, probability, and extremal combinatorics.

    PAUSE AND ASK

    If complex ideas are decomposed into combinations of basic elements, can reasoning itself be calculated?

    How the idea changed

    Expand counting beyond particular games and arrays into a dream of organizing concepts and arguments universally.

    What this place made possible

    Leipzig’s university and Latin print networks turned a young scholar’s dissertation into a program visible to European readers.

    How it moved

    Medieval arts of combination and logical classification → Leibniz’s 1666 dissertation → projects for universal notation and calculable logic → later combinatorial terminology

    Do not overclaim

    The dissertation’s combinatoria differs in scope from today’s field. Leibniz is not projected forward as having already designed modern combinatorics, computers, or AI.

    Evidence sources
    Stable link to this scene
    LeipzigKönigsberg

  6. 06 · 1736 CE

    Königsberg · Other

    Keeping Connections and Discarding Distance in the Seven Bridges — Euler

    Euler replaced Königsberg’s four land masses and seven bridges with vertices and connections, proving that no walk crosses every bridge exactly once. The city supplied the problem setting, while the paper circulated through the Saint Petersburg Academy. It did not complete modern graph theory, but it made the compression of possible routes into structure unusually clear.

    PAUSE AND ASK

    If every bridge length and shape is erased, does the possibility of crossing each once remain?

    How the idea changed

    Compress geography into vertex degrees and incidence, deciding impossibility without listing every walk.

    What this place made possible

    Königsberg’s actual layout of river branches, islands, and bridges supplied a recurring walking puzzle fit for abstraction.

    How it moved

    Urban walking puzzle → Euler’s correspondence and argument → Saint Petersburg Academy publication → graph and topological path theory

    Do not overclaim

    The pin marks the problem setting. Euler worked in Saint Petersburg, and the 1736 scene is not called the completion of modern graph theory.

    Evidence sources
    Stable link to this scene
    KönigsbergBerlin

  7. 07 · 1741 CE

    Berlin · Composition

    Compressing Exploding Integer Partitions into One Infinite Product — Euler

    In the year he moved to Berlin, Euler wrote a paper treating ways to split an integer into positive summands through generating functions and infinite products. Rather than list every case, one algebraic object carried all partition numbers as coefficients. The manuscript was written in 1741 but published in 1751 through the Saint Petersburg Academy, so writing place and publication place remain distinct.

    PAUSE AND ASK

    Can every integer partition be stored in one expression instead of written row by row?

    How the idea changed

    Replace direct lists with generating functions and infinite products whose coefficients carry the answers.

    What this place made possible

    Berlin Academy support and correspondence let Euler continue long calculations while retaining publication ties with Saint Petersburg.

    How it moved

    Philippe Naudé’s partition question → Euler’s 1741 manuscript → 1751 Saint Petersburg journal → generating functions and number theory

    Do not overclaim

    Berlin marks the 1741 writing context, not the publication site. Euler did not complete every partition formula or settle all convergence questions by modern standards in this paper.

    Evidence sources
    Stable link to this scene
    BerlinLondon

  8. 08 · 1857 CE

    London · Publication

    Counting Branching Forms of Differential Expressions as ‘Trees’ — Cayley

    While working as a lawyer in London, Cayley represented nested differential operations as rooted, branching ‘trees’ and counted their forms. Trees later spread into chemistry, networks, and algorithms, but the 1857 paper did not single-handedly establish every modern form of Cayley’s formula or graph theory.

    PAUSE AND ASK

    What becomes simpler when differently written expressions are counted by the same branching structure?

    How the idea changed

    Turn nested algebraic and differential expressions into rooted combinatorial trees.

    What this place made possible

    Working as a lawyer in London while publishing mathematics, Cayley organized extensive symbolic calculation across professional and journal networks.

    How it moved

    Nested differential and symbolic operations → Cayley’s rooted trees → chemical structures and graph enumeration → algorithmic data structures

    Do not overclaim

    The 1857 paper matters for the term ‘tree’ and enumeration of analytical forms, but it did not complete every tree-graph formula or computer tree data structure.

    Evidence sources
    Stable link to this scene
    LondonCambridge

  9. 09 · 1918 CE

    Cambridge · Composition

    Reading the Growth of Partition Numbers around a Complex Circle — Hardy and Ramanujan

    Working in Cambridge, Hardy and Ramanujan traced coefficients of the partition generating function through complex analysis and obtained a striking asymptotic formula for p(n). It became possible to read growth without enumerating every partition. Ramanujan’s insights, Hardy’s collaboration, and Rademacher’s later exact series are distinct contributions, not a simple opposition between intuition and rigor.

    PAUSE AND ASK

    If p(200) is too large to enumerate, can its scale still be predicted accurately?

    How the idea changed

    Read generating-function coefficients through complex-plane integration, widening exact enumeration into asymptotic growth.

    What this place made possible

    Wartime Cambridge’s university, correspondence, and journal setting let Ramanujan and Hardy shape different techniques into a long joint argument.

    How it moved

    Euler’s generating functions → Ramanujan’s formulas and congruences plus Hardy’s analysis → circle method → Rademacher’s exact series

    Do not overclaim

    The 1918 paper gives an asymptotic formula, not a simple exact closed form for every n. The collaboration is not reduced to a colonial trope of intuition being made rigorous by the West.

    Evidence sources
    Stable link to this scene
    CambridgeCambridge

  10. 10 · 1930 CE

    Cambridge · Publication

    Proving that Sufficiently Large Structures Cannot Avoid Order — Ramsey

    While studying a decision problem in formal logic, Ramsey proved that if subsets of a sufficiently large finite set are colored with finitely many colors, a regular monochromatic part must appear. The familiar party claim R(3,3)=6 is a small special case. Ramsey theory is not retroactively made to originate in a puzzle about six friends.

    PAUSE AND ASK

    If connections are colored arbitrarily with two colors, does a sufficiently large graph force a monochromatic triangle?

    How the idea changed

    Move beyond finding one arrangement to proving a threshold at which every coloring contains order.

    What this place made possible

    Cambridge’s community across logic, mathematics, and philosophy supported Ramsey’s development of a lemma for formal logic into a theorem about finite structure.

    How it moved

    A decision problem in formal logic → Ramsey’s homogeneous-subset theorem → reinterpretation by Erdős and Szekeres → modern Ramsey theory

    Do not overclaim

    R(3,3)=6 is a small graph case of Ramsey’s theorem, not the paper’s starting puzzle. Cambridge marks the working context; the journal was the London Mathematical Society’s.

    Evidence sources
    Stable link to this scene
    CambridgeBudapest

  11. 11 · 1935 CE

    Budapest · Main activity

    Finding an Unavoidable Convex Quadrilateral among Five Points — Erdős and Szekeres

    Esther Klein’s observation in a Budapest problem circle led to a proof that every five points in general position contain four forming a convex quadrilateral and to a broader convex-polygon problem. Erdős and Szekeres extended it in a 1935 paper, but the woman who posed the starting problem and the group around it remain visible. The nickname ‘happy ending problem’ is a later reference to a marriage, not the mathematical content.

    PAUSE AND ASK

    Why do five points in general position always contain four forming a convex quadrilateral?

    How the idea changed

    Move from one diagram to extremal questions about geometric structure unavoidable across all arrangements.

    What this place made possible

    An informal Budapest problem circle gave young mathematicians a shared setting to test and generalize Esther Klein’s observation.

    How it moved

    Esther Klein’s five-point observation → problem-circle discussion → Erdős and Szekeres’s 1935 paper → discrete geometry and extremal combinatorics

    Do not overclaim

    The story does not begin only with the paper’s authors; Klein’s initiating problem remains visible. The general-position condition—no three collinear—is not omitted.

    Evidence sources
    Stable link to this scene
    BudapestZurich

  12. 12 · 1937 CE

    Zurich · Publication

    Counting Colorings without Duplicating Those Equal under Rotation — Pólya

    At ETH Zürich, Pólya published a general method using the cycle structure of groups to count colorings and chemical structures identified by rotations or reflections. Simply dividing all arrangements by the number of symmetries can fail because some arrangements are fixed by more transformations. One must first state which transformations make two objects the same.

    PAUSE AND ASK

    Why is counting necklace colorings up to rotation harder than dividing by the number of rotations?

    How the idea changed

    Count colorings fixed by each symmetry and average them, placing the definition of ‘same’ inside the calculation.

    What this place made possible

    ETH Zürich’s mathematical, physical, and educational setting let group symmetries and chemical-isomer enumeration meet in one language.

    How it moved

    Burnside and Frobenius on group actions → Pólya’s cycle index and generating functions → enumeration in chemistry, graphs, and patterns

    Do not overclaim

    Pólya’s theorem is not the simple formula ‘all cases divided by number of symmetries.’ Zürich marks his research base, not a claimed journal printing site.

    Evidence sources
    • MacTutor — George Pólya

      Supports: Pólya’s ETH Zürich position and the symmetry and chemistry applications of his 1937 enumeration theorem

    Stable link to this scene
    ZurichBudapest

  13. 13 · 1959 CE

    Budapest · Publication

    Proving Existence by Choosing a Structure at Random — Erdős and Rényi

    Within Budapest’s research network, Erdős and Rényi systematized random-graph models that insert edges probabilistically. If the probability that a random object has a property is positive, at least one such object exists—the probabilistic method. This is not automatically a construction algorithm, nor a claim that every real network forms through equal independent probabilities.

    PAUSE AND ASK

    If a desired structure is hard to construct, does positive probability under a random choice prove it exists?

    How the idea changed

    Prove existence through averages and thresholds in a probability space without inspecting all objects or explicitly constructing one.

    What this place made possible

    The Hungarian Academy’s mathematical institute and Budapest’s problem-centered networks supported Erdős and Rényi’s collaboration on random graphs.

    How it moved

    Probability plus extremal combinatorics → Erdős’s probabilistic method → Erdős–Rényi random graphs → threshold phenomena in networks

    Do not overclaim

    Positive probability proves existence but does not automatically give an efficient construction. Independent-edge models are not universal formation laws for real social or biological networks.

    Evidence sources
    Stable link to this scene
    BudapestUrbana

  14. 14 · 1976 CE

    Urbana · Main activity

    Sharing Thousands of Cases with a Computer to Prove Four Colors Suffice — Appel and Haken

    At the University of Illinois, Appel and Haken reduced the four-color theorem to a finite unavoidable set of configurations and checked the cases by computer. Human reduction arguments, programs, and machines formed one proof. The computer did not prove the result alone, and the original code and verification practices are not treated as beyond criticism by today’s standards.

    PAUSE AND ASK

    To what extent is a computer check of thousands of human-unreadable cases one proof?

    How the idea changed

    Combine a human reduction from infinitely many maps to a finite unavoidable set with computation checking the remaining cases.

    What this place made possible

    University of Illinois computers, graph theorists, programming, and checking practices supplied infrastructure for long case analysis.

    How it moved

    Nineteenth-century map coloring → reducible configurations and unavoidable sets → Appel–Haken programs → later proofs and formal verification

    Do not overclaim

    The computer did not invent the theorem or reduction, and the 1976 computation is not romanticized under today’s reproducibility standards. Later simplifications and checks continued.

    Evidence sources
    Stable link to this scene
    UrbanaCambridge

  15. 15 · 2009 CE

    Cambridge · Data release

    Opening a Proof on a Blog so Dozens Could Repair It Together — Polymath

    A public blog invitation initiated by Timothy Gowers in Cambridge became a collaboration among researchers in many countries on a new proof of the density Hales–Jewett theorem. The final paper used the collective author D. H. J. Polymath. Cambridge marks the invitation’s starting point, not ownership of a distributed result, and open collaboration is not assumed to be automatically equitable for every problem or participant.

    PAUSE AND ASK

    When unfinished proof fragments are public, how do the units of authorship, verification, and discovery change?

    How the idea changed

    Move from a few named authors behind a finished paper to distributed problem solving that shares comments, failures, and lemmas in real time.

    What this place made possible

    A Cambridge-initiated public invitation and blog infrastructure enabled cross-border participation, later synthesized in a paper under a collective name.

    How it moved

    Density Hales–Jewett problem → Gowers’s public invitation → blog comments, wiki, and distributed review → D. H. J. Polymath paper

    Do not overclaim

    Cambridge marks the invitation’s start, not ownership of a distributed result. Comment counts neither measure every contribution nor remove all barriers to participation.

    Evidence sources
    Stable link to this scene

FOUR WAYS TO OUTRUN ENUMERATION

Touch the moment possibility becomes structure

Start with a recurrence, translate paths into choices, compress partitions with a generating-function viewpoint, then discover order that no coloring can avoid. Every state stays in the URL, with no login and no free-form response collection.

Rhythm recurrence

Split by the last syllable

COUNT BY THE LAST CHOICE

A poem hides a recurrence

Let a short syllable use one beat and a long syllable use two. Every rhythm of n beats ends in exactly one of them, so the count is F(n−1)+F(n−2). This is an old prosodic counting idea, not modern binary notation.

all rhythms

34

recurrence

21 + 13

FIRST PATTERNS

1=short · 2=long

Showing 18 of 34 rhythms. The recurrence counts the rest without rendering them.

Evidence boundary: these are transparent finite models. They illustrate recurrence, bijection, partition growth, and R(3,3)=6; they do not prove general Ramsey numbers, convergence of every generating function, or efficient algorithms for arbitrary combinatorial problems.

TOUCH THE MATHEMATICS

When Choices Outgrow the Universe — From Counting Possibilities to Inevitable Structure

Begin with arranging short and long syllables, then move through lattice paths, integer partitions, colorings, and networks. Follow binomial expansions in Baghdad, prosodic recurrences in Patan, triangular arrays in Hangzhou, systems of combination in Paris and Leipzig, graphs and generating functions in Königsberg and Berlin, inevitability and probabilistic existence in Cambridge and Budapest, symmetry in Zürich, computer-assisted proof in Urbana, and internet collaboration. The journey asks how a subject that counts every possibility learned to prove structure without seeing every case.

Replay the fifteen-scene cinematic journey

OPEN THE FULL MAP

See the fractal hidden in Pascal-triangle parity

Find the repeating odd-even rule without expanding every huge binomial coefficient, and watch counts of choices become a self-similar pattern.

Explore the full map