BJBill Jackson

Bill Jackson

*This is an algorithmically generated author record based on publicly available information.

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


Bill Jackson has a total of 76 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Volume Rigidity of Simplicial Manifolds

    by James Cruickshank, Bill Jackson, Shin-Ichi Tanigawa

    Classical results of Cauchy [4] and Dehn [5] imply that the 1-skeleton of a convex simplicial polyhedron P is rigid, i.e. every continuous motion of the vertices of P in $${\mathbb R}^3$$ R 3 which preserves its edge lengths results in a polyhedron which is congruent to P . This result was extended to convex simplicial polytopes in $${\mathbb R}^d$$ R d for all $$d\ge 3$$ d ≥ 3 by Whiteley [16], and to generic realisations of 1-skeletons of simplicial $$(d-1)$$ ( d - 1 ) -manifolds in $${\mathbb R}^{d}$$ R d by Kalai [8] for $$d\ge 4$$ d ≥ 4 and Fogelsanger [6] for $$d\ge 3$$ d ≥ 3 . We will generalise Kalai’s result by showing that, for all $$d\ge 4$$ d ≥ 4 and any fixed $$1\le k\le d-3$$ 1 ≤ k ≤ d - 3 , every generic realisation of the k -skeleton of a simplicial $$(d-1)$$ ( d - 1 ) -manifold in $${\mathbb R}^{d}$$ R d is volume rigid, i.e. every continuous motion of its vertices in $${\mathbb R}^d$$ R d which preserves the volumes of its k -faces results in a congruent realisation. In addition, we conjecture that our result remains true for $$k=d-2$$ k = d - 2 and verify this conjecture when $$d=4,5,6$$ d = 4 , 5 , 6 .

  • Open Access

    Sparsity, Stress-Independence and Globally Linked Pairs in Graph Rigidity Theory

    by Dániel Garamvölgyi, Bill Jackson, Tibor Jordán

    A graph is $\mathcal{R}_d$-independent (resp. $\mathcal{R}_d$-connected) if its $d$-dimensional generic rigidity matroid is free (resp. connected). A result of Maxwell from 1867 implies that every $\mathcal{R}_d$-independent graph satisfies the sparsity condition $|E(H)|\leq d|V(H)|-\binom{d+1}{2}$ for all subgraphs $H$ with at least $d+1$ vertices. Several other families of graphs $G$ arising naturally in rigidity theory, such as minimally globally $d$-rigid graphs, are known to satisfy the bound $|E(G)|\leq (d+1)|V(G)|-\binom{d+2}{2}$. We unify and extend these results by considering the family of $d$-stress-independent graphs which includes many of these families. We show that every $d$-stress-independent graph is $\mathcal{R}_{d+1}$-independent. A key ingredient in our proofs is the concept of $d$-stress-linked pairs of vertices. We derive a new sufficient condition for $d$-stress linkedness and use it to obtain a similar condition for a pair of vertices of a graph to be globally $d$-linked. This result strengthens a result of Tanigawa on globally $d$-rigid graphs. We also show that every minimally $\mathcal{R}_d$-connected graph $G$ is $\mathcal{R}_{d+1}$-independent and that the only subgraphs of $G$ that can satisfy Maxwell's criterion for $\mathcal{R}_{d+1}$-independence with equality are copies of $K_{d+2}$. Our results give affirmative answers to two conjectures in graph rigidity theory.

  • Open Access

    Volume Rigidity of Simplicial Manifolds

    by James Cruickshank, Bill Jackson, Shin-Ichi Tanigawa

    Classical results of Cauchy and Dehn imply that the 1-skeleton of a convex polyhedron $P$ is rigid i.e. every continuous motion of the vertices of $P$ in $\mathbb R^3$ which preserves its edge lengths results in a polyhedron which is congruent to $P$. This result was extended to convex poytopes in $\mathbb R^d$ for all $d\geq 3$ by Whiteley, and to generic realisations of 1-skeletons of simplicial $(d-1)$-manifolds in $\mathbb R^{d}$ by Kalai for $d\geq 4$ and Fogelsanger for $d\geq 3$. We will generalise Kalai's result by showing that, for all $d\geq 4$ and any fixed $1\leq k\leq d-3$, every generic realisation of the $k$-skeleton of a simplicial $(d-1)$-manifold in $\mathbb R^{d}$ is volume rigid, i.e. every continuous motion of its vertices in $\mathbb R^d$ which preserves the volumes of its $k$-faces results in a congruent realisation. In addition, we conjecture that our result remains true for $k=d-2$ and verify this conjecture when $d=4,5,6$.

  • Spanning even trees of graphs

    by Bill Jackson, Kiyoshi Yoshimoto

    A tree is said to be even if all pairs of vertices of degree one in are joined by a path of even length. We conjecture that every ‐regular nonbipartite connected graph has a spanning even tree and verify this conjecture when has a 2‐factor. Well‐known results of Petersen and Hanson et al. imply that the only remaining unsolved case is when is odd and has at least bridges. We investigate this case further and propose some related conjectures.


  • Open Access

    Maximal matroids in weak order posets

    by Bill Jackson, Shin-Ichi Tanigawa


  • Open Access

    Issue Information

    by Xiutao Zhu, Yaojun Chen, Bahareh Afshari, Rachel Aldred, Bill Jackson, Michael D. Plummer, Oliver Bachtler, Irene Heinrich, Felix Bock, Johannes Pardey, et al.

  • Open Access

    Edge proximity conditions for extendability in regular bipartite graphs

    by R. E. L. Aldred, Bill Jackson, Michael D. Plummer

    Let and be positive integers with , let be an ‐regular cyclically ‐edge‐connected bipartite graph and let be a matching of size in . Plummer showed that whenever , there is a perfect matching of containing . When , Aldred and Jackson, extended this result to the case when by showing there is a perfect matching in containing whenever the edges in are pairwise at least distance apart where In this paper, we relax the condition that and the distance restriction introduced by Aldred and Jackson to show that, for and an ‐regular cyclically ‐edge‐connected bipartite graph, for each matching in with and such that each pair of edges in is distance at least 3 apart, there is a perfect matching in containing .


  • Open Access

    Flexible circuits in the $d$-dimensional rigidity matroid

    by Georg Grasegger, Hakan Guler, Bill Jackson, Anthony Nixon

    A bar-joint framework $(G,p)$ in $\mathbb{R}^d$ is rigid if the only edge-length preserving continuous motions of the vertices arise from isometries of $\mathbb{R}^d$. It is known that, when $(G,p)$ is generic, its rigidity depends only on the underlying graph $G$, and is determined by the rank of the edge set of $G$ in the generic $d$-dimensional rigidity matroid $\mathcal{R}_d$. Complete combinatorial descriptions of the rank function of this matroid are known when $d=1,2$, and imply that all circuits in $\mathcal{R}_d$ are generically rigid in $\mathbb{R}^d$ when $d=1,2$. Determining the rank function of $\mathcal{R}_d$ is a long standing open problem when $d\geq 3$, and the existence of non-rigid circuits in $\mathcal{R}_d$ for $d\geq 3$ is a major contributing factor to why this problem is so difficult. We begin a study of non-rigid circuits by characterising the non-rigid circuits in $\mathcal{R}_d$ which have at most $d+6$ vertices.

  • Open Access

    Coincident Rigidity of 2-Dimensional Frameworks

    by Hakan Guler, Bill Jackson