81:. Chapter three concerns two-dimensional rigidity, the concepts of infinitesimal and generic rigidity, the combinatorial and algorithmic aspects of the subject, and the obstacles to extending this theory to three dimensions. A final chapter describes the history of rigidity theory, applications including
45:
primarily concern systems of rigid rods, connected to each other by flexible joints at their ends; the question is whether these connections fix such a framework into a single position, or whether it can flex continuously through multiple positions. Variations of this problem include the simplest way
114:
recommend it to "Any reader with at least a slight mathematical background". To avoid demanding too much background of its readers, it is unable to present full proofs of some of its results, instead presenting them as intuitive proof sketches. A more advanced and rigorous treatment of the same
32:
as volume 25 of the
Dolciani Mathematical Expositions book series. The Basic Library List Committee of the Mathematical Association of America has recommended its inclusion by undergraduate mathematics libraries.
122:
It includes exercises for students, making it suitable as an undergraduate textbook. Reviewer Tiong Seng Tay describes it as "an excellent expository book".
151:
163:
29:
108:, but beyond that level of background material it does not demand much mathematical sophistication. More generally, the editors of
356:
351:
62:
46:
to add rods to a framework to make it rigid, or the resilience of a framework against the failure of one of its rods.
177:
346:
93:, the rigidity of molecules in chemistry, and even art. It also discusses open problems for research in this area.
70:
286:
105:
82:
25:
295:
244:
323:
258:
224:
262:
220:
78:
340:
86:
58:
74:
66:
314:
110:
54:
327:
215:
90:
21:
Counting on
Frameworks: Mathematics to Aid the Design of Rigid Structures
299:
65:
of a mechanical system. The second chapter provides an introduction to
253:
69:, the one-dimensional theory of rigidity through the analysis of the
61:
the grid to make it rigid, as a way of introducing the notion of the
28:. It was written by Jack E. Graver and published in 2001 by the
24:
is an undergraduate-level book on the mathematics of
119:(1993), a graduate textbook co-authored by Graver.
77:problem in terms of connectivity of an associated
53:into four chapters. The first chapter studies
49:To study this question, Graver has organized
8:
275:
273:
271:
239:
237:
235:
233:
189:The London Mathematical Society Newsletter
145:
143:
141:
139:
137:
135:
104:expects its readers to be familiar with
131:
16:2001 mathematics book by Jack E. Graver
280:Schneider, Leo (May 2002), "Review of
73:of graphs, and a reformulation of the
204:
202:
200:
198:
7:
209:Tay, Tiong Seng (2002), "Review of
164:Mathematical Association of America
30:Mathematical Association of America
14:
176:Lloyd, E. Keith (April 2002),
150:Langton, Stacy G. (May 2002),
1:
322:(1–2): 253–261, June 2002,
41:The problems considered by
373:
328:10.1112/s0025579300016223
115:material can be found in
357:Mathematics of rigidity
287:The Mathematics Teacher
352:2001 non-fiction books
282:Counting on Frameworks
249:Counting on Frameworks
211:Counting on Frameworks
180:Counting on Frameworks
154:Counting on Frameworks
117:Combinatorial Rigidity
106:multivariable calculus
102:Counting on Frameworks
97:Audience and reception
51:Counting on Frameworks
43:Counting on Frameworks
71:connected components
245:Servatius, Brigitte
83:mechanical linkages
26:structural rigidity
63:degrees of freedom
347:Mathematics books
364:
331:
330:
312:"Book Reviews",
309:
303:
302:
277:
266:
265:
241:
228:
227:
206:
193:
192:
186:
173:
167:
166:
147:
372:
371:
367:
366:
365:
363:
362:
361:
337:
336:
335:
334:
311:
310:
306:
279:
278:
269:
243:
242:
231:
208:
207:
196:
184:
175:
174:
170:
149:
148:
133:
128:
99:
79:bipartite graph
57:and methods of
39:
17:
12:
11:
5:
370:
368:
360:
359:
354:
349:
339:
338:
333:
332:
304:
267:
229:
194:
168:
130:
129:
127:
124:
98:
95:
87:geodesic domes
38:
35:
15:
13:
10:
9:
6:
4:
3:
2:
369:
358:
355:
353:
350:
348:
345:
344:
342:
329:
325:
321:
317:
316:
308:
305:
301:
297:
293:
289:
288:
283:
276:
274:
272:
268:
264:
260:
256:
255:
250:
247:, "Review of
246:
240:
238:
236:
234:
230:
226:
222:
218:
217:
212:
205:
203:
201:
199:
195:
190:
183:
181:
172:
169:
165:
161:
157:
155:
146:
144:
142:
140:
138:
136:
132:
125:
123:
120:
118:
113:
112:
107:
103:
96:
94:
92:
88:
84:
80:
76:
72:
68:
64:
60:
59:cross bracing
56:
52:
47:
44:
36:
34:
31:
27:
23:
22:
319:
313:
307:
291:
285:
281:
252:
248:
214:
210:
188:
179:
171:
159:
153:
121:
116:
109:
101:
100:
75:grid bracing
67:graph theory
55:square grids
50:
48:
42:
40:
20:
19:
18:
315:Mathematika
191:(303): 9–10
178:"Review of
160:MAA Reviews
152:"Review of
111:Mathematika
341:Categories
294:(5): 392,
263:0982.52019
216:MathSciNet
126:References
91:tensegrity
300:20871062
225:1843781
298:
261:
254:zbMATH
223:
37:Topics
296:JSTOR
185:(PDF)
324:doi
284:",
259:Zbl
251:",
213:",
343::
320:49
318:,
292:95
290:,
270:^
257:,
232:^
221:MR
219:,
197:^
187:,
162:,
158:,
134:^
89:,
85:,
326::
182:"
156:"
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.