Geodesic
Symmetric isostatic frameworks with \(\ell^1\) or \(\ell^\infty\) distance constraints
Derek Kitson1 ; Bernd Schulze1
1Lancaster University
The electronic journal of combinatorics, Tome 23 (2016) no. 4
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

Combinatorial characterisations of minimal rigidity are obtained for symmetric $2$-dimensional bar-joint frameworks with either $\ell^1$ or $\ell^\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.
DOI : 10.37236/6044
Classification : 05C70, 05C05, 52C25
Mots-clés : tree packings, spanning trees, bar-joint framework, infinitesimal rigidity, symmetric framework, Minkowski geometry

Derek Kitson  1   ; Bernd Schulze  1

1 Lancaster University 
@article{10_37236_6044,
     author = {Derek Kitson and Bernd Schulze},
     title = {Symmetric isostatic frameworks with \(\ell^1\) or \(\ell^\infty\) distance constraints},
     journal = {The electronic journal of combinatorics},
     year = {2016},
     volume = {23},
     number = {4},
     doi = {10.37236/6044},
     zbl = {1351.05180},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/6044/}
}
TY  - JOUR
AU  - Derek Kitson
AU  - Bernd Schulze
TI  - Symmetric isostatic frameworks with \(\ell^1\) or \(\ell^\infty\) distance constraints
JO  - The electronic journal of combinatorics
PY  - 2016
VL  - 23
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.37236/6044/
DO  - 10.37236/6044
ID  - 10_37236_6044
ER  - 
%0 Journal Article
%A Derek Kitson
%A Bernd Schulze
%T Symmetric isostatic frameworks with \(\ell^1\) or \(\ell^\infty\) distance constraints
%J The electronic journal of combinatorics
%D 2016
%V 23
%N 4
%U http://geodesic.mathdoc.fr/articles/10.37236/6044/
%R 10.37236/6044
%F 10_37236_6044
Derek Kitson; Bernd Schulze. Symmetric isostatic frameworks with \(\ell^1\) or \(\ell^\infty\) distance constraints. The electronic journal of combinatorics, Tome 23 (2016) no. 4. doi: 10.37236/6044

Cité par Sources :