Anthony Nixon
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
Anthony Nixon has a total of 77 co-authors. Here are the top co-authors by number of shared publications:
- Bernd Schulze
School of Mathematical Sciences, Lancaster University, Lancaster, UK
12 shared publications - Bill Jackson
School of Mathematical Sciences Queen Mary University of London Mile End Road E1 4NS London United Kingdom
12 shared publications - Georg Grasegger
Johann Radon Institute for Computational and Applied Mathematics (RICAM), Austrian Academy of Sciences, Linz, Austria
6 shared publications - Sean Dewar
University of Bristol, United Kingdom
6 shared publications - Elissa Ross
Worcester Polytechnic Institute
5 shared publications - Hakan Guler
Department of Mathematics Faculty of Arts & Sciences Kastamonu University Kastamonu Turkey
5 shared publications
Latest Publications
- Open Access
- 23 July 2026
- Published by Wiley in Journal of the London Mathematical Society
- Vol. 114 (1)
Identifiability of points and rigidity of hypergraphs under algebraic constraints
The identifiability problem arises naturally in a number of contexts in mathematics and computer science. Specific instances include local or global rigidity of graphs and unique completability of partially‐filled tensors subject to rank conditions. The identifiability of points on secant varieties has also been a topic of much research in algebraic geometry. It is often formulated as the problem of identifying a set of points satisfying a given set of algebraic relations. A key question then is to prove sufficient conditions for relations to guarantee the identifiability of the points. This paper proposes a new general framework for capturing the identifiability problem when a set of algebraic relations has a combinatorial structure and develops tools to analyse the impact of the underlying combinatorics on the local or global identifiability of points. Our framework is built on the language of graph rigidity, where the measurements are Euclidean distances between two points, but applicable in the generality of hypergraphs with arbitrary algebraic measurements. We establish necessary and sufficient (hyper)graph‐theoretical conditions for identifiability by exploiting techniques from graph rigidity theory and algebraic geometry of secant varieties. In particular our work analyses combinatorially the effect of non‐generic projections of secant varieties.
- 23 July 2026
- Published by Wiley in Journal of the London Mathematical Society
- Vol. 114 (1)
Open AccessIdentifiability of points and rigidity of hypergraphs under algebraic constraints
The identifiability problem arises naturally in a number of contexts in mathematics and computer science. Specific instances include local or global rigidity of graphs and unique completability of partially‐filled tensors subject to rank conditions. The identifiability of points on secant varieties has also been a topic of much research in algebraic geometry. It is often formulated as the problem of identifying a set of points satisfying a given set of algebraic relations. A key question then is to prove sufficient conditions for relations to guarantee the identifiability of the points. This paper proposes a new general framework for capturing the identifiability problem when a set of algebraic relations has a combinatorial structure and develops tools to analyse the impact of the underlying combinatorics on the local or global identifiability of points. Our framework is built on the language of graph rigidity, where the measurements are Euclidean distances between two points, but applicable in the generality of hypergraphs with arbitrary algebraic measurements. We establish necessary and sufficient (hyper)graph‐theoretical conditions for identifiability by exploiting techniques from graph rigidity theory and algebraic geometry of secant varieties. In particular our work analyses combinatorially the effect of non‐generic projections of secant varieties.
- Open Access
- 1 June 2026
- Published by Wiley in Journal of Graph Theory
- Vol. 113 (3) , 411-427
Stable Cuts, NAC‐Colourings and Flexible Realisations of Graphs
A (2-dimensional) realisation of a graph is a pair , where maps the vertices of to . A realisation is flexible if it can be continuously deformed while keeping the edge lengths fixed, and rigid otherwise. We say that is rigid if every generic realisation of is rigid; otherwise, is flexible. In this paper, we investigate the relationship between stable cuts and graphs which are either flexible or admit a flexible (not necessarily generic) realisation with positive edge lengths. We strengthen a result of Chen and Yu, who proved that every -vertex graph with at most edges has a stable cut, by showing that every flexible graph has a stable cut. The existence of a stable cut is a sufficient, but not necessary, condition for a flexible realisation to exist. Using a result of Le and Pfender on stable cuts, we prove a conjecture of Grasegger, Legerský and Schicho that characterises the minimally rigid graphs that admit a flexible realisation. Additionally, we investigate the number of NAC-colourings in various graphs. A NAC-colouring is a type of edge colouring introduced by Grasegger, Legerský and Schicho, who showed that the existence of such a colouring characterises the existence of a flexible realisation with positive edge lengths. We provide an upper bound on the number of NAC-colourings for arbitrary graphs, and construct families of graphs, including rigid and minimally rigid ones, for which this number is exponential in the number of vertices.- 1 June 2026
- Published by Wiley in Journal of Graph Theory
- Vol. 113 (3) , 411-427
Open AccessStable Cuts, NAC‐Colourings and Flexible Realisations of Graphs
A (2-dimensional) realisation of a graph is a pair , where maps the vertices of to . A realisation is flexible if it can be continuously deformed while keeping the edge lengths fixed, and rigid otherwise. We say that is rigid if every generic realisation of is rigid; otherwise, is flexible. In this paper, we investigate the relationship between stable cuts and graphs which are either flexible or admit a flexible (not necessarily generic) realisation with positive edge lengths. We strengthen a result of Chen and Yu, who proved that every -vertex graph with at most edges has a stable cut, by showing that every flexible graph has a stable cut. The existence of a stable cut is a sufficient, but not necessary, condition for a flexible realisation to exist. Using a result of Le and Pfender on stable cuts, we prove a conjecture of Grasegger, Legerský and Schicho that characterises the minimally rigid graphs that admit a flexible realisation. Additionally, we investigate the number of NAC-colourings in various graphs. A NAC-colouring is a type of edge colouring introduced by Grasegger, Legerský and Schicho, who showed that the existence of such a colouring characterises the existence of a flexible realisation with positive edge lengths. We provide an upper bound on the number of NAC-colourings for arbitrary graphs, and construct families of graphs, including rigid and minimally rigid ones, for which this number is exponential in the number of vertices. - 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
Sharp thresholds for NAC-colourings and stable cuts in random graphs
NAC-colourings of graphs correspond to flexible quasi-injective realisations in $\mathbb {R} ^2$. A special class of NAC-colourings are those that arise from stable cuts. We give sharp thresholds for the random graph to have no stable cut and to have no NAC-colouring via exact hitting-time results: with high probability, the random graph process gains both properties at the precise time that every vertex is in a triangle. Our thresholds complement recent results on the thresholds for the random graph to be generically or globally rigid in $\mathbb {R} ^d$, and for all injective realisations to be globally rigid in $\mathbb {R} $.Open AccessSharp thresholds for NAC-colourings and stable cuts in random graphs
NAC-colourings of graphs correspond to flexible quasi-injective realisations in $\mathbb {R} ^2$. A special class of NAC-colourings are those that arise from stable cuts. We give sharp thresholds for the random graph to have no stable cut and to have no NAC-colouring via exact hitting-time results: with high probability, the random graph process gains both properties at the precise time that every vertex is in a triangle. Our thresholds complement recent results on the thresholds for the random graph to be generically or globally rigid in $\mathbb {R} ^d$, and for all injective realisations to be globally rigid in $\mathbb {R} $. - Open Access
Generalised Erdős distance theory on graphs
The famous Erdős distinct distances problem asks the following: how many distinct distances must exist between a set of $n$ points in the plane? There are many generalisations of this question that ask one to consider different spaces and metrics, or larger structures of points. We bring these problems into a common framework using the concept of $g$-rigidity. Specifically, if $G=(V,E)$ is a (hyper)graph, $g$ is a map assigning polynomial measurements to the edges of $G$ and $f_{g,G}(P^V)$ gives the set of $g$-distinct realisations of the $g$-rigid graph $G$, where vertices must lie in a point set $P$, our main results describe sharp lower bounds for the size of $\big|f_{g,G}(P^V)\big|$. This allows us to obtain results for pseudo-Euclidean metrics, $\ell_p$ metrics, dot-product problems, matrix completion problems, and symmetric tensor completion problems. In addition, we use the recent work of Alon, Bucić and Sauermann along with a simple colouring argument to prove that the number of $\| \cdot\|$-distinct realisations of a graph $G=(V,E)$ within a $d$-dimensional point set $P$ is at least $Ω\left(\frac{|P|^{|V|-1}}{(\log |P|)^2} \right)$ for almost all $d$-norms. Our methods here also provide a short proof that the unit distance conjecture implies the pinned distance conjecture.Open AccessGeneralised Erdős distance theory on graphs
The famous Erdős distinct distances problem asks the following: how many distinct distances must exist between a set of $n$ points in the plane? There are many generalisations of this question that ask one to consider different spaces and metrics, or larger structures of points. We bring these problems into a common framework using the concept of $g$-rigidity. Specifically, if $G=(V,E)$ is a (hyper)graph, $g$ is a map assigning polynomial measurements to the edges of $G$ and $f_{g,G}(P^V)$ gives the set of $g$-distinct realisations of the $g$-rigid graph $G$, where vertices must lie in a point set $P$, our main results describe sharp lower bounds for the size of $\big|f_{g,G}(P^V)\big|$. This allows us to obtain results for pseudo-Euclidean metrics, $\ell_p$ metrics, dot-product problems, matrix completion problems, and symmetric tensor completion problems. In addition, we use the recent work of Alon, Bucić and Sauermann along with a simple colouring argument to prove that the number of $\| \cdot\|$-distinct realisations of a graph $G=(V,E)$ within a $d$-dimensional point set $P$ is at least $Ω\left(\frac{|P|^{|V|-1}}{(\log |P|)^2} \right)$ for almost all $d$-norms. Our methods here also provide a short proof that the unit distance conjecture implies the pinned distance conjecture. - Open Access
- 6 March 2025
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 73 (3) , 629-673
Rigidity of Symmetric Frameworks on the Cylinder
A bar-joint framework (G, p) is the combination of a finite simple graph $$G=(V,E)$$ and a placement $$p:V\rightarrow {\mathbb {R}}^d$$ . The framework is rigid if the only edge-length preserving continuous motions of the vertices arise from isometries of the space. This article combines two recent extensions of the generic theory of rigid and flexible graphs by considering symmetric frameworks in $${\mathbb {R}}^3$$ restricted to move on a surface. In particular necessary combinatorial conditions are given for a symmetric framework on the cylinder to be isostatic (i.e. minimally infinitesimally rigid) under any finite point group symmetry. In every case when the symmetry group is cyclic, which we prove restricts the group to being inversion, half-turn or reflection symmetry, these conditions are then shown to be sufficient under suitable genericity assumptions, giving precise combinatorial descriptions of symmetric isostatic graphs in these contexts.- 6 March 2025
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 73 (3) , 629-673
Open AccessRigidity of Symmetric Frameworks on the Cylinder
A bar-joint framework (G, p) is the combination of a finite simple graph $$G=(V,E)$$ and a placement $$p:V\rightarrow {\mathbb {R}}^d$$ . The framework is rigid if the only edge-length preserving continuous motions of the vertices arise from isometries of the space. This article combines two recent extensions of the generic theory of rigid and flexible graphs by considering symmetric frameworks in $${\mathbb {R}}^3$$ restricted to move on a surface. In particular necessary combinatorial conditions are given for a symmetric framework on the cylinder to be isostatic (i.e. minimally infinitesimally rigid) under any finite point group symmetry. In every case when the symmetry group is cyclic, which we prove restricts the group to being inversion, half-turn or reflection symmetry, these conditions are then shown to be sufficient under suitable genericity assumptions, giving precise combinatorial descriptions of symmetric isostatic graphs in these contexts. - 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
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.
Open 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.
- 8 January 2025
- Published by Akademiai Kiado Zrt. in Studia Scientiarum Mathematicarum Hungarica
- Vol. 61 (4) , 377-399
Universal Rigidity of Ladders on the Line
In [3] it is shown, answering a question of Jordán and Nguyen [9], that universal rigidity of a generic bar-joint framework in ℝ1 depends on more than the ordering of the vertices. The graph 𝐺 that was used in that paper is a ladder with three rungs. Here we provide a general answer when that ladder with three rungs in the line is universally rigid and when it is not.
- 8 January 2025
- Published by Akademiai Kiado Zrt. in Studia Scientiarum Mathematicarum Hungarica
- Vol. 61 (4) , 377-399
Universal Rigidity of Ladders on the Line
In [3] it is shown, answering a question of Jordán and Nguyen [9], that universal rigidity of a generic bar-joint framework in ℝ1 depends on more than the ordering of the vertices. The graph 𝐺 that was used in that paper is a ladder with three rungs. Here we provide a general answer when that ladder with three rungs in the line is universally rigid and when it is not.
- 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