Search
Now showing items 1-5 of 5
Which graphs are rigid in lpd? (Pre-published)
(Springer, 2021-03-13)
We present three results which support the conjecture that a graph is minimally rigid in d-dimensional ℓp-space, where p∈(1,∞) and p≠2, if and only if it is (d, d)-tight. Firstly, we introduce a graph bracing operation ...
Graph rigidity for unitarily invariant matrix norms (Pre-published)
(Elsevier, 2020-11-15)
A rigidity theory is developed for bar-joint frameworks in linear matrix spaces endowed with a unitarily invariant matrix norm. Analogues of Maxwell's counting criteria are obtained and minimally rigid matrix frameworks ...
Symbol functions for symmetric frameworks (Pre-published)
(Elsevier, 2021-05-15)
We prove a variant of the well-known result that intertwiners for the bilateral shift on ℓ2(Z) are unitarily equivalent to multiplication operators on L2(T). This enables us to unify and extend fundamental aspects of ...
Constructing isostatic frameworks for the l1 and l infinity plane (Pre-published)
(Electronic Journal of Combinatorics, 2020-06-12)
We use a new coloured multi-graph constructive method to prove that if the edge-set of a graph G = (V,E) has a partition into two spanning trees T1 and T2 then there is a map p : V → R2, p(v) = (p(v)1,p(v)2), such that ...
Rigidity of symmetric frameworks in normed spaces
(Elsevier, 2020-12-15)
We develop a combinatorial rigidity theory for symmetric bar-joint frameworks in a general finite dimensional normed space. In the case of rotational symmetry, matroidal Maxwell-type sparsity counts are identified for a ...