Number and twistedness of strands in weavings on regular convex polyhedra.
نویسنده
چکیده
This paper deals with two- and threefold weavings on Platonic polyhedral surfaces. Depending on the skewness of the weaving pattern with respect to the edges of the polyhedra, different numbers of closed strands are necessary in a complete weaving. The problem is present in basketry but can be addressed from the aspect of pure geometry (geodesics), graph theory (central circuits of 4-valent graphs) and even structural engineering (fastenings on a closed surface). Numbers of these strands are found to have a periodicity and symmetry, and, in some cases, this number can be predicted directly from the skewness of weaving. In this paper (i) a simple recursive method using symmetry operations is given to find the number of strands of cubic, octahedral and icosahedral weavings for cases where generic symmetry arguments fail; (ii) another simple method is presented to decide whether or not a single closed strand can run along the underlying Platonic without a turn (i.e. the linking number of the two edges of a strand is zero, and so the loop can be stretched to a circle without being twisted); and (iii) the linking number of individual strands in an alternate 'check' weaving pattern is determined.
منابع مشابه
Convex-Faced Combinatorially Regular Polyhedra of Small Genus
Combinatorially regular polyhedra are polyhedral realizations (embeddings) in Euclidean 3-space E of regular maps on (orientable) closed compact surfaces. They are close analogues of the Platonic solids. A surface of genus g > 2 admits only finitely many regular maps, and generally only a small number of them can be realized as polyhedra with convex faces. When the genus g is small, meaning tha...
متن کاملModelling Decision Problems Via Birkhoff Polyhedra
A compact formulation of the set of tours neither in a graph nor its complement is presented and illustrates a general methodology proposed for constructing polyhedral models of decision problems based upon permutations, projection and lifting techniques. Directed Hamilton tours on n vertex graphs are interpreted as (n-1)- permutations. Sets of extrema of Birkhoff polyhedra are mapped to tours ...
متن کاملSimple equations giving shapes of various convex polyhedra: the regular polyhedra and polyhedra composed of crystallographically low-index planes
Simple equations are derived that give the shapes of various convex polyhedra. The five regular polyhedra, called Platonic solids (the tetrahedron, hexahedron or cube, octahedron, dodecahedron and icosahedron), and polyhedra composed of crystallographically low-index planes are treated. The equations also give shapes that are nearly polyhedral with round edges, or intermediate shapes between a ...
متن کاملWeavings, sections and projections of spherical polyhedra
Whiteley, W., Weavings, sections and projections of spherical polyhedra, Discrete Applied Mathematics 32 (1991) 275-294. In this paper we give simultaneous answers to three questions: (a) When does a plane picture of lines, weaving over and under in the plane, lift and separate into a configuration of disjoint lines in 3-space? (b) When is a configuration of lines in the plane the cross-section...
متن کاملHidden Symmetries in the Snub Dodecahedron
In a 1979 paper by Coxeter and Huybers [4] , simple formulas were given to construct the snub cube and the snub dodecahedron from the octahedron and the icosahedron respectively , the vertices of the octahedron and icosahedron being the intersection points of certain pairs of edges of the two snub polyhedra . In a later series of papers , Hohenberg [6 , 7 , 8] studied the intersection points of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Proceedings. Mathematical, physical, and engineering sciences
دوره 470 2162 شماره
صفحات -
تاریخ انتشار 2014