• About
  • Members
  • Seminar
  • Visitors
  • Publications
  • Conferences
  • Magma
  • Login
Computational Algebra Group
Computational Algebra Seminar
  • 2000-2004
  • 2005-2009
  • 2010-2014
  • 2015
  • 2016
  • 2017
  • 2018
  • 2024
  • 2025
  • Axel Kohnert
  • (Bayreuth)
  • An algorithm for the computation of the plethysm of two symmetric functions
  • 3pm–4pm, Wednesday 9th January, 2002
  • Carlaw 535
  • Let hn the homogenous symmetric function of degree n. You can look at it as the generating function of weakly increasing sequences of integers of length n. Let mI be the monomial symmetric function. You can look at it as the generating function of weakly increasing sequeces, whose weight is a permutation of I. We will give an algorithm to compute the decomposition of the plethysm Sn[mI] as a sum of monomial symmetric functions.

The Computational Algebra Group is a research group within the School of Mathematics and Statistics, University of Sydney.
Copyright © 2010-2025 Computational Algebra Group.