BEGIN:VCALENDAR
VERSION:2.0
CALSCALE:GREGORIAN
PRODID:adamgibbons/ics
METHOD:PUBLISH
X-PUBLISHED-TTL:PT1H
BEGIN:VEVENT
UID:a8ddr8KHcQIpFZOg4R8vv
SUMMARY:Computation in Representation Theory
DTSTAMP:20260505T150900Z
DTSTART;VALUE=DATE:20251110
DTEND;VALUE=DATE:20251114
DESCRIPTION:This workshop encompasses three major aspects of computation wi
	thin Representation Theory and Algebraic Combinatorics. One concerns the d
	evelopment of efficient algorithms to compute important quantities in orde
	r to understand and classify them better. This is closely related to under
	standing what optimality we could expect and in particular the computation
	al complexity aspects of those problems. Their computational complexity cl
	ass can also be used to understand the existence of combinatorial interpre
	tations\, in particular for major structure constants lacking positive for
	mulas like Kronecker and plethysm coefficients. On the other hand\, repres
	entation theory has seen important applications within computational compl
	exity theory\, in the context of Geometric Complexity Theory and Quantum I
	nformation Theory. Last\, but not least\, we will discuss the collection o
	f “experimental” data\, which helps formulate conjectures\, find counterex
	amples and understand the behavior for some of the problems listed above.
URL:https://icerm.brown.edu/program/semester_program_workshop/sp-f25-w3
LOCATION:Institute for Computational and Experimental Research in Mathemati
	cs\, Brown University 
END:VEVENT
END:VCALENDAR