SDSean Dewar
Sean Dewar
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Sean Dewar has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Anthony Nixon
School of Mathematical Sciences Lancaster University Lancaster UK
1 shared publication - Ben Smith
Lancaster University
1 shared publication
Latest Publications
- Open Access
The $d$-dimensional realisation number of a rigid graph
Determining the number of (complex) realisations of a rigid graph for a specific choice of edge lengths is a fundamental problem in discrete geometry. In this article we provide two new tools for determining realisation numbers in arbitrary dimensions: (i) we prove that subgraph inclusion translates to realisation number divisibility; and (ii) we provide lower bounds on realisation numbers under specific graph operations in all dimensions. We use these methods to prove that every triangulated sphere with $n$ vertices has at least $2^{n-4}$ edge-length equivalent realisations in 3-dimensions, extending a 2-dimensional result of Jackson and Owen in the case of planar graphs. Additionally, our tools solve a family of conjectures set by Grasegger regarding how 1-extensions, X-replacements, and V-replacements affect realisation numbers.Open AccessThe $d$-dimensional realisation number of a rigid graph
Determining the number of (complex) realisations of a rigid graph for a specific choice of edge lengths is a fundamental problem in discrete geometry. In this article we provide two new tools for determining realisation numbers in arbitrary dimensions: (i) we prove that subgraph inclusion translates to realisation number divisibility; and (ii) we provide lower bounds on realisation numbers under specific graph operations in all dimensions. We use these methods to prove that every triangulated sphere with $n$ vertices has at least $2^{n-4}$ edge-length equivalent realisations in 3-dimensions, extending a 2-dimensional result of Jackson and Owen in the case of planar graphs. Additionally, our tools solve a family of conjectures set by Grasegger regarding how 1-extensions, X-replacements, and V-replacements affect realisation numbers. - Open Access
A counter-example to Baranyai's combinatorial characterisation for 3-rigidity
Recently Baranyai described a necessary combinatorial characterisation of graph rigidity for dimension 3. In this short note we provide a counter-example to the converse of the condition. Additionally, we provide an alternative proof to the Baranyai's necessary condition.
Open AccessA counter-example to Baranyai's combinatorial characterisation for 3-rigidity
Recently Baranyai described a necessary combinatorial characterisation of graph rigidity for dimension 3. In this short note we provide a counter-example to the converse of the condition. Additionally, we provide an alternative proof to the Baranyai's necessary condition.