I have developed a numerical method for computing A-polynomials which combines Jan Vershelde's PHCpack software with an interpolation scheme based on the Fast Fourier Transform. An implementation of the method in python, using Jeff Weeks' SnapPeaPython will be available soon.

The A-polynomials of approximately 350 knots in S3 are posted here as text files, formatted to be readable by symbolic computation programs. The list of knots includes all knots which can be triangulated with up to seven ideal tetrahedra. (These have been tabulated by Callahan, Dean and Weeks and Champanerkar, Kofman and Patterson.) Also included are all knots with up to 8 crossings, most 9-crossing knots and many 10 crossing knots.

Thanks to Abhijit Champanerkar, Nathan Dunfield and Ilya Kofman for advice and assistance with this project.

This material is based on work supported by the National Science Foundation under Grant No. 0504975.
Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author and do not necessarily reflect the views of the National Science Foundation.