We consider the concept of abstract two-dimensional rigidity and provide necessary and sufficient conditions for a matroid to be an abstract rigidity matroid of a complete graph. This characterization is a natural extension of the characterization of graphic matroids due to Graver or Sachs. We also
Rigid Subanalytic Sets in the Plane
β Scribed by H. Schoutens
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 390 KB
- Volume
- 170
- Category
- Article
- ISSN
- 0021-8693
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We investigate the problem of finding the smallest diameter D(n) of a set of n points such that all the mutual distances between them are at least 1. The asymptotic behaviour of D(n) is known; the exact value of D(n) can be easily found up to 6 points. Bateman and Erdo s proved that D(7)=2. In this
Intersection sets and blocking sets play an important role in contemporary finite geometry. There are cryptographic applications depending on their construction and combinatorial properties. This paper contributes to this topic by answering the question: how many circles of an inversive plane will b