Abstract
Recursive algebraic construction of two infinite families of polynomials in n variables is proposed as a uniform method applicable to every semisimple Lie group of rank n. Its result recognizes Chebyshev polynomials of the first and second kind as the special case of the simple group of type A1. The obtained not Laurent‐type polynomials are equivalent to the partial cases of the Macdonald symmetric polynomials. Recurrence relations are shown for the Lie groups of types A1, A2, A3, C2, C3, G2, and B3 together with lowest polynomials.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Mathematics and Mathematical Sciences
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.