Chain counting — the series
-
Counting without an index
A person counting spirals on a cone puts a finger on one scale, follows a family round, and counts how many distinct chains there are. That needs no order of arrival — and building it turns out to be strictly more general than the counter that reads the order of arrival, and to find a bug in the counting of a bijugate stem that nothing had caught.
-
A counter that cannot be slid
The counter that needs no order of arrival follows each family into chains and counts them, and on an ideal lattice it agrees with the counter that does. On a stem whose rise falls it works only inside a band of widths, and outside the band it returns a pair rather than refusing: the rung below when the band is too narrow for the larger count, a pair on no rung when the band spans more than about a third of a rung of rise. The upper edge moves with the rate, so a width that is right on one stem is wrong on another, and on the fastest bijugate stem measured no width works at all.
-
A band that follows the rise
The index-free counter reads a growing stem only inside a band of widths, and the upper edge is a third of a rung of rise rather than a number of organs — so a width right on one stem is wrong on another. A counter that fits the decay of the rise through the spacings of its own band's whorls, and takes the band spanning a third of a rung, chooses 49, 97 and 193 organs on stems falling over 150, 300 and 600. Given no width at all it reads within eight points of the best of eighteen fixed widths on six of the seven stems, matching it exactly on one and beating it on two. Refusing any band too narrow to have shown the rung above the pair it counted removes every reading of the rung below, on every stem — and costs between five and fifty-one points of correct reading to do it.