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 THIS RIVER DOES NOT CLAIM
The river is not geography. Distance downstream stands for time passing, and the light turns from dawn to dusk as the centuries go by. The objects by each stele are symbols of the kind of event and of how each century band wrote and calculated; they do not reconstruct any real artefact. The land around each stop sketches the natural geography of the scene’s real place, and an iconic building appears only if it already stood in that year. Each scene keeps its real place and evidence basis; open it on the map to read where it happened. 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.
WHAT YOU SEE ON THIS RIVER
- Diagram in the sky
- Choices doubling at every branch
- Emblem at the source
- A branching tree of choices
- The real place around each stop
- Around each stele the land takes on the natural geography of that scene’s real place — sea or lake, plain, hills or mountains, the colour of the ground and its common trees — and, where one defines the place, its landform: a volcano, snow peaks, granite domes, a mesa, dunes, a fjord, islands, a rock hill, a gorge or loess terraces. The water near the stop takes the colour of the real river or sea, and the haze the place’s climate. A small globe on the stele marks where it is, with the route from the previous place. Where a city has an iconic building that already stood in the scene’s year, its schematic silhouette rises behind the stop and is named on the card. The land follows today’s terrain and climate as a sketch and the silhouettes are not measured reconstructions. Between stops the river itself stays symbolic.
- A figure board at every stop
- Each board draws the mathematics of that scene. When the boat arrives, the construction is drawn in and the key result rises in red. The drawings are schematic reconstructions, not historical manuscripts.
- Century bands along the banks
- 500–1449 · Stone stele · paper lanterns · single-arch bridge · watermills and villages · lateen boats
- 1450–1749 · Marble stele · iron lanterns · three-arch bridge · windmills and clock-tower towns · sailing ships
- 1750–1899 · Cast-iron plaque · gas lamps · iron truss bridge · factory chimneys, railway and steam train · steamboats
- 1900–1969 · Concrete marker · electric streetlights · concrete bridge · pylons, apartment blocks and radio masts · barges · aircraft
- 1970 onward · Glass marker · LED lights · cable-stayed bridge · glass towers, wind turbines and data centres · ferries · satellites
Where the century band changes, the boat passes under a bridge of the new band. Villages, mills, factories, pylons and towers stand for the technology of each century, not for any real place or architectural style.
01·c. 1000 CE·Baghdad(basis: 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 thinking changed
- Move from separate expansions to a recursive triangle in which neighboring coefficients build the next row.
- What we cannot claim
- 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.
- This place
- Baghdad’s networks of books, scholars, and administrative calculation supported long-form algebraic rules drawing on multiple arithmetic traditions. (Tigris banks · date palms · flat plain · 33.3°N 44.4°E)
- Figure board
- A stepped table lists each power’s coefficients in a column; two neighbours in one column make the next column’s entry.
- On the river
- A desk holding a written record · 500–1449 (Stone stele · paper lanterns · single-arch bridge · watermills and villages · lateen boats)
02·c. 1150 CE·Patan(basis: 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 thinking changed
- Instead of listing rhythms, split by a short or long final syllable to obtain F(n)=F(n−1)+F(n−2).
- What we cannot claim
- 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.
- This place
- Patan’s Chaulukya court and Jain scholarly networks supported sustained work spanning prosody, grammar, lexicography, and history. (Dry plain · thorn scrub · flat land · 23.8°N 72.1°E)
- Figure board
- The eight rhythms filling five beats with one- and two-beat syllables split by their last syllable into 5 + 3.
- On the river
- A place of ongoing work, marked only by the route’s emblem · 500–1449 (Stone stele · paper lanterns · single-arch bridge · watermills and villages · lateen boats)
03·1261 CE·Hangzhou(basis: 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 thinking changed
- Read a table of numbers not as one answer but as a recurrence tool shared by many calculations.
- What we cannot claim
- Yang Hui himself credited Jia Xian. Hangzhou marks the author’s region and scholarly network, not a proven print shop or invention site.
- This place
- The print, educational, and commercial setting of the Southern Song capital region helped reproduce calculation books for wider readers. (West Lake · lake islets · tea hills · 30.3°N 120.2°E · landmark: Leifeng Pagoda (975), Liuhe Pagoda (1165))
- Figure board
- A triangle written in counting-rod numerals; one row, 1·4·6·4·1, is lifted out and reused on the counting board.
- On the river
- A desk holding a written record · 500–1449 (Stone stele · paper lanterns · single-arch bridge · watermills and villages · lateen boats)
04·1654 CE·Paris(basis: 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 thinking changed
- Unify an array’s recurrence as a proof device for choices, binomial powers, and probability.
- What we cannot claim
- 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.
- This place
- Parisian correspondence, print, salons, and readers interested in games of chance encouraged rules to be organized as proofs. (Seine banks · broadleaf trees · flat basin · 48.9°N 2.4°E · landmark: Notre-Dame de Paris (1250))
- Figure board
- In the arithmetical triangle filled by adjacent sums, the diagonal 1·4·6·4·1 splits an interrupted game’s stakes 11 : 5.
- On the river
- A desk holding a written record · 1450–1749 (Marble stele · iron lanterns · three-arch bridge · windmills and clock-tower towns · sailing ships)
05·1666 CE·Leipzig(basis: 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 thinking changed
- Expand counting beyond particular games and arrays into a dream of organizing concepts and arguments universally.
- What we cannot claim
- 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.
- This place
- Leipzig’s university and Latin print networks turned a young scholar’s dissertation into a program visible to European readers. (Riverside woods · broadleaf trees · flat plain · 51.3°N 12.4°E)
- Figure board
- Basic elements a, b, c, d combine in layers of two, three and four; the assembly of abc is traced in red.
- On the river
- A stack of books · 1450–1749 (Marble stele · iron lanterns · three-arch bridge · windmills and clock-tower towns · sailing ships)
06·1736 CE·Königsberg(basis: 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 thinking changed
- Compress geography into vertex degrees and incidence, deciding impossibility without listing every walk.
- What we cannot claim
- The pin marks the problem setting. Euler worked in Saint Petersburg, and the 1736 scene is not called the completion of modern graph theory.
- This place
- Königsberg’s actual layout of river branches, islands, and bridges supplied a recurring walking puzzle fit for abstraction. (Pregel banks · broadleaf trees · flat land · 54.7°N 20.5°E · landmark: Königsberg Castle (1257))
- Figure board
- Four land masses and seven bridges shrink to four points and seven lines; every degree is odd, so no walk crosses each once.
- On the river
- A place of ongoing work, marked only by the route’s emblem · 1450–1749 (Marble stele · iron lanterns · three-arch bridge · windmills and clock-tower towns · sailing ships)
07·1741 CE·Berlin(basis: 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 thinking changed
- Replace direct lists with generating functions and infinite products whose coefficients carry the answers.
- What we cannot claim
- 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.
- This place
- Berlin Academy support and correspondence let Euler continue long calculations while retaining publication ties with Saint Petersburg. (Spree banks · pines · flat land · 52.5°N 13.4°E)
- Figure board
- Expanding 1/(1−x)(1−x²)⋯ gives coefficients 1, 1, 2, 3, 5, 7 — partition counts; the five partitions of 4 become 5x⁴.
- On the river
- A desk holding a written record · 1450–1749 (Marble stele · iron lanterns · three-arch bridge · windmills and clock-tower towns · sailing ships)
08·1857 CE·London(basis: 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 thinking changed
- Turn nested algebraic and differential expressions into rooted combinatorial trees.
- What we cannot claim
- 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.
- This place
- Working as a lawyer in London while publishing mathematics, Cayley organized extensive symbolic calculation across professional and journal networks. (Thames banks · broadleaf trees · flat basin · 51.5°N 0.1°W · landmark: St Paul’s Cathedral (1710), Tower of London (1100))
- Figure board
- Every rooted tree on one to four points is drawn and counted 1, 1, 2, 4; with five points there are nine.
- On the river
- A stack of books · 1750–1899 (Cast-iron plaque · gas lamps · iron truss bridge · factory chimneys, railway and steam train · steamboats)
09·1918 CE·Cambridge(basis: 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 thinking changed
- Read generating-function coefficients through complex-plane integration, widening exact enumeration into asymptotic growth.
- What we cannot claim
- 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.
- This place
- Wartime Cambridge’s university, correspondence, and journal setting let Ramanujan and Hardy shape different techniques into a long joint argument. (River Cam · willows · flat fen edge · 52.2°N 0.1°E)
- Figure board
- Integrating the generating function around a circle in the complex plane gives an asymptotic curve that hugs the true p(n).
- On the river
- A desk holding a written record · 1900–1969 (Concrete marker · electric streetlights · concrete bridge · pylons, apartment blocks and radio masts · barges · aircraft)
10·1930 CE·Cambridge(basis: 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 thinking changed
- Move beyond finding one arrangement to proving a threshold at which every coloring contains order.
- What we cannot claim
- 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.
- This place
- Cambridge’s community across logic, mathematics, and philosophy supported Ramsey’s development of a lemma for formal logic into a theorem about finite structure. (River Cam · willows · flat fen edge · 52.2°N 0.1°E)
- Figure board
- Two-colour the pairs of a large enough set and a one-colour part must appear; the six-point triangle, R(3,3) = 6, is a small case.
- On the river
- A stack of books · 1900–1969 (Concrete marker · electric streetlights · concrete bridge · pylons, apartment blocks and radio masts · barges · aircraft)
11·1935 CE·Budapest(basis: 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 thinking changed
- Move from one diagram to extremal questions about geometric structure unavoidable across all arrangements.
- What we cannot claim
- 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.
- This place
- An informal Budapest problem circle gave young mathematicians a shared setting to test and generalize Esther Klein’s observation. (Danube banks · Gellért Hill · broadleaf trees · 47.5°N 19.0°E · landmark: Hungarian Parliament Building (1904), Széchenyi Chain Bridge (1849))
- Figure board
- Five points, no three in line: whether the hull is a pentagon, quadrilateral or triangle, four of them form a convex quadrilateral.
- On the river
- A place of ongoing work, marked only by the route’s emblem · 1900–1969 (Concrete marker · electric streetlights · concrete bridge · pylons, apartment blocks and radio masts · barges · aircraft)
12·1937 CE·Zurich(basis: 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 thinking changed
- Count colorings fixed by each symmetry and average them, placing the definition of ‘same’ inside the calculation.
- What we cannot claim
- 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.
- This place
- ETH Zürich’s mathematical, physical, and educational setting let group symmetries and chemical-isomer enumeration meet in one language. (Lake Zurich · Alpine snow peaks · wooded hills · 47.4°N 8.5°E · landmark: Grossmünster (1787))
- Figure board
- Four-bead two-colour necklaces: averaging the colourings each rotation fixes — 16, 2, 4, 2 — gives 6, not 16 divided by 4.
- On the river
- A stack of books · 1900–1969 (Concrete marker · electric streetlights · concrete bridge · pylons, apartment blocks and radio masts · barges · aircraft)
13·1959 CE·Budapest(basis: 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 thinking changed
- Prove existence through averages and thresholds in a probability space without inspecting all objects or explicitly constructing one.
- What we cannot claim
- 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.
- This place
- The Hungarian Academy’s mathematical institute and Budapest’s problem-centered networks supported Erdős and Rényi’s collaboration on random graphs. (Danube banks · Gellért Hill · broadleaf trees · 47.5°N 19.0°E · landmark: Hungarian Parliament Building (1904), Széchenyi Chain Bridge (1849))
- Figure board
- Samples of random edges on the same seven points: if a property appears with probability above zero, such a graph exists.
- On the river
- A stack of books · 1900–1969 (Concrete marker · electric streetlights · concrete bridge · pylons, apartment blocks and radio masts · barges · aircraft)
14·1976 CE·Urbana(basis: 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 thinking changed
- Combine a human reduction from infinitely many maps to a finite unavoidable set with computation checking the remaining cases.
- What we cannot claim
- 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.
- This place
- University of Illinois computers, graph theorists, programming, and checking practices supplied infrastructure for long case analysis. (Prairie · broadleaf trees · flat farmland · 40.1°N 88.2°W)
- Figure board
- A map coloured with four patterns beside a finite unavoidable set of configurations, each checked off by machine.
- On the river
- A place of ongoing work, marked only by the route’s emblem · 1970 onward (Glass marker · LED lights · cable-stayed bridge · glass towers, wind turbines and data centres · ferries · satellites)
15·2009 CE·Cambridge(basis: 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 thinking 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 we cannot claim
- Cambridge marks the invitation’s start, not ownership of a distributed result. Comment counts neither measure every contribution nor remove all barriers to participation.
- This place
- A Cambridge-initiated public invitation and blog infrastructure enabled cross-border participation, later synthesized in a paper under a collective name. (River Cam · willows · flat fen edge · 52.2°N 0.1°E)
- Figure board
- Beside a combinatorial line 11·22·33 in the 3 × 3 grid, public comment fragments pass dead ends and lemmas into one proof.
- On the river
- Glowing data columns · 1970 onward (Glass marker · LED lights · cable-stayed bridge · glass towers, wind turbines and data centres · ferries · satellites)