Where the angle comes from

A counter on the settling table

The settling table has reported an angle for every run that reaches a lattice, and nobody has ever counted one. A hundred and seventeen settled runs, regrown and counted: every one of them has a parastichy pair, and sixty-five of them land on sequences the ladder does not carry.

Worth reading first: How long a stem takes to settle · The angle is an output · Counting the spirals.

The settling table grows a stem from each of nine starting angles at each of eight rises and four falloff exponents, and asks where each run ends up. Its answer is an angle: 137.8°, 99.0°, 42.3°. A hundred and seventeen of the two hundred and eighty-eight runs settle onto one.

An angle is not an arrangement. This collection’s whole position is that a pattern is counted rather than admired, and for five rounds the settling thread has reported angles and counted nothing. That is not a small oversight in a thread; it is the site’s own premise not being applied to one of its tables.

Every destination in the settling table, counted. One row per destination, placed across at the divergence the stems settled on and labelled with the parastichy pair a counter returns at the top of the run. 117 settled runs land on 15 destinations when two values within half a degree are called one. five of them sit on the golden or the Lucas sequence and ten do not, and the ones that do not are reached at every falloff exponent including the shallowest. Nothing here refuses to count: the settling test does not admit arrangements this collection would decline to call lattices.
Fig. 1 Every destination in the settling table with the parastichy pair a counter returns at the top of the run that reached it.

The design

Regrow every settled run from the three numbers that define it — the rise, the falloff exponent, the starting angle — and count the parastichies over its top two hundred organs. That is countedAbove, which is the counter every other measurement on this site uses, applied to a table it had never been pointed at.

Two seconds a run. A hundred and seventeen runs. It has been available since the table was first grown, and the whole exercise costs four minutes against the several hours the table itself took.

The two spiral families a counter finds between 0.43 and 0.67 of the radius. 21 spirals one way and 34 the other, found from the point positions alone — the counter is never told the divergence angle.
Fig. 2 What a count is: the two families of spirals a reader traces through a patch, read from the positions rather than from the angle.

Every one of them counts

All 117 return a pair. Not one refuses, and the refusals available are real: the counter asserts that its patch has two families crossing, and it declines a patch that does not.

That answers the first half of the question this design was set up for. If a steep rule settled a stem on 42.3° and no counter could count it, the settling test would be admitting arrangements this collection would refuse to call lattices. It is not.

What a divergence picked at random gives, at a rise of 0.008. Fibonacci pairs take 14.6% of the circle at this rise, and the share falls as the rise does. The claim that Fibonacci counts are what nature "prefers" needs the preference to come from somewhere, and it is not from the geometry being generous.
Fig. 3 A counted pair read off a stem’s own points, which is the operation applied to every settled run in the table.

Fifteen destinations, not forty-nine

Two settled values are the same destination when they are within half a degree of each other, which is two steps of the grid the azimuths are placed on. Read that way the 117 runs land on fifteen destinations, and the grouping is not delicate: the gaps inside a group are tenths of a degree and the gaps between groups are whole ones, so anything from a quarter of a degree to a degree gives the same fifteen.

Read to a tenth of a degree, which is what the table prints, they land on forty-nine. The difference between those two numbers is an essay of its own, and half a degree is the resolution used here throughout.

The destinations a steep rule reaches, read two ways. Above: the list read to a tenth of a degree, which is what the settling table prints — 13 entries. Below: the same list read at half a degree, which is two steps of the grid the azimuths are placed on — 3. The 10 entries the finer reading adds are destinations a shallow exponent also reaches, a tenth or two of a degree away, and a tenth of a degree is a fifth of one step of that grid. The pale marks are every destination in the table, for scale.
Fig. 4 The same set of destinations read at two resolutions, which is what turns forty-nine entries into fifteen.

Five on the ladder, ten off it

Of the fifteen, five return pairs on one of the two sequences this collection’s ladder is built from — the golden 1, 2, 3, 5, 8, 13 and the Lucas 1, 3, 4, 7, 11. The other ten do not.

That is the result. The settling rule has been reaching arrangements off both ladders at every exponent it has been grown at, including the exponent every other measurement on this site uses, and nothing asked what they were because the table reported an angle.

Every destination in the settling table, counted. One row per destination, placed across at the divergence the stems settled on and labelled with the parastichy pair a counter returns at the top of the run. 117 settled runs land on 15 destinations when two values within half a degree are called one. five of them sit on the golden or the Lucas sequence and ten do not, and the ones that do not are reached at every falloff exponent including the shallowest. Nothing here refuses to count: the settling test does not admit arrangements this collection would decline to call lattices.
Fig. 5 The ten destinations whose pairs are on neither of the collection’s two sequences.

Counting runs rather than destinations makes it sharper. The two most-visited destinations in the whole table are 151.0°, reached by twenty-three runs, and 79.2°, reached by nineteen. Neither is on the ladder.

Sixty-five of the 117 settled runs land off it. A majority of everything the settling test has ever produced is an arrangement this collection has no rung for, and the two that account for a third of the table on their own are the two that were never looked at.

Every divergence a stem settles on, by falloff exponent. One row per exponent, one mark per distinct settled divergence anywhere in that column, read to a tenth of a degree. This is the sharpest instrument in the sweep and the cheapest: it is already in every run, it does not average, and it is read on the same azimuth grid at every exponent. The steeper falloffs reach 42.3°, 47.9°, 148.1° — values that appear nowhere in the two shallower columns — while the traffic the other way is empty. So the exponent changes the map of where a stem can end up while leaving alone the share of starting angles that end up anywhere, which is a result a measurement of "did it settle" was never going to find.
Fig. 6 Where the settled runs end up, exponent by exponent, which is the table this counting was applied to.

Sixty-five is not sixty-five stems

The runs are not independent of each other in the way rows of a census usually are. Nine starting angles at one rise and one exponent are nine runs that share everything but where they began, so a destination reached by nine of them is one basin found nine times rather than nine findings.

Counted as basins the picture is the same shape and smaller: 151.0° is reached at several rises and exponents, 79.2° likewise, and both are reached from more starting angles than any golden destination. But the honest denominator is cells of the table rather than runs, and no essay in this thread has been quoting it.

How many starting angles reach a lattice, by rise and by falloff. Every cell is 9 stems grown from 9 starting angles spanning 40° to 180°, at one rise and one exponent in the placement rule's falloff, for 1200 organs each. The number is how many of them settle onto a lattice. Reading down a column, the basin closes as the rise falls, which is the wall. Reading across a row, nothing much happens: the exponent-three column is the published settling table digit for digit, and the other three are the same column inside their own sampling error. The account that a steeper falloff should wall somewhere else does not survive the table it predicted.
Fig. 7 The table itself, cell by cell. Each cell is nine runs sharing a rise and an exponent, which is the unit a share is really over.

Which is not a failure of the rule

It is a failure of the reading. The placement rule was never told about Fibonacci numbers: it puts each organ where the sum over its neighbours is least, and what comes out is an output rather than an input. That it comes out on the golden angle from some starting angles and on 151.0° from others is a fact about basins, not about the rule preferring anything.

What the collection has been doing is reading the table through a vocabulary with two sequences in it. Sixty-five runs did not fit the vocabulary and were reported as angles.

An angle is a perfectly honest thing to report and it is not nothing: 151.0° is a measurement, and every essay quoting it was quoting something true. What an angle cannot do is be recognised. A reader who knows 137.5° recognises it instantly and would not recognise 151.0° as a member of anything, which is how sixty-five runs became a set of numbers rather than a finding.

The share of starting angles that reach a lattice, by exponent. Each row pools one exponent's whole column — every rise, every starting angle — into one share, with a bar an error either side of it. Pooling is what makes the comparison possible: a single cell is 9 runs and carries an error of about 0.17, which is three times the whole spread between the four exponents. Pooled, the four sit at 30/72, 31/72, 29/72, 27/72 — a spread of 0.056 against an error of 0.058. Nothing in the falloff moves the basin. A five-angle version of the same sweep gave a clean monotone trend, which is what a null looks like when it is sampled too thinly.
Fig. 8 The share of starting angles that reach a lattice at all, which is the reading the table has been quoted for.

The off-ladder pairs are not a rabble

Every pair the counter returns is two consecutive terms of a sequence in which each term is the sum of the two before it — the ladder’s own rule, on different starting terms. 4/5 and 5/9 and 9/14 belong to 1, 4, 5, 9, 14. 5/7 and 7/12 and 12/19 belong to 2, 5, 7, 12, 19.

Ten such sequences account for all fifteen destinations, and two of them are the ladder’s.

The 10 sequences the settling table's destinations belong to. Every pair the counter returns is two consecutive terms of a sequence in which each term is the sum of the two before it, which is the ladder's own rule. two of these are the sequences this collection is built on. The rest are not, and they are not rare: the 1, 4, 5, 9, 14 sequence and the 2, 5, 7, 12, 19 sequence each supply several destinations, at every falloff exponent the table is grown at. The right-hand column is the divergences that land on each.
Fig. 9 The ten sequences, with the pairs seen on each and the destinations they were seen at.

A destination does not name a pair

Three of the fifteen return more than one. At 137.8° some runs count 5/8 and others 8/13; at 151.0° the counter gives 5/7, 7/12 and 12/19; at 79.2° it gives 4/5, 4/9 and 5/9 across nineteen runs.

That is not a failure of the counter. The pair a patch shows depends on the rise as well as on the divergence — a finer stem at the same angle shows a finer pair — and the runs at one destination are grown at different rises. It is worth saying because the settling table is indexed by angle, and an angle names a lattice only with a rise beside it.

Every transition as the rise falls. The pair climbs 1/2 → 2/3 → 3/5 → 5/8 → 8/13. Consecutive transitions are 0.382, 0.382, 0.382 of the previous rise — 1/φ² is 0.3820.
Fig. 10 The ladder itself: one divergence and a range of rises, giving a different counted pair at each rung.

Which makes the fifteen an undercount of the arrangements

Fifteen destinations, but more than fifteen arrangements: the pairs seen number seventeen across the table, and the same angle produces different ones at different rises.

A destination is a property of the rule — a value the divergence converges on — and a pair is a property of a patch. The settling table has been reporting the first and this collection cares about the second, which is exactly why the counting was worth doing and why its result is not a simple relabelling.

The spiral counts, band by band, in one head. The same flower gives 13/21, 21/34, 34/55, 55/89 at different radii. A caption saying "34 and 55 spirals" is a statement about one annulus.
Fig. 11 Why one arrangement can show more than one pair: the count depends on where in the pattern it is taken.

What the counter is

The same one. countedAbove reads the top two hundred organs of a run, builds the neighbour graph from the positions, and returns the two families that cross. It does not know the divergence and it is not given one.

Using the site’s own counter rather than a special one is the point. A count produced by a different instrument would make every comparison with the ladder a comparison of instruments, and this collection has been caught by that before — three functions sharing a name and doing different things is the standing example.

The two spiral families a counter finds between 0.68 and 0.92 of the radius. 34 spirals one way and 55 the other, found from the point positions alone — the counter is never told the divergence angle.
Fig. 12 The counting operation, drawn. Nothing in it is told the angle the stem settled on.

The window it reads through

Two hundred organs at the top of a twelve-hundred-organ run. That is the counter’s own default and the window every other count on this site is taken over, so a pair reported here and a pair reported by the ladder sweep are the same measurement.

It has not been varied here, which is a gap of the same shape as the reading windows in the ablation thread. Counting the same runs over a hundred organs and over four hundred is cheap and would say whether any of the multi-pair destinations are a window effect rather than a rise effect — and the counting radius is known to move a count on a disc, so the question is not idle.

The spiral counts four different divergence angles produce. Fibonacci counts come from one angle. The Lucas angle — which the same dynamical model reaches on a different branch — gives 47 and 76, and neither number is a Fibonacci number.
Fig. 13 Counts against angle at one rise, which is the relationship a window effect would distort.

What this does to the wall

Nothing. The wall is the finding that below a certain rise no starting angle reaches any lattice at all, and it is about the runs that fail to settle. Counting the ones that succeed does not touch it.

What it does change is the description of what lies above the wall. It is not a basin structure over the ladder with some strays; it is a basin structure over ten sequences, of which the ladder’s two are neither the largest nor the smallest.

The same table, grown 2.7 times as long. Every rise and every starting angle, grown to 1200 organs and then to 3200. The two middle columns are how many starting angles reached a lattice at each length, and they are the same column: of the 72 pairs of runs, 72 are identical organ for organ and 0 settle at the longer length after failing at the shorter one. Tripling the budget buys nothing anywhere. What the fine rises are short of is not run length: the share of starting angles that reach a lattice at all falls from 7 of 9 to 1, so the arrangements a stem could fall into have mostly stopped existing.
Fig. 14 The wall, which is a statement about runs that never settle and is unaffected by counting the ones that do.

What it does to the destinations essay

That essay reported three destinations only the steep exponents reach and asked what they would count as. The answer is 8/9, 8/15 and 2/5, and it is not the interesting half.

The interesting half is that the shallow exponents have been reaching off-ladder destinations all along, in larger numbers, and nobody had asked. A question about the new column turned out to be a question about the old ones.

How many starting angles reach a lattice, by rise and by falloff. Every cell is 9 stems grown from 9 starting angles spanning 40° to 180°, at one rise and one exponent in the placement rule's falloff, for 1200 organs each. The number is how many of them settle onto a lattice. Reading down a column, the basin closes as the rise falls, which is the wall. Reading across a row, nothing much happens: the exponent-three column is the published settling table digit for digit, and the other three are the same column inside their own sampling error. The account that a steeper falloff should wall somewhere else does not survive the table it predicted.
Fig. 15 The settling table by exponent. The off-ladder destinations are present in every column of it.

Three readings of one table

The settling table now carries three. The share of starting angles that reach a lattice, which is the reading it was built for and the noisiest — a binomial over nine runs, with a standard error of about 0.17 a cell. The time each run takes, which separates the exponents cleanly. And now the arrangement each run reaches, which is the only one of the three that says what came out.

Three readings of one grown table is the pattern this collection keeps arriving at, and the arrangement is the one the site’s own premise should have demanded first.

Two runs of the same rule from unrelated starting angles. Both settle at 137.0°, within 0.5° of the golden angle, from seeds 166° apart.
Fig. 16 A run settling onto its divergence, which is the object all three readings are readings of.

What a wider sweep would add

Nine starting angles is a coarse sample of a continuum. The ten sequences are the ones nine angles at eight rises reach, and there is no reason to think a hundred angles would find the same ten.

The prediction, if there is one, is that a denser sweep finds more sequences with smaller basins — that the number of destinations grows with the sampling rather than saturating. Twenty angles is 640 runs against 288, and it would say whether ten is a count or a floor.

Everywhere a cut of one to five organs can send a 5/8 stem. Every settled divergence reached by any arrangement of up to five organs removed from a stem at the 5/8 rung, on one axis. There are six of them and no more. three are slips of the lattice the stem was cut from: each keeps the lag-5 family intact and sits a whole number of turns of it from the next, which is the ladder marked below the axis with rungs 72.0 degrees apart. The other three keep no lag at all and sit near a fraction of a turn, marked above: 175.0 degrees near 1 of 2 turns, 190.0 degrees near 1 of 2 turns, 235.0 degrees near 2 of 3 turns. A stem that is cut either slides along the ladder it was on or leaves it for a lattice with files in it.
Fig. 17 The destinations a rule of this kind can reach across a range of starting angles, drawn densely rather than at nine points.

The cheap thing that was not done

Two seconds a run, on a table that had already cost hours to grow. The reason it was not done is that the table’s own reading — the share of starting angles that settle — is a share, and a share does not need the arrangement named.

Once the thread started asking about destinations rather than shares, the counting became obviously necessary, and it stayed undone for one more round because the question was phrased about three specific angles rather than about the table.

How many organs settling takes, by falloff exponent. One mark per stem that settles, placed at the organ from which every later divergence stays within a degree and a half of the run's own final value. At the exponent every other measurement here uses, the slowest is 290 organs — the number four rounds of this collection have carried as though it belonged to the rule. It belongs to the exponent: at 4 the slowest is 808 and at 5 it is 674. A table of shares cannot see this, because a stem that settles at organ 800 and one that settles at organ 8 are the same entry in it. And it is still not a shortage of time: of 72 pairs of runs grown to 1200 organs and then to 3200, 0 settle at the longer length after failing at the shorter.
Fig. 18 How long each run takes to settle, another reading of the same table that does not need an arrangement named.

What a reader of the ladder essays should adjust

The ladder is a description of what a stem grown at the golden angle does as the rise falls, and it is unaffected: its rungs are still its rungs and the counted pairs on them are still what a counter returns.

What changes is the sentence that puts the ladder at the centre of the rule’s behaviour. The rule does not preferentially produce the golden ladder from arbitrary starting angles; it produces one of several sequences depending on where the run began, and the golden one is the one the collection has been growing stems onto by choosing their seed.

six limit divergences, all of them 137.5078 over a whole number. The golden angle is the k = 1 member of a family. Real bijugate plants — teasel, Cephalaria — are reported near 68.75°, which is exactly half of it, and the pairs they are counted at are the Fibonacci pairs doubled.
Fig. 19 The angles a rule of this kind can converge on, which is a larger set than the ladder’s two.

What the ladder’s own share looks like

Fifty-two runs land on the ladder’s two sequences: twenty-seven on the golden and twenty-five on the Lucas. So the golden ladder — the sequence this whole subject is named for — accounts for twenty-three per cent of the settled runs in the table.

That number needs its caveat immediately. The starting angles are nine values spread across the useful half-circle, chosen without reference to any sequence, so the share is a share of an arbitrary sample rather than of anything a plant does. What it is not is evidence that the rule prefers the golden angle, which is a claim the table has sometimes been read as supporting.

A round trip on four heads of 900 primordia: the divergence angle recovered from each. The counter is shown the points and nothing else. The worst recovery across the four is 0.012°.
Fig. 20 The angle recovered from a settled run, which is the reading the table has been quoted on and which says nothing about which sequence it belongs to.

What is not claimed

That these arrangements occur in plants. Nothing here is a specimen, and the collection’s position on that is unchanged: the rule produces what it produces, and whether any of it is on a real stem is a survey nobody has done.

Nor that ten sequences is the complete list. It is the list this table reaches from nine starting angles at eight rises and four exponents, which is a sample of a continuum of starting angles, and a denser sample would very likely find more.

Every open question here needs under 28 specimens. The sample size at which each comparison reaches 80 per cent power at a 5 per cent false-positive rate, from the exact binomial rather than a normal approximation. The census question — do plants show consecutive Fibonacci pairs far more often than the geometry does — needs 4: 14.7% is the share of divergence angles giving a consecutive Fibonacci pair at a fine rise; 90% is what a grown history gives.
Fig. 21 What a survey would need to settle a claim about which arrangements occur, which is not what this table is.

The one line

Every one of the 117 settled runs in the settling table has a countable parastichy pair, so the settling test does not admit arrangements this collection would refuse to call lattices.

And sixty-five of them — a majority, including the table’s two most-visited destinations — land on sequences the ladder does not carry, at every falloff exponent including the one every other measurement here uses.

What links here

Computed from the collection, not written here: the essays that point at this one.

Shares its objects with

Essays that name at least two of the same things, and that neither author linked.

  • A period the grid invented — both name attractor, claim testing, divergence angle, honest limits, measurement, negative result, parastichy pair, the placement rule
  • The clock a share cannot see — both name attractor, basin, claim testing, exponent, honest limits, measurement, negative result, the placement rule
  • The stem that changed hands — both name attractor, basin, divergence angle, honest limits, initial condition, measurement, parastichy pair, the placement rule
  • A stem on the other branch — both name attractor, honest limits, initial condition, lucas numbers, measurement, parastichy pair, the placement rule
  • A wall and not a budget — both name attractor, basin, honest limits, initial condition, ladder, measurement, negative result
  • A wreck has a short list — both name attractor, basin, honest limits, measurement, negative result, parastichy pair, the placement rule

Named objects

A flat tag is an object no other essay names yet.

AttractorBasinCensusClaim testingCounting radiusDivergence angleExponentFibonacciHonest limitsInitial conditionLadderLucas numbersMeasurementNegative resultParastichy pairThe placement rule