The non-solvability by radicals of generic 3-connected planar laman graphs

Transactions of the American Mathematical Society

Volumn 359, Issue 5, 2007, Pages 2269-2303

  Owen, J C ^a   Power, S C ^b  

^a Park House   (United Kingdom)

^b LANCASTER UNIVERSITY   (United Kingdom)

Author keywords

3 connected; Algorithms for CAD; Maximally independent graph; Solvable by radicals

Indexed keywords

EID: 72949087043     PISSN: 00029947     EISSN: None     Source Type: Journal    
DOI: 10.1090/S0002-9947-06-04049-9     Document Type: Article

References (20)

1. L. Asimow and B. Roth, The Rigidity of Graphs, Trans. Amer. Math. Soc., 245 (1978), 279-289. MR0511410 (80i:57004a)
2. W. Bouma, I. Fudos I, C. Hoffmann C., J, Cai, R. Paige, A geometric constraint solver, Computer Aided Design 27 (1995), 487-501.
3. R. Diestel, Graph Theory, Springer-Verlag, 1997. MR1448665
4. D. Cox, J. Little, D. O'Shea, Ideals, Varieties and Algorithms, Springer-Verlag, 1992. MR1189133 (93j:13031)
5. D.J. Jacobs, A.J. Rado, L.A. Kuhn and M.F. Thorpe, Protein flexibility predictions using graph theory, Proteins, Structure, Functions and Genetics, 44 (2001), 150-165.
6. X.-S. Gao, S.-C Chou, Solving geometric constraint systems. II. A symbolic approach and decision of rc-constructibility, Computer-Aided Design, 30 (1998), 115-122.
7. R. Haas, D. Orden, G. Rote, F. Santos, B. Servatius, H. Servatius, D. Souvaine, I. Streinu and W. Whiteley, Planar Minimally Rigid Graphs and Pseudo-Triangulations, J. Computational Geometry: Theory and Applications", 2005 (May), 31-61. MR2131802
8. W.V.D. Hodge, D. Pedoe, Methods of Algebraic Geometry Volume 2, Cambridge University Press, 1952. MR0048065 (13:972c)
9. J.E. Hopcroft and R.E. Tarjan, Dividing a graph into connected components, Siam J. of Computing, 2 (1973), 135-158. MR0327391 (48:5733)
10. G. Laman, On graphs and the rigidity of plane skeletal structures, J. Engineering Mathematics, 4 (1970), 331-340. MR0269535 (42:4430)
11. R. Light and J. Gossard, Modification of geometric models through variational constraints, Computer Aided Design, 14 (1982) 209.
12. J.C. Owen, Algebraic solution for geometry from dimensional constraints, in ACM Symposium on Foundations in Solid Modeling, pages 397-407, Austen, Texas, 1991.
13. J. C. Owen and S. C. Power, The Nonsolvability by Radicals of Generic 3-connected Planar Graphs, 4th International Workshop on Automated Deduction in Geometry 2002, RISC Linz, Lecture Notes in Artificial Intelligence vol. 2930, F. Winkler (Ed.) Springer, 2004. MR2090404
14. I. Stewart, Galois Theory, Chapman and Hall, 1973. MR0330122 (48:8460)
15. I. Streinu, A Combinatorial Approach to Planar Non-colliding Robot Arm Motion Planning, 41st Annual Symposium on Foundations of Computer Science (Redondo Beach, CA, 2000), IEEE Comput. Soc. Press, Los Alamitos, CA, 2000, pp. 443-453. MR1931841
16. I. Streinu, Combinatorial Roadmaps in Configuration Spaces of Simple Planar Polygons, DIMACS Workshop on Algorithmic and Quantitative Aspects of Real Algebraic Geometry in Mathematics and Computer Science, March 2001, DIMACS Center, Rutgers University, Eds. S. Basu and L. Gonzalez-Vega, American Mathematical Society, 2001, 181-206. MR1995020 (2004i:68234)
17. W.T. Tutte, Graph Theory, Addison-Wesley, 1984. MR0746795 (87c:05001)
18. B.L. Van Der Waerden, Modern Algebra Vol. I, English Translation 1948. MR0029363 (10:587b)
19. W. Whiteley, in Matroid Applications ed. N. White, Encyclodedia of Mathematics and its applications 40 (1992), 1-51. MR1165537 (92m:05004)
20. W. Whiteley, Rigidity and scene analysis, Handbook of Discrete and Computational Geometry, eds. J.E. Goodman and J. O'Rourke, CRC Press, 1997. MR1730205