activity
20182026
most citedEquivalence of continuous, local and infinitesimal rigidity in normed spaces

11 citations · 53 across the 29 of their papers we have counts for

collaborators

32 papers

math.CO2026

On rigidity properties of unit-distance graphs

Sean Dewar, Georg Grasegger, Alison La Porta +2

A unit-distance graph is a graph which admits a realisation in Euclidean space in which every edge has unit length. Imposing further geometric conditions on the non-edges gives a f…

math.DG2026

Rigidity on compact surfaces through hyperbolic symmetries

Sean Dewar, Alison La Porta, Rebecca Monks +3

Generically the rigidity of bar-joint structures admits combinatorial characterisations in the Euclidean plane and, more generally, for frameworks on the sphere and the torus. The…

math.CO2025

Generalised Erdős distance theory on graphs

Sean Dewar, Nora Frankl, Samuel Mansfield +3

The famous Erdős distinct distances problem asks the following: how many distinct distances must exist between a set of points in the plane? There are many generalisations of t…

math.CO2024

Triangulated spheres with holes in triangulated surfaces

Katie Clinch, Sean Dewar, Niloufar Fuladi +6

Let denote a sphere with holes. Given a triangulation of a surface , we consider the question of when contains a spanning subgraph such t…

math.CO2024

Constructing reflection-symmetric flexible realisations of graphs

Sean Dewar, Georg Grasegger, Jan Legerský

We study reflection-symmetric realisations of symmetric graphs in the plane that allow a continuous symmetry and edge-length preserving deformation. To do so, we identify a necessa…

q-bio.GN2024

Single-cell 3D genome reconstruction in the haploid setting using rigidity theory

Sean Dewar, Georg Grasegger, Kaie Kubjas +2

This article considers the problem of 3-dimensional genome reconstruction for single-cell data, and the uniqueness of such reconstructions in the setting of haploid organisms. We c…

math.MG2024

Edge-length preserving embeddings of graphs between normed spaces

Sean Dewar, Eleftherios Kastis, Derek Kitson +1

The concept of graph flattenability, initially formalized by Belk and Connelly and later expanded by Sitharam and Willoughby, extends the question of embedding finite metric spaces…

math.CO2024

Angular constraints on planar frameworks

Sean Dewar, Georg Grasegger, Anthony Nixon +4

Consider a collection of points in the plane and the sets of slopes or directions of the lines between pairs of points. It is known that the algebraic matroid on the set of directi…

math.CO2024

Rigidity of nearly planar classes of graphs

Sean Dewar, Georg Grasegger, Eleftherios Kastis +2

We explore the rigidity of generic frameworks in 3-dimensions whose underlying graph is close to being planar. Specifically we consider apex graphs, edge-apex graphs and their vari…

math.CO2024

Rigid frameworks with dilation constraints

Sean Dewar, Anthony Nixon, Andrew Sainsbury

We consider the rigidity and global rigidity of bar-joint frameworks in Euclidean -space under additional dilation constraints in specified coordinate directions. In this settin…

math.CO2023

The number of realisations of a rigid graph in Euclidean and spherical geometries

Sean Dewar, Georg Grasegger

A graph is -rigid if for any generic realisation of the graph in (equivalently, the -dimensional sphere ), there are only finitely many non-congr…

math.CO2023★ 1 cited

On the uniqueness of collections of pennies and marbles

Sean Dewar, Georg Grasegger, Kaie Kubjas +2

In this note we study the uniqueness problem for collections of pennies and marbles. More generally, consider a collection of unit -spheres that may touch but not overlap. Given…

math.MG2023

Rigid graphs in cylindrical normed spaces

Sean Dewar, Derek Kitson

We characterise rigid graphs for cylindrical normed spaces where is a finite dimensional real normed linear space and is endowed with the prod…

math.CO2023★ 1 cited

Identifying contact graphs of sphere packings with generic radii

Sean Dewar

Ozkan et al. conjectured that any packing of spheres with generic radii will be stress-free, and hence will have at most contacts. In this paper we prove that this conje…

math.CO2022★ 3 cited

Computing maximum likelihood thresholds using graph rigidity

Daniel Irving Bernstein, Sean Dewar, Steven J. Gortler +3

The maximum likelihood threshold (MLT) of a graph is the minimum number of samples to almost surely guarantee existence of the maximum likelihood estimate in the corresponding…

math.CO2022

How many contacts can exist between oriented squares of various sizes?

Sean Dewar

A homothetic packing of squares is any set of various-size squares with the same orientation where no two squares have overlapping interiors. If all squares have the same size…

math.CO2022★ 1 cited

Uniquely realisable graphs in analytic normed planes

Sean Dewar, John Hewetson, Anthony Nixon

A bar-joint framework in the Euclidean space is globally rigid if it is the unique realisation, up to rigid congruences, of in with the ed…

math.CO2022★ 1 cited

Graph rigidity properties of Ramanujan graphs

Sebastian M. Cioabă, Sean Dewar, Georg Grasegger +1

A recent result of Cioabă, Dewar and Gu implies that any -regular Ramanujan graph with is globally rigid in . In this paper, we extend these results and…

math.CO2022★ 1 cited

Quotient graphs of symmetrically rigid frameworks

Sean Dewar, Georg Grasegger, Eleftherios Kastis +1

A natural problem in combinatorial rigidity theory concerns the determination of the rigidity or flexibility of bar-joint frameworks in that admit some non-trivial s…

math.CO2022

Classifying the globally rigid edge-transitive graphs and distance-regular graphs in the plane

Sean Dewar

A graph is said to be globally rigid if almost all embeddings of the graph's vertices in the Euclidean plane will define a system of edge-length equations with a unique (up to isom…

math.CO2021

Coincident-point rigidity in normed planes

Sean Dewar, John Hewetson, Anthony Nixon

A bar-joint framework is the combination of a graph and a map assigning positions, in some space, to the vertices of . The framework is rigid if every edge-lengt…

math.CO2021★ 3 cited

Flexing infinite frameworks with applications to braced Penrose tilings

Sean Dewar, Jan Legerský

A planar framework -- a graph together with a map of its vertices to the plane -- is flexible if it allows a continuous deformation preserving the distances between adjacent vertic…

math.MG2021★ 4 cited

Infinitesimal rigidity and prestress stability for frameworks in normed spaces

Sean Dewar

A (bar-and-joint) framework is a set of points in a normed space with a set of fixed distance constraints between them. Determining whether a framework is locally rigid - i.e. whet…

math.MG2021★ 4 cited

Generalised rigid body motions in non-Euclidean planes with applications to global rigidity

Sean Dewar, Anthony Nixon

A bar-joint framework in a (non-Euclidean) real normed plane is the combination of a finite, simple graph and a placement of the vertices in . A framework $(…