2000 character limit reached
Schur Polynomials through Lindström Gessel Viennot Lemma
Published 20 Mar 2020 in math.CO | (2003.09215v2)
Abstract: In this article, we use Lindstr\"om Gessel Viennot Lemma to give a short, combinatorial, visualizable proof of the identity of Schur polynomials -- the sum of monomials of Young tableaux equals to the quotient of determinants. As a by-product, we have a proof of Vandermonde determinant without words. We also prove the cauchy identity. In the remarks, we discuss factorial Schur polynomials, dual Cauchy identity and the relation beteen Newton interpolation formula.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.