Abstract: Certain computable polynomials are described whose leading coefficients are equal to multiplicities in the tensor product decomposition for representations of a Lie algebra of ADE type.
Abstract: We present here an algorithm for factoring a given polynomial over GF(q) into powers of irreducible polynomials. The method reduces the factorization of a polynomial of degree m over GF(q) ...
teaching Calculus I at Columbia mentoring a student on enumerative combinatorics and cyclotomic polynomials for the Directed Reading Program giving some talks on multiple Dirichlet series (at the ...