The combinatorics of plethysm

The composition of GL(n) representations is know as the plethysm of the respective representations. Understanding the structural coefficients of plethysm is a notoriously hard problem, featured in Stanley's list of important problems in algebraic combinatorics. In this talk, we explore the relevance of this problem, its connections to P vs NP, and discuss some combinatorial approaches to their study.