some of the outstanding and still classical problems in algebraic combinatorics concern understanding the kronecker coefficients of the symmetric group, the multiplicities describing the decomposition of tensor products of representations into irreducibles, which are nonnegative integers lacking a positive combinatorial formula for over 75 years. recently they appeared in geometric complexity theory (gct), a program aimed to distinguish computational complexity classes (like the p vs np problem) and prove complexity theoretic bounds using algebraic geometry and representation theory. on the combinatorial side, we \lbrack{pak-p}\rbrack will show various bounds on kronecker coefficients via character evaluations and partition enumeration, and use them to extend sylvester and stanley's theorem on the unimodality of partitions inside a rectangle and find asymptotic bounds. on the gct side, using algebraic and combinatorial methods, we \lbrack{burgisser-ikenmeyer-p, ikenmeyer-p}\rbrack show that the relevant kronecker and plethysm coefficients of the general linear group are positive, thereby disproving a mulmuley and sohoni conjecture on the existence of ``occurrence obstructions" and practically showing that the 'p vs np' problem is even more difficult. in the reverse direction, gct arguments show that rectangular kronecker coefficients are larger than plethysm coefficient in a stable range \lbrack{ikenmyer-p}\rbrack, establishing a connection between apriori unrelated and greatly mysterious multiplicities.