ACAdam D. W. Clay
Adam D. W. Clay
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Adam D. W. Clay has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Sára Hanna Tóth
Department of Operations Research, ELTE Eötvös Loránd University, Budapest, Hungary
2 shared publications - Tibor Jordán
Group on Combinatorial Optimization HUN-REN-ELTE Egerváry Research Pázmány Péter sétány 1/C 1117 Budapest Hungary
2 shared publications
Latest Publications
- Open Access
- 11 October 2025
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 76 (2) , 1-27
Minimally Rigid Tensegrity Frameworks
A d -dimensional tensegrity framework ( T , p ) is an edge-labeled geometric graph in $$\mathbb {R}^d$$ , which consists of a graph $$T=(V,B\cup C\cup S)$$ and a map $$p:V\rightarrow \mathbb {R}^d$$ . The labels determine whether an edge uv of T corresponds to a fixed length bar in ( T , p ), or a cable which cannot increase in length, or a strut which cannot decrease in length. We consider minimally infinitesimally rigid d -dimensional tensegrity frameworks and provide tight upper bounds on the number of its edges, in terms of the number of vertices and the dimension d . We obtain stronger upper bounds in the case when there are no bars and the framework is in generic position. The proofs use methods from convex geometry and matroid theory. A special case of our results confirms a conjecture of Whiteley from 1987. We also give an affirmative answer to a conjecture concerning the number of edges of a graph whose three-dimensional rigidity matroid is minimally connected.- 11 October 2025
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 76 (2) , 1-27
Open AccessMinimally Rigid Tensegrity Frameworks
A d -dimensional tensegrity framework ( T , p ) is an edge-labeled geometric graph in $$\mathbb {R}^d$$ , which consists of a graph $$T=(V,B\cup C\cup S)$$ and a map $$p:V\rightarrow \mathbb {R}^d$$ . The labels determine whether an edge uv of T corresponds to a fixed length bar in ( T , p ), or a cable which cannot increase in length, or a strut which cannot decrease in length. We consider minimally infinitesimally rigid d -dimensional tensegrity frameworks and provide tight upper bounds on the number of its edges, in terms of the number of vertices and the dimension d . We obtain stronger upper bounds in the case when there are no bars and the framework is in generic position. The proofs use methods from convex geometry and matroid theory. A special case of our results confirms a conjecture of Whiteley from 1987. We also give an affirmative answer to a conjecture concerning the number of edges of a graph whose three-dimensional rigidity matroid is minimally connected. - Open Access
Minimally rigid tensegrity frameworks
A $d$-dimensional tensegrity framework $(T,p)$ is an edge-labeled geometric graph in ${\mathbb R}^d$, which consists of a graph $T=(V,B\cup C\cup S)$ and a map $p:V\to {\mathbb R}^d$. The labels determine whether an edge $uv$ of $T$ corresponds to a fixed length bar in $(T,p)$, or a cable which cannot increase in length, or a strut which cannot decrease in length. We consider minimally infinitesimally rigid $d$-dimensional tensegrity frameworks and provide tight upper bounds on the number of its edges, in terms of the number of vertices and the dimension $d$. We obtain stronger upper bounds in the case when there are no bars and the framework is in generic position. The proofs use methods from convex geometry and matroid theory. A special case of our results confirms a conjecture of Whiteley from 1987. We also give an affirmative answer to a conjecture concerning the number of edges of a graph whose three-dimensional rigidity matroid is minimally connected.Open AccessMinimally rigid tensegrity frameworks
A $d$-dimensional tensegrity framework $(T,p)$ is an edge-labeled geometric graph in ${\mathbb R}^d$, which consists of a graph $T=(V,B\cup C\cup S)$ and a map $p:V\to {\mathbb R}^d$. The labels determine whether an edge $uv$ of $T$ corresponds to a fixed length bar in $(T,p)$, or a cable which cannot increase in length, or a strut which cannot decrease in length. We consider minimally infinitesimally rigid $d$-dimensional tensegrity frameworks and provide tight upper bounds on the number of its edges, in terms of the number of vertices and the dimension $d$. We obtain stronger upper bounds in the case when there are no bars and the framework is in generic position. The proofs use methods from convex geometry and matroid theory. A special case of our results confirms a conjecture of Whiteley from 1987. We also give an affirmative answer to a conjecture concerning the number of edges of a graph whose three-dimensional rigidity matroid is minimally connected.