Mathematics – Combinatorics
Scientific paper
2005-03-02
Comment. Math. Helv. 82 (2007), 197-233
Mathematics
Combinatorics
24 pages, revised version; accepted for publication in Commentarii Mathematici Helvetici
Scientific paper
Combinatorial rigidity theory seeks to describe the rigidity or flexibility of bar-joint frameworks in R^d in terms of the structure of the underlying graph G. The goal of this article is to broaden the foundations of combinatorial rigidity theory by replacing G with an arbitrary representable matroid M. The ideas of rigidity independence and parallel independence, as well as Laman's and Recski's combinatorial characterizations of 2-dimensional rigidity for graphs, can naturally be extended to this winder setting. As we explain, many of these fundamental concepts really depend only on the matroid associated with G (or its Tutte polynomial) and have little to do with the special nature of graphic matroids or the field R. Our main result is a "nesting theorem" relating the various kinds of independence. Immediate corollaries include generalizations of Laman's Theorem, as well as the equality of 2-rigidity and 2-parallel independence. A key tool in our study is the space of photos of M, a natural algebraic variety whose irreducibility is closely related to the notions of rigidity independence and parallel independence. The number of points on this variety, when working over a finite field, turns out to be an interesting Tutte polynomial evaluation.
Develin Mike
Martin Jeremy L.
Reiner Victor
No associations
LandOfFree
Rigidity theory for matroids does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Rigidity theory for matroids, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Rigidity theory for matroids will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-24224