Sean Dewar
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Sean Dewar has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Anthony Nixon
School of Mathematical Sciences Lancaster University Lancaster UK
5 shared publications - Derek Kitson
Department of Mathematics and Computer Studies Mary Immaculate College Thurles Ireland
3 shared publications Anthony Nixon
School of Mathematical Sciences Lancaster University Lancaster UK
2 shared publications- Eleftherios Kastis
School of Mathematical Sciences Lancaster University Lancaster UK
2 shared publications - Georg Grasegger
Johann Radon Institute for Computational and Applied Mathematics (RICAM), Austrian Academy of Sciences, Linz, Austria
2 shared publications James Maxwell
School of Mathematics University of Bristol Bristol UK
2 shared publications
Latest Publications
- 28 October 2026
- Published by Cassyni
Hadamard products, Bergman fans and Rigidity: Using dumb multiplication in a clever way
The Hadamard product can be considered the "naive" product of linear spaces in the same ambient space: just multiply every pair of vectors together coordinate-wise. At first this seems a rather bad idea, but this simple concept has many different applications throughout mathematics. In my talk I will discuss a new method for counting the number of points contained in a generic fibre of the Hadamard product of linear spaces that utilises Bergman fans – tropical linear representations of matroids that exist even when no actual linear representation does. I will show that the stable intersection of a Bergman fan and the flip of a Bergman fan (which we have cunningly named the flip product of matroids) exactly describes the number of points of a generic Hadamard product fibre. I will further describe how this can then be utilised in the field of rigidity theory. This talk involves joint work with Oliver Clarke, Matteo Gallet, Georg Grasegger, Daniel Green Tripp and Ben Smith.
- 28 October 2026
- Published by Cassyni
Hadamard products, Bergman fans and Rigidity: Using dumb multiplication in a clever way
The Hadamard product can be considered the "naive" product of linear spaces in the same ambient space: just multiply every pair of vectors together coordinate-wise. At first this seems a rather bad idea, but this simple concept has many different applications throughout mathematics. In my talk I will discuss a new method for counting the number of points contained in a generic fibre of the Hadamard product of linear spaces that utilises Bergman fans – tropical linear representations of matroids that exist even when no actual linear representation does. I will show that the stable intersection of a Bergman fan and the flip of a Bergman fan (which we have cunningly named the flip product of matroids) exactly describes the number of points of a generic Hadamard product fibre. I will further describe how this can then be utilised in the field of rigidity theory. This talk involves joint work with Oliver Clarke, Matteo Gallet, Georg Grasegger, Daniel Green Tripp and Ben Smith.
- Open Access
- 18 April 2026
- Published by Wiley in Journal of Graph Theory
- Vol. 112 (4) , 491-506
Edge‐Length Preserving Embeddings of Graphs Between Normed Spaces
The concept of graph embeddability, initially formalized by Belk and Connelly and later expanded by Sitharam and Willoughby, extends the question of embedding finite metric spaces into a given normed space. A finite simple graph is said to be ‐embeddable if any set of induced edge lengths from an embedding of into a normed space can also be realised by an embedding of into a normed space . This property, being minor‐closed, can be characterized by a finite list of forbidden minors. Following the establishment of fundamental results about ‐embeddability, we identify sufficient conditions under which it implies independence with respect to the associated rigidity matroids for and . We show that the spaces and serve as two natural extreme spaces of embeddability and discuss ‐embeddability for varying . We provide a complete characterization of ‐embeddable graphs for the specific case when is 2‐dimensional and is infinite‐dimensional.
- 18 April 2026
- Published by Wiley in Journal of Graph Theory
- Vol. 112 (4) , 491-506
Open AccessEdge‐Length Preserving Embeddings of Graphs Between Normed Spaces
The concept of graph embeddability, initially formalized by Belk and Connelly and later expanded by Sitharam and Willoughby, extends the question of embedding finite metric spaces into a given normed space. A finite simple graph is said to be ‐embeddable if any set of induced edge lengths from an embedding of into a normed space can also be realised by an embedding of into a normed space . This property, being minor‐closed, can be characterized by a finite list of forbidden minors. Following the establishment of fundamental results about ‐embeddability, we identify sufficient conditions under which it implies independence with respect to the associated rigidity matroids for and . We show that the spaces and serve as two natural extreme spaces of embeddability and discuss ‐embeddability for varying . We provide a complete characterization of ‐embeddable graphs for the specific case when is 2‐dimensional and is infinite‐dimensional.
- Top Cited PapersOpen Access
- 23 February 2026
- Published by Wiley in Journal of the London Mathematical Society
- Vol. 113 (2)
A tropical approach to rigidity: Counting realisations of frameworks
A realisation of a graph in the plane as a bar‐joint framework is rigid if there are finitely many other realisations, up to isometries, with the same edge lengths. Each of these finitely many realisations can be seen as a solution to a system of quadratic equations prescribing the distances between pairs of points. For generic realisations, the size of the solution set depends only on the underlying graph so long as we allow for complex solutions. We provide a characterisation of the realisation number — that is the cardinality of this complex solution set — of a minimally rigid graph. Our characterisation uses tropical geometry to express the realisation number as an intersection of Bergman fans of the graphic matroid. As a consequence, we derive a combinatorial upper bound on the realisation number involving the Tutte polynomial. Moreover, we provide computational evidence that our upper bound is usually an improvement on the mixed volume bound.
- 23 February 2026
- Published by Wiley in Journal of the London Mathematical Society
- Vol. 113 (2)
Top Cited PapersOpen AccessA tropical approach to rigidity: Counting realisations of frameworks
A realisation of a graph in the plane as a bar‐joint framework is rigid if there are finitely many other realisations, up to isometries, with the same edge lengths. Each of these finitely many realisations can be seen as a solution to a system of quadratic equations prescribing the distances between pairs of points. For generic realisations, the size of the solution set depends only on the underlying graph so long as we allow for complex solutions. We provide a characterisation of the realisation number — that is the cardinality of this complex solution set — of a minimally rigid graph. Our characterisation uses tropical geometry to express the realisation number as an intersection of Bergman fans of the graphic matroid. As a consequence, we derive a combinatorial upper bound on the realisation number involving the Tutte polynomial. Moreover, we provide computational evidence that our upper bound is usually an improvement on the mixed volume bound.
- Open Access
- 19 May 2025
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 132
Extremal decompositions of tropical varieties and relations with rigidity theory
- 19 May 2025
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 132
Open AccessExtremal decompositions of tropical varieties and relations with rigidity theory
- Open Access
- 14 February 2025
- Published by Elsevier in Examples and Counterexamples
- Vol. 7
On the uniqueness of collections of pennies and marbles
- 14 February 2025
- Published by Elsevier in Examples and Counterexamples
- Vol. 7
Open AccessOn the uniqueness of collections of pennies and marbles
- Open Access
- 1 November 2024
- Published by Elsevier in Discrete Mathematics
- Vol. 348 (2)
Rigid frameworks with dilation constraints
- 1 November 2024
- Published by Elsevier in Discrete Mathematics
- Vol. 348 (2)
Open AccessRigid frameworks with dilation constraints
- Open Access
- 8 May 2024
- Published by European Mathematical Society - EMS - Publishing House GmbH in Documenta Mathematica
- Vol. 29 (3) , 561-595
Quotient graphs of symmetrically rigid frameworks
A natural problem in combinatorial rigidity theory concerns the determination of the rigidity or flexibility of bar-joint frameworks in \mathbb{R}^{d} that admit some non-trivial symmetry. When d=2 there is a large literature on this topic. In particular, it is typical to quotient the symmetric graph by the group and analyse the rigidity of symmetric, but otherwise generic frameworks, using the combinatorial structure of the appropriate group-labelled quotient graph. However, mirroring the situation for generic rigidity, little is known combinatorially when d\geq 3 . Nevertheless in the periodic case, a key result of Borcea and Streinu in 2011 characterises when a quotient graph can be lifted to a rigid periodic framework in \mathbb{R}^{d} . We develop an analogous theory for symmetric frameworks in \mathbb{R}^{d} . The results obtained apply to all finite and infinite 2-dimensional point groups, and then in arbitrary dimension they concern a wide range of infinite point groups, sufficiently large finite groups and groups containing translations and rotations. For the case of finite groups we also derive results concerning the probability of assigning group labels to a quotient graph so that the resulting lift is symmetrically rigid in \mathbb{R}^{d} . The submission date of this paper had been incorrectly displayed on the web page between 8 May 2024 and 5 June 2025. For the details, see the .
- 8 May 2024
- Published by European Mathematical Society - EMS - Publishing House GmbH in Documenta Mathematica
- Vol. 29 (3) , 561-595
Open AccessQuotient graphs of symmetrically rigid frameworks
A natural problem in combinatorial rigidity theory concerns the determination of the rigidity or flexibility of bar-joint frameworks in \mathbb{R}^{d} that admit some non-trivial symmetry. When d=2 there is a large literature on this topic. In particular, it is typical to quotient the symmetric graph by the group and analyse the rigidity of symmetric, but otherwise generic frameworks, using the combinatorial structure of the appropriate group-labelled quotient graph. However, mirroring the situation for generic rigidity, little is known combinatorially when d\geq 3 . Nevertheless in the periodic case, a key result of Borcea and Streinu in 2011 characterises when a quotient graph can be lifted to a rigid periodic framework in \mathbb{R}^{d} . We develop an analogous theory for symmetric frameworks in \mathbb{R}^{d} . The results obtained apply to all finite and infinite 2-dimensional point groups, and then in arbitrary dimension they concern a wide range of infinite point groups, sufficiently large finite groups and groups containing translations and rotations. For the case of finite groups we also derive results concerning the probability of assigning group labels to a quotient graph so that the resulting lift is symmetrically rigid in \mathbb{R}^{d} . The submission date of this paper had been incorrectly displayed on the web page between 8 May 2024 and 5 June 2025. For the details, see the .
- Open Access
Classifying the globally rigid edge-transitive graphs and distance-regular graphs in the plane
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 isometry) solution. In 2007, Jackson, Servatius and Servatius characterised exactly which vertex-transitive graphs are globally rigid solely by their degree and maximal clique number, two easily computable parameters for vertex-transitive graphs. In this short note we will extend this characterisation to all graphs that are determined by their automorphism group. We do this by characterising exactly which edge-transitive graphs and distance-regular graphs are globally rigid by their minimal and maximal degrees.
Open AccessClassifying the globally rigid edge-transitive graphs and distance-regular graphs in the plane
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 isometry) solution. In 2007, Jackson, Servatius and Servatius characterised exactly which vertex-transitive graphs are globally rigid solely by their degree and maximal clique number, two easily computable parameters for vertex-transitive graphs. In this short note we will extend this characterisation to all graphs that are determined by their automorphism group. We do this by characterising exactly which edge-transitive graphs and distance-regular graphs are globally rigid by their minimal and maximal degrees.
- Open Access
Which graphs are rigid in $\ell_p^d$?
We present three results which support the conjecture that a graph is minimally rigid in $d$-dimensional $\ell_p$-space, where $p\in (1,\infty)$ and $p\not=2$, if and only if it is $(d,d)$-tight. Firstly, we introduce a graph bracing operation which preserves independence in the generic rigidity matroid when passing from $\ell_p^d$ to $\ell_p^{d+1}$. We then prove that every $(d,d)$-sparse graph with minimum degree at most $d+1$ and maximum degree at most $d+2$ is independent in $\ell_p^d$. Finally, we prove that every triangulation of the projective plane is minimally rigid in $\ell_p^3$. A catalogue of rigidity preserving graph moves is also provided for the more general class of strictly convex and smooth normed spaces and we show that every triangulation of the sphere is independent for 3-dimensional spaces in this class.Open AccessWhich graphs are rigid in $\ell_p^d$?
We present three results which support the conjecture that a graph is minimally rigid in $d$-dimensional $\ell_p$-space, where $p\in (1,\infty)$ and $p\not=2$, if and only if it is $(d,d)$-tight. Firstly, we introduce a graph bracing operation which preserves independence in the generic rigidity matroid when passing from $\ell_p^d$ to $\ell_p^{d+1}$. We then prove that every $(d,d)$-sparse graph with minimum degree at most $d+1$ and maximum degree at most $d+2$ is independent in $\ell_p^d$. Finally, we prove that every triangulation of the projective plane is minimally rigid in $\ell_p^3$. A catalogue of rigidity preserving graph moves is also provided for the more general class of strictly convex and smooth normed spaces and we show that every triangulation of the sphere is independent for 3-dimensional spaces in this class. - Open Access
- 17 January 2024
- Published by Elsevier in Discrete Mathematics
- Vol. 347 (4)
How many contacts can exist between oriented squares of various sizes?
- 17 January 2024
- Published by Elsevier in Discrete Mathematics
- Vol. 347 (4)
Open AccessHow many contacts can exist between oriented squares of various sizes?