Search

We prove an equilibrium stressability criterion for trivalent multidimensional frameworks. The criterion appears in different languages: (1) in terms of stress monodromies, (2) in terms of surgeries, (3) in terms of exact discrete 1-forms, and (4) in Cayley algebra terms.

A bar-and-joint framework in the plane with degree of freedom 1 is called a mechanism. It is well-known that the operations of 0-extension and 1-extension, the so called Henneberg moves, can always be performed on a framework so that its degree of freedom is preserved. It was conjectured by the first and second author in 2012 that for a mechanism in generic position these operations can be performed without restricting its motion. In this note we provide a counterexample.

Laman's characterization of minimally rigid 2‐dimensional generic frameworks gives a matroid structure on the edge set of the underlying graph, as was first pointed out and exploited by L. Lovász and Y. Yemini. Global rigidity has only recently been characterized by a combination of two results due to T. Jordán and the first named author, and R. Connelly, respectively. We use these characterizations to investigate how graph theoretic properties such as transitivity, connectivity and regularity influence (2‐dimensional generic) rigidity and global rigidity and apply some of these results to reveal rigidity properties of random graphs. In particular, we characterize the globally rigid vertex transitive graphs, and show that a random d‐regular graph is asymptotically almost surely globally rigid for all d≥ 4. © 2006 Wiley Periodicals, Inc. J Graph Theory 54: 154–166, 2007

We study non-crossing frameworks in the plane for which the classical reciprocal on the dual graph is also non-crossing. We give a complete description of the self-stresses on non-crossing frameworks G whose reciprocals are non-crossing, in terms of: the types of faces (only pseudo-triangles and pseudo-quadrangles are allowed); the sign patterns in the stress on G; and a geometric condition on the stress vectors at some of the vertices. As in other recent papers where the interplay of non-crossingness and rigidity of straight-line plane graphs is studied, pseudo-triangulations show up as objects of special interest. For example, it is known that all planar Laman circuits can be embedded as a pseudo-triangulation with one non-pointed vertex. We show that for such pseudo-triangulation embeddings of planar Laman circuits which are sufficiently generic, the reciprocal is non-crossing and again a pseudo-triangulation embedding of a planar Laman circuit. For a singular (non-generic) pseudo-triangulation embedding of a planar Laman circuit, the reciprocal is still non-crossing and a pseudo-triangulation, but its underlying graph may not be a Laman circuit. Moreover, all the pseudo-triangulations which admit a non-crossing reciprocal arise as the reciprocals of such, possibly singular, stresses on pseudo-triangulation Laman circuits. All self-stresses on a planar graph correspond to liftings to piecewise linear surfaces in 3-space. We prove characteristic geometric properties of the lifts of such non-crossing reciprocal pairs.

When a parent sees a little girl sitting on the floor cutting paper dolls, many thoughts may come to mind: ‘She’s keeping out of trouble’ or ‘She’s making a mess’ or even ‘There go my tax returns’. The thought that should have come to my parent’s mind, however, was ‘One day she’ll be a mathematician’. My grandmother, who worked as a dressmaker, often allowed my sister and me to use her razor sharp scissors on the strips of leftover tracing paper. This paper is inspired by a notebook that I kept in grade school when I ‘studied’ paper dolls, and the figures are based on dolls found pressed between the pages.

Given a graph $ \Gamma $ $ {F_\Gamma }$, with a defining relation $ xy = yx$ of adjacent vertices of $ \Gamma $ $ {F_\Gamma }$ is an $ n$ $ (n \geq 4)$ $ {F'_\Gamma }$ $ 1 + (n - 4){2^{n - 3}}$ for which is a free group.