A Computational Approach to the Conjugacy Problem

Very recent work by Boyle and Steinberg has shown that certain equivalence problems for C* algebras are decidable. This means that, in principle, an algorithm exists which can determine if these equivalences hold and that this algorithm will finish execution in a finite number of calculations. Such an algorithm was described in abstract terms by Grunewald to solve the ‘conjugacy problem’. There is no implementation of Grunewald’s algorithm. This project aims to describe Grunewald’s algorithm in pseudo-code and then implement it, in part or in full. In particular, this project will focus on the special case of the conjugacy problem over the general linear group.

Amelia Lee

University of Wollongong

Amelia Lee is a Mathematics Advanced student at the University of Wollongong. Her interests include computational algorithms, especially those relating to cryptography. She has professional experience developing and implementing financial algorithms for the wealth-management industry. Amelia is equally excited and terrified by the power of artificial intelligence.

You may be interested in

Mikayla Goodwin

Mikayla Goodwin

Effect Size Measures, Sampling Behaviour and Use Across Fields of Study
Tony Wang

Tony Wang

C∗-Algebras of Self-Similar Groupoid Actions on Higher-Rank Graphs
Holly Casey

Holly Casey

Understanding the Mechanisms of Fate Determination During T Cell Development: A Mathematical Model
Alexander Cox

Alexander Cox

Proof Of Calculi Equivalence In The Hol Theorem Prover
Contact Us

We're not around right now. But you can send us an email and we'll get back to you, asap.

Not readable? Change text.