Home > Research > Publications & Outputs > Symmetric isostatic frameworks with l^1 or l^\i...

Research

Associated organisational units

Links

Keywords

View graph of relations

Symmetric isostatic frameworks with l^1 or l^\infty distance constraints

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published

Standard

Symmetric isostatic frameworks with l^1 or l^\infty distance constraints. / Kitson, Derek; Schulze, Bernd.
In: The Electronic Journal of Combinatorics , Vol. 23, No. 4, #P4.23, 10.11.2016.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Harvard

Kitson, D & Schulze, B 2016, 'Symmetric isostatic frameworks with l^1 or l^\infty distance constraints', The Electronic Journal of Combinatorics , vol. 23, no. 4, #P4.23. <http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i4p23>

APA

Kitson, D., & Schulze, B. (2016). Symmetric isostatic frameworks with l^1 or l^\infty distance constraints. The Electronic Journal of Combinatorics , 23(4), Article #P4.23. http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i4p23

Vancouver

Kitson D, Schulze B. Symmetric isostatic frameworks with l^1 or l^\infty distance constraints. The Electronic Journal of Combinatorics . 2016 Nov 10;23(4):#P4.23.

Author

Kitson, Derek ; Schulze, Bernd. / Symmetric isostatic frameworks with l^1 or l^\infty distance constraints. In: The Electronic Journal of Combinatorics . 2016 ; Vol. 23, No. 4.

Bibtex

@article{8d4b2c8931f34bdeaa70296ccf41e626,
title = "Symmetric isostatic frameworks with l^1 or l^\infty distance constraints",
abstract = "Combinatorial characterisations of minimal rigidity are obtained for symmetric2-dimensional bar-joint frameworks with either l^1 or l^\infty distance constraints. The characterisations are expressed in terms of symmetric tree packings and the number of edges fixed by the symmetry operations. The proof uses new Henneberg-type inductive construction schemes.",
keywords = "Tree packings, Spanning trees, Bar-joint framework, Infinitesimal rigidity, Symmetric framework, Minkowski geometry",
author = "Derek Kitson and Bernd Schulze",
year = "2016",
month = nov,
day = "10",
language = "English",
volume = "23",
journal = "The Electronic Journal of Combinatorics ",
issn = "1077-8926",
publisher = "Electronic Journal of Combinatorics",
number = "4",

}

RIS

TY - JOUR

T1 - Symmetric isostatic frameworks with l^1 or l^\infty distance constraints

AU - Kitson, Derek

AU - Schulze, Bernd

PY - 2016/11/10

Y1 - 2016/11/10

N2 - Combinatorial characterisations of minimal rigidity are obtained for symmetric2-dimensional bar-joint frameworks with either l^1 or l^\infty distance constraints. The characterisations are expressed in terms of symmetric tree packings and the number of edges fixed by the symmetry operations. The proof uses new Henneberg-type inductive construction schemes.

AB - Combinatorial characterisations of minimal rigidity are obtained for symmetric2-dimensional bar-joint frameworks with either l^1 or l^\infty distance constraints. The characterisations are expressed in terms of symmetric tree packings and the number of edges fixed by the symmetry operations. The proof uses new Henneberg-type inductive construction schemes.

KW - Tree packings

KW - Spanning trees

KW - Bar-joint framework

KW - Infinitesimal rigidity

KW - Symmetric framework

KW - Minkowski geometry

M3 - Journal article

VL - 23

JO - The Electronic Journal of Combinatorics

JF - The Electronic Journal of Combinatorics

SN - 1077-8926

IS - 4

M1 - #P4.23

ER -