IDEAL scholar Xiaorui Sun’s groundbreaking algorithm for the group isomorphism problem was featured in an article in Quanta Magazine. The article reads:
“A paper by Xiaorui Sun of the University of Illinois, Chicago has presented a new, faster algorithm for a…question called the group isomorphism problem, which is about knowing when two mathematical objects called groups are the same. The work, posted online this past March, takes a small step toward clarifying the underlying computational complexity involved in comparing objects.
Sun’s work breaks a long-standing speed limit for a particular class of groups — the one regarded as the hardest instance of the group isomorphism problem to solve. If an algorithm can quickly compare groups of this sort, the hope is that it can quickly compare groups of any type.”
Read more: https://www.quantamagazine.org/computer-scientists-inch-closer-to-major-algorithmic-goal-20230623/