The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Infinitesimally rigid polyhedra. I. Statics of frameworks
Open accessAbstract
From the time of Cauchy, mathematicians have studied the motions of convex polyhedra, with the faces held rigid while changes are allowed in the dihedral angles. In the 1940s Alexandrov proved that, even with additional vertices along the natural edges, and with an arbitrary triangulation of the natural faces on these vertices, such polyhedra are infinitesimally rigid. In this paper the dual (and equivalent) concept of static rigidity for frameworks is used to describe the behavior of bar and joint frameworks built around convex (and other) polyhedra. The static techniques introduced provide a new simplified proof of Alexandrov’s theorem, as well as an essential extension which characterizes the static properties of frameworks built with more general patterns on the faces, including frameworks with vertices interior to the faces. The static techniques are presented and employed in a pattern appropriate to the extension of an arbitrary statically rigid framework built around any polyhedron (nonconvex, toroidal, etc.). The techniques are also applied to derive the static rigidity of tensegrity frameworks (with cables and struts in place of bars), and the static rigidity of frameworks projectively equivalent to known polyhedral frameworks. Finally, as an exercise to give an additional perspective to the results in 3 -space, detailed analogues of Alexandrov’s theorem are presented for convex 4 -polytopes built as bar and joint frameworks in 4 -space.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“The proof uses Kalai's combinatorial inequality based on a result of Whiteley [9].”
From An inequality for anti-self-polar polytopes (2026) · cites this paper as [9]
Experimental — accuracy not yet measured
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Asimow, L., & Roth, B. (1978) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1978-0511410-9 · Cited by 506
Asimow, L., & Roth, B. (1979) · Journal of Mathematical Analysis and Applications · doi:10.1016/0022-247x(79)90108-2 · Cited by 339
Almost all simply connected closed surfaces are rigid
Gluck, H. (1975) · Lecture notes in mathematics · doi:10.1007/bfb0066118 · Cited by 296
XLV. On reciprocal figures and diagrams of forces
Maxwell, J. C. (1864) · The London Edinburgh and Dublin Philosophical Magazine and Journal of Science · doi:10.1080/14786446408643663 · Cited by 281
Die graphische Statik der starren Systeme
Henneberg, L. (1911) · Medical Entomology and Zoology · Cited by 175
Roth, B. (1981) · American Mathematical Monthly · doi:10.1080/00029890.1981.11995175 · Cited by 151
Statics of Frameworks and Motions of Panel Structures: A projective Geometric Introduction
Crapo, H. H., & Whiteley, W. J. (1982) · LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas) · Cited by 122
Self-citationThe Algebraic Geometry of Stresses in Frameworks
White, N. L., & Whiteley, W. J. (1983) · SIAM Journal on Algebraic and Discrete Methods · doi:10.1137/0604049 · Cited by 119
Self-citationWhen is a bipartite graph a rigid framework?
Bolker, E. D., & Roth, B. (1980) · Pacific Journal of Mathematics · doi:10.2140/pjm.1980.90.27 · Cited by 112
Roth, B. (1981) · American Mathematical Monthly · doi:10.2307/2320705 · Cited by 99
Research works printed but not linked: 7
- \bysame, Introduction, Structural Topology 1 (1979), 8-12.
- R. Bricard, Memoire sur la theorie de l’octaedre articulé, J. Math (Liouville) (5) 3 (1897), 113-148.
- Coxeter, H. S. M., 1973, Regular polytopes
- B. Grünbaum, Convex polytopes, Wiley, New York, 1968.
- \bysame, Lectures in lost mathematics, University of Washington, Seattle, Washington, 1976, preprint.
- \bysame, Introduction to structural geometry. I. Infinitesimal motions and infinitesimal rigidity, Champlain Reg. Coll., St. Lambert Quebec, preprint 1977.
- \bysame, Introduction to structural geometry. II. Statics and stresses, Champlain Reg. Coll. St. Lambert, Quebec, preprint 1978.
Cited by
Sorted by citations
An inequality for anti-self-polar polytopes
Katz, M. G. (2026) · The Mathematical Intelligencer · doi:10.1007/s00283-025-10452-8
Metadata
- Authors
- Whiteley, W.
- Corresponding author
- Whiteley, Walter
- Venue
- Transactions of the American Mathematical Society
- Publisher
- American Mathematical Society (AMS)
- Published
- 1984
- Volume
- 285
- Issue
- 2
- Pages
- 431-465
- ISSN
- 0002-9947 (ISSN-L)
- 1088-6850
- OpenAlex
- W1987621408
- Cited by
- 99
- References
- 19
- Citations by year
- 2026: 1 · 2025: 3 · 2024: 2 · 2023: 2 · 2022: 1 · 2021: 1 · 2020: 4 · 2019: 1 · 2018: 3 · 2017: 2 · 2016: 1 · 2015: 1 · 2014: 1 · 2013: 8 · 2012: 5
- FWCI
- 3.01
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- Transactions of the American Mathematical Society (publishedVersion)
- Topics
- Physical Sciences › Engineering › Civil and Structural Engineering › Structural Analysis and Optimization
- Physical Sciences › Computer Science › Computer Graphics and Computer-Aided Design › Computational Geometry and Mesh Generation
- Physical Sciences › Mathematics › Geometry and Topology › Mathematics and Applications
- Keywords
- static stiffness, bar-joint frameworks, Alexandrov's theorem, convex polyhedra, polyhedral framework, projective equivalence, rigidity theory
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review