Machine Kinematics
solved, then drawn
Concept

Degenerate chain — where it appears

A graph that satisfies every arithmetic condition on a kinematic chain and contains a proper subchain whose own mobility count is nought or less. It moves, and it moves as a mechanism with fewer links, one of which is welded out of several pieces — so the defect is in the description rather than in the assembly.

Named by 9 essays across 4 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 Three verdicts, and only one instrument can give all three. Every 10-link graph that satisfies Grübler's count, split by what is actually true of it. 230 are mechanisms with 10 links. 1,165 carry a subchain whose own count is exactly nought — and neither of the two standing routes can see them: the count returns one and the rank returns one, and both are right, because a rigid subchain removes exactly the freedoms it is supposed to. What is false is the description. 483 carry a subchain whose count is below nought, and those the rank does catch: the surplus pins repeat a constraint already imposed, the Jacobian loses rank, and the measured mobility comes out above the count. The third instrument — a count run over every subset of the links — is the only one that answers the question at all.

What a count cannot see

At ten links, 1,878 graphs satisfy Grübler's rule and 230 are mechanisms. The other 1,648 contain a subchain that is already a structure — and on 1,165 of them the count says one degree of freedom, the rank of the constraint Jacobian says one degree of freedom, and both are right about a mechanism that does not have ten links.

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 What each instrument returns, on each kind of graph. The 8-link census, three rows, and the same three questions asked of every graph in it. Grübler returns 1 in every row — it has to, because that is what the census selected on. The rank returns 1 in the first two rows and 2 in the third. Only the third column changes across all three rows, and it is the one this site did not have before this field: a mobility computed for every subset of the links rather than for the whole. Read down the middle two columns and the site's standing pair of routes is unanimous about 62 graphs, of which only 16 are what it says they are.

The count was right and the name was wrong

The constraint field has checked Grübler's count against a Jacobian rank since the foundation, and the two disagree only where the geometry is special. Here is an assembly where they agree, where both are correct, and where the mechanism does not have the number of links it is described as having.

constraint · Mobility 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 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 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.

Six things a chain is not

A count read as a verdict, a rank trusted where it is blind, a fingerprint used as a proof, a list of five taken for a complete one, a solver treated as a convenience, and a census read as a catalogue of machines. Six claims, each with the number that kills it.

wrong · Misconception

Named alongside it

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

Kinematic chainType synthesisLink assortmentMobilityCanonical formGraph isomorphismInversionGrübler's criterionConstraintDegrees of freedomEnumerationOverconstraint

All concepts