<html><head><meta http-equiv="content-type" content="text/html; charset=us-ascii"></head><body dir="auto"><div dir="ltr" style="font-size: 12pt; -webkit-text-size-adjust: auto; text-align: center; font-family: Calibri, Helvetica, sans-serif;"><img src="cid:5D78AAF5-E2F7-4003-A1B7-CECC7E18987D" id="x_x_x_x_x_x_x_x_x_x_x_x_x_x_m_8291947491110600934x_x_image_0" data-olk-copy-source="MailCompose" width="980" height="154" style="max-width: 1773px; width: 655px !important; height: 102.86297px !important;" alt="AD_4nXctgSm5Pm0l3H_WbeeDUvxz7h45mAiHqr6wsc3emkxkrGahv2gA7w3WWjB16Aa2fVhCIwwq3nv4_xMeTR8EdRNkedaYOFSYjpZBUuizYfal0M7G5_iLPc68qy5__NpIbzSawut_eU3UXPQ2TzIgyvfQHEGQONrd7vtzrJjfGhblVdzvBwU"></div><blockquote style="-webkit-text-size-adjust: auto; margin: 0px 0px 0px 0.8ex; padding-left: 1ex; border-left-width: 1px; border-left-style: solid; border-left-color: rgb(204, 204, 204);"><div dir="ltr" style="text-align: center; margin: 0px; font-family: "Times New Roman", Times, serif; font-size: 36pt;"><span style="background-color: rgb(255, 255, 255);"><b>Colloquium for <span dir="ltr">October 15, 2025</span></b></span></div><div dir="ltr" style="text-align: center; margin: 0px; font-family: Calibri, Helvetica, sans-serif; font-size: 16px;"><span style="background-color: rgb(255, 255, 255);"><u> </u></span></div><div dir="ltr" style="text-align: center; margin: 0px; font-family: Calibri, Helvetica, sans-serif; font-size: 16px;"><span style="background-color: rgb(255, 255, 255);"><u><br></u></span></div><div dir="ltr" style="text-align: center; margin: 0px; font-family: "Times New Roman", Times, serif; font-size: 16pt;"><span style="background-color: rgb(255, 255, 255);">Greta Panova</span></div><div dir="ltr" style="text-align: center; margin: 0px; font-family: "Times New Roman", Times, serif;"><span style="font-size: 16pt; background-color: rgb(255, 255, 255);"> </span><span style="font-size: 12pt; background-color: rgb(255, 255, 255);">Gabilan Distinguished Professor</span></div><div dir="ltr" style="text-align: center; margin: 0px; font-family: "Times New Roman", Times, serif; font-size: 16px;"><span style="background-color: rgb(255, 255, 255);">Department of Mathematics</span></div><div dir="ltr" style="text-align: center; margin: 0px; font-family: "Times New Roman", Times, serif; font-size: 16px;"><span style="background-color: rgb(255, 255, 255);">USC</span></div><div dir="ltr" style="text-align: center; margin: 0px; font-family: Calibri, Helvetica, sans-serif; font-size: 16px;"><span style="background-color: rgb(255, 255, 255);"><br></span></div><div dir="ltr" style="text-align: center; margin: 0px; font-family: "Times New Roman", Times, serif; font-size: 16pt;"><span style="background-color: rgb(255, 255, 255);">"Computational Complexity in Algebraic Combinatorics"</span></div><div dir="ltr" style="text-align: center; margin: 0px; font-family: "Times New Roman", Times, serif; font-size: 16pt;"><span style="background-color: rgb(255, 255, 255);"><br></span></div><div dir="ltr" style="text-align: center; margin: 0px; font-family: "Times New Roman", Times, serif; font-size: 16pt;"><span style="background-color: rgb(255, 255, 255);"><span dir="ltr">Wednesday, October 15, 2025, at 3:00PM</span></span></div><div dir="ltr" style="text-align: center; margin: 0px; font-family: "Times New Roman", Times, serif; font-size: 16pt;"><span style="background-color: rgb(255, 255, 255);">Eckhart Hall, <span dir="ltr">Room 206, 5734 S. University Avenue</span></span></div><div dir="ltr" style="text-align: center; margin: 0px; font-family: Calibri, Helvetica, sans-serif; font-size: 16px;"><span style="background-color: rgb(255, 255, 255);"><br></span></div><div dir="ltr" style="text-align: center; margin: 0px; font-family: "Times New Roman", Times, serif; font-size: 16pt;"><span style="background-color: rgb(255, 255, 255);">Abstract</span></div></blockquote><div dir="ltr" class="elementToProof" style="-webkit-text-size-adjust: auto; text-align: center; margin: 0px; font-family: "Times New Roman", Times, serif; font-size: 16pt;"><span style="background-color: rgb(255, 255, 255);"><br></span></div><div dir="ltr" class="elementToProof" style="-webkit-text-size-adjust: auto; line-height: 1.8; font-family: "Times New Roman", Times, serif; font-size: 16pt;"><span style="background-color: rgb(255, 255, 255);">Representation theoretic multiplicities are at the heart of many open problems in algebraic combinatorics. At the same time these quantities appear in Geometric Complexity Theory in the search for multiplicity obstructions for separating computational complexity classes like VP vs VNP. Most recently they have also been considered in quantum computing.<br><br></span></div><div dir="ltr" class="elementToProof" style="-webkit-text-size-adjust: auto; line-height: 1.8; font-family: "Times New Roman", Times, serif; font-size: 16pt;"><span style="background-color: rgb(255, 255, 255);">In this talk we will introduce the objects and problems, explain how formalization through computational complexity theory could answer some of the open problems in the negative. We will also explain their role in GCT and quantum computing with a mixture of positive and negative answers.</span></div><div dir="ltr"></div></body></html>