![]() |
![]() |
University of Birmingham > Talks@bham > Computer Security Seminars > The explicit isomorphism problem and its applications"
The explicit isomorphism problem and its applications"Add to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Mani Bhesania. Let A be an algebra over a field K which is given by a basis and a multiplication table of the basis elements. Furthermore, suppose that A is isomorphic to M_n(K), the algebra of nxn matrices with entries from K. The algorithmic task, known as the explicit isomorphism problem, is to compute an isomorphism between A and M_n(K). This problem comes from computational representation theory, but has various applications in many areas of computational mathematics: solving diophantine equations, finding generators for the group of rational points of an elliptic curves, parametrizing algebraic varieties. Recently, it has also been linked to the creation of error-correcting codes and cryptography. After surveying the known cases of the explicit isomorphism problem, I would like discuss these applications. This talk is part of the Computer Security Seminars series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsPIPS - Postgraduate Informal Physics Seminars School of Mathematics Events ddddOther talksPerfect matchings in random sparsifications of Dirac hypergraphs Quantum simulations using ultra cold ytterbium Modelling uncertainty in image analysis. Sensing and metrology activities at NPL, India TBC Ultrafast, all-optical, and highly efficient imaging of molecular chirality |