Machine Kinematics
solved, then drawn
Concept

Link assortment — where it appears

How many links carry two joints, how many three, how many four. It is the coarsest thing that can tell two chains apart, it is what every published census table is organised by, and it is emphatically not sufficient — Watt's chain and Stephenson's share theirs and are different chains.

Named by 10 essays across 3 fields — each of them below, with the objects they name alongside it.

One, two, sixteen, two hundred and thirty. Every planar chain of mobility one, up to ten links, counted by enumeration rather than quoted. The pins column is forced: a chain of 10 links has one degree of freedom only if it has exactly (3n − 4)/2 pins, which is why no odd link count appears. Pass the count is how many graphs satisfy Grübler's rule, are connected, are simple and give every link at least two pins. Are chains is how many of those survive the fourth condition, that no proper subchain is already a structure — and the gap between the two columns is the whole of this field's first argument: at ten links 1,878 graphs pass a rule that 230 of them deserve. Mechanisms is larger again, because a chain is not a mechanism until a link is held still, and how many different mechanisms that gives is a question about the chain's own symmetry.

The mechanism is the graph

Twenty-one fields of this site have been handed a mechanism and asked what it does. Take the mechanism away and keep only which link is pinned to which, and there is still a finite list of answers: one chain of four links, two of six, sixteen of eight, two hundred and thirty of ten — and 1,878 graphs at ten links that pass every count and are not among them.

topology · Topology Same links, same pins, different chains. Watt chain on the left and Stephenson chain on the right. They have the same number of links, the same number of pins and the same assortment — 4×2 + 2×3 — so no count of anything can tell them apart. What differs is where the pins go: on the left the two ternary links share a pin, on the right they do not, and that single fact makes two mechanisms with different coupler curves, different numbers of inversions and different position problems. It is the smallest case in the subject of the thing this field exists to say: the arithmetic is a filter and the graph is the answer.

Same links, same pins, different machines

Watt's six-bar and Stephenson's have six links, seven pins, four binary links and two ternary ones. Every count anybody can make on them agrees. They are different chains, they give two mechanisms and three, and the difference is whether the two ternary links share a pin.

topology · Topology Different numbers of ternary links, and the same spectrum. Two of the 230 ten-link chains whose adjacency matrices have identical characteristic polynomials — identical in every one of the eleven coefficients — and which are not the same chain. They do not even share their assortment — 6×2 + 2×3 + 2×4 on the left and 4×2 + 6×3 on the right. Counting the ternary links tells them apart and the spectrum does not. That is worth pausing on: the spectrum is the more sophisticated invariant, it is the one that got written into the literature as a test, and here it is beaten by the first thing anybody would try. The polynomial both of them have is λ^10 − 13λ^8 + 52λ^6 − 4λ^5 − 76λ^4 + 8λ^3 + 32λ^2.

Right until the size nobody checked

The characteristic polynomial of a chain's adjacency matrix is a fingerprint that costs nothing and separates every six-link chain and every eight-link one. At ten links it fails on two pairs — and on one of them, counting the ternary links tells the two chains apart while the polynomial does not.

topology · Topology Colour by degree, recolour by neighbours' colours, stop when nothing changes. The cheap half of every isomorphism routine there is, and the half that does most of the work. Start by colouring each link with how many pins it carries. Then repeatedly recolour it with its own colour plus the multiset of its neighbours', until a pass changes nothing. On this chain the process ends with 3 classes of sizes 2, 2, 2, and two links of different colours are certainly different links — no relabelling can carry one to the other. What refinement cannot do is separate links that are alike to every local measurement, and that residue is what the backtracking search is for. It is also, exactly, why a spectral test fails: an eigenvalue is a global average over walks and has no more to say about two locally identical links than the refinement does.

Deciding that two chains are one

Two chains are the same chain when a relabelling of the links carries one to the other. Ten links admit 3,628,800 relabellings, and the census asks the question 26,335 times — so the answer is not a search but a rule that picks one labelling out of the graph itself, and asking whether the two strings match.

topology · Topology The five six-bar mechanisms, and there are only two chains. Two chains and five machines. Watt's chain has two orbits of links, so grounding it gives two mechanisms; Stephenson's has three. The frame is drawn dark in each. This is the whole of what "Watt I", "Watt II", "Stephenson I, II and III" name — not five linkages somebody invented, but two graphs and the five genuinely different links there are to bolt down. Anyone who has met the names as a list of five things has met the answer without the question, and the question is a count of orbits.

Which link to bolt down

A chain is not a machine until one of its links is held still, and which one is a decision. Two links give the same machine exactly when a relabelling of the whole chain carries one to the other — so the number of mechanisms a chain gives is a count of orbits, and the classical five six-bars and seventy-one eight-bars are that count.

topology · Topology The search generates 3,000 candidates for 1,878 answers. How much work the enumeration does, against how much it has to show for it. The upper line is the number of complete labelled graphs the search reaches and the lower is the number of distinct graphs they turn out to be, so the vertical gap is waste — every candidate above the lower line is a graph the search had already found under a different labelling. At eight links the unpruned version of this search generated 8,494 candidates for the same 71 answers, and at ten links it did not finish at all; with the pruning it generates 3,000 for 1,878 in 442 milliseconds. The rule that does it is one line long: when two links carry the same number of pins, reject the labelling that would be lexicographically smaller if they were swapped. It cannot reject a labelling that is the largest in its class, so nothing is lost, and it is not a complete test, which is why the canonical form is still taken at the end.

The candidates a search throws away

The obvious enumeration generates every labelling of every chain and keeps one. At eight links that is 8,494 complete graphs for 71 answers; at ten it does not finish. One rule — reject the labelling that a swap of two equal links would improve — takes it to 3,000 candidates for 1,878 answers in half a second, and twelve links is still out of reach.

topology · Topology A catalogue is a search space, and a requirement is a filter on it. What a census is for. Four requirements applied in turn to the 230 ten-link chains, each of them a statement about the graph alone: a link carrying four pins, a link none of whose neighbours is binary, and a way of driving it that comes apart into dyads. 26 chains survive all of them. None of this is dimensional synthesis and none of it can be — no requirement here mentions a length, an angle or a position, and every one of them can be checked before a single dimension is chosen. That is the argument for having the census at all: the design problem is a search over shapes within a topology, and knowing which topologies there are turns an open question into 26 closed ones.

Choosing the chain before the lengths

Every synthesis method on this site starts by assuming a topology, and the assumption is usually a habit. What the graph fixes before any dimension is chosen is the number of free parameters — two per pin less four — and therefore how many positions can be prescribed at all.

synthesis · Synthesis 11 assortments are arithmetically possible and 7 contain a mechanism. The 10-link census organised the way every published table organises it: by how many links carry two pins, three, four and more. The assortments themselves are a small piece of arithmetic — the degrees must sum to twice the pin count and none may be below two — and it admits 11 of them. 4 contain no chain at all. Each of those 4 needs a link carrying six, seven or eight pins, and a link with that many pins in a chain this small always drags a structure in with it: the graphs exist, they satisfy Grübler exactly, and every one of them has a rigid subchain. That is a result the arithmetic cannot reach, because the arithmetic never looks at where a pin goes.

Eleven assortments and four that are empty

How many links carry two pins, how many carry three, how many carry four: two lines of arithmetic admit eleven answers at ten links. Seventy-eight graphs have degrees the last four of them describe, every one of those graphs satisfies Grübler's rule exactly, and not one of them is a mechanism.

topology · Topology In space the arithmetic allows almost nothing. A body in space has six freedoms and a revolute joint takes five, so a mobility of one needs (6n − 7)/5 joints — and that is an integer only when the link count leaves a remainder of two on division by five. The whole table is this: 7, 12, 17, 22 links, and nothing else. At seven links the degrees must sum to fourteen across seven links with none below two, so every link is binary and the graph is a single seven-cycle: there is exactly one spatial chain, and it is a loop. That is the census explanation for something the spatial field has lived with since it was written — every spatial mechanism on this site is one closed loop — and it had never been stated as a count. The next admissible size is twelve links and thirteen joints, where two assortments are arithmetically possible, 157 candidates give 33 graphs, and 5 of them are chains — every one with ten binary links and two ternary, so the assortment with a quaternary link is empty exactly as four of the planar ones are.

In space there is one chain

A body in space has six freedoms and a revolute joint takes five, so a mobility of one needs (6n−7)/5 joints — an integer only when the link count leaves a remainder of two on division by five. At seven links every link is binary, the graph is a single seven-cycle, and there is exactly one spatial chain.

spatial · Spatial A catalogue is a search space, and a requirement is a filter on it. What a census is for. Four requirements applied in turn to the 230 ten-link chains, each of them a statement about the graph alone: a link carrying four pins, a link none of whose neighbours is binary, and a way of driving it that comes apart into dyads. 26 chains survive all of them. None of this is dimensional synthesis and none of it can be — no requirement here mentions a length, an angle or a position, and every one of them can be checked before a single dimension is chosen. That is the argument for having the census at all: the design problem is a search over shapes within a topology, and knowing which topologies there are turns an open question into 26 closed ones.

A catalogue is a search space

Dimensional synthesis searches over lengths within a topology, and the topology is chosen first — usually from memory, usually from a list of five. With a census the list is two hundred and thirty, every requirement that reads only the graph is a filter on it, and the choice stops being a habit.

topology · Topology

Named alongside it

The objects these essays reach for when they reach for this one.

Kinematic chainType synthesisInversionCanonical formGraph isomorphismDegenerate chainMobilityAutomorphismEnumerationOrbitAssur groupDegrees of freedom

All concepts