Please login to be able to save your searches and receive alerts for new content matching your search criteria.
This work lies across three areas of investigation that are by themselves of independent interest. A problem that arose in quantum computing led us to a link that tied these areas together. This link led to the calculation of some Kronecker coefficients by computing constant terms and conversely the computations of certain constant terms by computing Kronecker coefficients by symmetric function methods. This led to results as well as methods for solving numerical problems in each of these separate areas.
We provide elementary proof of several congruences involving single sum and multisums of binomial coefficients.