COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > A Prolog-assisted search for simple Lie algebras
A Prolog-assisted search for simple Lie algebrasAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact nobody. GR2W02 - Simple groups, representations and applications (jt work with David Cushing and George Stagg)Prolog is a very unusual programming language, developed in one of the buildings on the way to the CIRM in Luminy. It is not fundamentally iterative in the way that, for example, GAP and Magma are. Instead it operates by taking a list of axioms as input, and responds at the command line to queries asking the language to achieve particular goals. It gained some notoriety by beating contestants on the game show Jeopardy in 2011. It is also the worlds fastest sudoku solver. I will describe some recent Prolog investigations to search for new simple Lie algebras over the field GF(2). We were able to discover some new examples in dimensions 15 and 31 and extrapolate from these to construct two new infinite families of simple Lie algebras. This talk is part of the Isaac Newton Institute Seminar Series series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsType the title of a new list here Conferences on Classical Architecture Wolfson-HAT Foundation Annual Symposium Series on Personal DataOther talksRole of cellular senescence in cancer and ageing: therapeutic opportunities Last steps in a proof of the McKay Conjecture on character degrees Clinical presentation of squamous cell carcinoma of the frontal sinus and response to radiation therapy Initial-boundary value problems for Boussinesq-type systems Interpreters for Free Active Phase Separation |