Recurrence relation for plethysm
\'Etienne T\'etreault
TL;DR
This paper presents a recurrence formula for the plethysm h_3[h_n], extending the understanding of plethysm calculations in algebraic combinatorics.
Contribution
It introduces a new recurrence relation for h_3[h_n] based on Thrall's original formula, advancing computational methods in plethysm.
Findings
Derived a recurrence formula for h_3[h_n]
Built upon Thrall's original plethysm formula
Facilitates more efficient plethysm computations
Abstract
We describe a recurrence formula for the plethysm . The proof is based on the original formula by Thrall.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Advanced Mathematical Theories and Applications · Random Matrices and Applications