activity
20032023
most citedInfinite Bar-Joint Frameworks, Crystals and Operator Theory

43 citations · 82 across the 12 of their papers we have counts for

collaborators

12 papers

math.MG2023

Mobility of geometric constraint systems with extrusion symmetry

John Owen, Bernd Schulze

If we take a (bar-joint) framework, prepare an identical copy of this framework, translate it by some vector , and finally join corresponding points of the two copies, then we o…

math.MG2014★ 16 cited

A characterisation of the generic rigidity of 2-dimensional point-line frameworks

Bill Jackson, J. C. Owen

A 2-dimensional point-line framework is a collection of points and lines in the plane which are linked by pairwise constraints that fix some angles between pairs of lines and also…

math.MG2012★ 4 cited

A characterisation of generically rigid frameworks on surfaces of revolution

Anthony Nixon, John Owen, Stephen Power

A foundational theorem of Laman provides a counting characterisation of the finite simple graphs whose generic bar-joint frameworks in two dimensions are infinitesimally rigid. Rec…

math.CO2012

Radically solvable graphs

Bill Jackson, J. C. Owen

A 2-dimensional framework is a straight line realisation of a graph in the Euclidean plane. It is radically solvable if the set of vertex coordinates is contained in a radical exte…

math.CO2012★ 10 cited

The number of equivalent realisations of a rigid graph

Bill Jackson, J. C. Owen

Given a rigid realisation of a graph in , it is an open problem to determine the maximum number of pairwise non-congruent realisations which have the same edge l…

math.CO2011★ 4 cited

An Inductive Construction of (2,1)-tight Graphs

Anthony Nixon, John Owen

The simple graphs that satisfy for any subgraph (and for ) are the -sparse graphs. Those that also satisfy are the …