Home > Research > Publications & Outputs > Symmetric Frameworks on Surfaces

Electronic data

  • 2024WallPhd

    Final published version, 911 KB, PDF document

Text available via DOI:

View graph of relations

Symmetric Frameworks on Surfaces

Research output: ThesisDoctoral Thesis

Published

Standard

Symmetric Frameworks on Surfaces. / Wall, Joe.
Lancaster University, 2024. 187 p.

Research output: ThesisDoctoral Thesis

Harvard

APA

Wall, J. (2024). Symmetric Frameworks on Surfaces. [Doctoral Thesis, Lancaster University]. Lancaster University. https://doi.org/10.17635/lancaster/thesis/2509

Vancouver

Wall J. Symmetric Frameworks on Surfaces. Lancaster University, 2024. 187 p. doi: 10.17635/lancaster/thesis/2509

Author

Wall, Joe. / Symmetric Frameworks on Surfaces. Lancaster University, 2024. 187 p.

Bibtex

@phdthesis{df6382b3b4a74de2a1bd66031f29982c,
title = "Symmetric Frameworks on Surfaces",
abstract = "We present a study of combinatorial constructions that are related to understanding the structure of bar-joint frameworks that are restricted to a subspace of Rd. There are two such restrictions of Rd we approach.We combine two recent extensions of the generic theory of rigid and flexiblegraphs by considering symmetric frameworks in R3 restricted to move on a surface. In Chapter 3 necessary combinatorial conditions are given for a symmetric framework on the sphere, cylinder, cone, elliptical cylinder and ellipsoid to be isostatic (i.e. minimally infinitesimally rigid) under any finite point group symmetry. In Chapter 4 we focus exclusively on the cylinder. In every case when the symmetry group is cyclic, which we prove restricts the group to being inversion, half-turn or reflection symmetry, these conditions are then shown to be sufficient under suitable genericity assumptions, giving precise combinatorial descriptions of symmetric isostatic graphs in these contexts.Motivated by applications where boundary conditions play a significant role, one may generalise and consider linearly constrained frameworks where some vertices are constrained to move on fixed affine subspaces. Additional to Chapter 3, the necessary combinatorial conditions are given for a symmetric linearly constrained framework in Rd to be isostatic under a choice finite point group symmetries. In Chapter 5, we consider linearly constrained frameworks in the plane, and the case of rotation symmetry groups whose order is either 2 or odd. These conditions are then shown to be sufficient under suitable genericity assumptions, giving precise combinatorial descriptions of symmetric isostatic graphs in these contexts.To conclude there is a short chapter in which we suggest ways for this researchto be furthered.",
keywords = "Rigidity Theory, Combinatorics, Metric Geometry",
author = "Joe Wall",
year = "2024",
doi = "10.17635/lancaster/thesis/2509",
language = "English",
publisher = "Lancaster University",
school = "Lancaster University",

}

RIS

TY - BOOK

T1 - Symmetric Frameworks on Surfaces

AU - Wall, Joe

PY - 2024

Y1 - 2024

N2 - We present a study of combinatorial constructions that are related to understanding the structure of bar-joint frameworks that are restricted to a subspace of Rd. There are two such restrictions of Rd we approach.We combine two recent extensions of the generic theory of rigid and flexiblegraphs by considering symmetric frameworks in R3 restricted to move on a surface. In Chapter 3 necessary combinatorial conditions are given for a symmetric framework on the sphere, cylinder, cone, elliptical cylinder and ellipsoid to be isostatic (i.e. minimally infinitesimally rigid) under any finite point group symmetry. In Chapter 4 we focus exclusively on the cylinder. In every case when the symmetry group is cyclic, which we prove restricts the group to being inversion, half-turn or reflection symmetry, these conditions are then shown to be sufficient under suitable genericity assumptions, giving precise combinatorial descriptions of symmetric isostatic graphs in these contexts.Motivated by applications where boundary conditions play a significant role, one may generalise and consider linearly constrained frameworks where some vertices are constrained to move on fixed affine subspaces. Additional to Chapter 3, the necessary combinatorial conditions are given for a symmetric linearly constrained framework in Rd to be isostatic under a choice finite point group symmetries. In Chapter 5, we consider linearly constrained frameworks in the plane, and the case of rotation symmetry groups whose order is either 2 or odd. These conditions are then shown to be sufficient under suitable genericity assumptions, giving precise combinatorial descriptions of symmetric isostatic graphs in these contexts.To conclude there is a short chapter in which we suggest ways for this researchto be furthered.

AB - We present a study of combinatorial constructions that are related to understanding the structure of bar-joint frameworks that are restricted to a subspace of Rd. There are two such restrictions of Rd we approach.We combine two recent extensions of the generic theory of rigid and flexiblegraphs by considering symmetric frameworks in R3 restricted to move on a surface. In Chapter 3 necessary combinatorial conditions are given for a symmetric framework on the sphere, cylinder, cone, elliptical cylinder and ellipsoid to be isostatic (i.e. minimally infinitesimally rigid) under any finite point group symmetry. In Chapter 4 we focus exclusively on the cylinder. In every case when the symmetry group is cyclic, which we prove restricts the group to being inversion, half-turn or reflection symmetry, these conditions are then shown to be sufficient under suitable genericity assumptions, giving precise combinatorial descriptions of symmetric isostatic graphs in these contexts.Motivated by applications where boundary conditions play a significant role, one may generalise and consider linearly constrained frameworks where some vertices are constrained to move on fixed affine subspaces. Additional to Chapter 3, the necessary combinatorial conditions are given for a symmetric linearly constrained framework in Rd to be isostatic under a choice finite point group symmetries. In Chapter 5, we consider linearly constrained frameworks in the plane, and the case of rotation symmetry groups whose order is either 2 or odd. These conditions are then shown to be sufficient under suitable genericity assumptions, giving precise combinatorial descriptions of symmetric isostatic graphs in these contexts.To conclude there is a short chapter in which we suggest ways for this researchto be furthered.

KW - Rigidity Theory

KW - Combinatorics

KW - Metric Geometry

U2 - 10.17635/lancaster/thesis/2509

DO - 10.17635/lancaster/thesis/2509

M3 - Doctoral Thesis

PB - Lancaster University

ER -