University of Cambridge > Talks.cam > Mathematics and Computation > Colored Jones polynomials and the volume conjecture

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Colored Jones polynomials and the volume conjecture

Download to your calendar using vCal

If you have a question about this talk, please contact Challenger Mishra .

I explain that correlations among the topological invariants of knots can be machine learned. The volume conjecture, which relates quantum and classical knot invariants, supplies a case study for opening up the black box, identifying salient features in a dataset, and using this to deduce how the machine learns. I detail the construction of colored Jones polynomials in the adjoint representation of SU(2) and apply neural networks on this dataset to predict the volume of the knot complement of hyperbolic knots. Based on these experiments, I propose an improved statement of the volume conjecture.

Venue: The Computer Laboratory, FW26

Zoom:

https://cl-cam-ac-uk.zoom.us/j/6590822098?pwd=VTBuUXRXN29qMDF4TGpaaEhFaytQQT09 Meeting ID: 659 082 2098 Passcode: 1dYRka

This talk is part of the Mathematics and Computation series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

in person & via zoom Gates Scholars Common Room, University Centre on Mill Lane LR3, Engineering Department, Baker Building

Other talks

CONFERENCE: Chemical and material sciences enabled by AI and automation Title to be confirmed The elephant in the room: Machine Learning directly into physical models Dr Dinis Calado, Senior Group Leader, Immunity and Cancer Laboratory, the Francis Crick Institute Title to be confirmed Title to be confirmed
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity