Abstract
If ( lambda )=( lambda 1, lambda 2,..., lambda N) is a partition of n it is proved that the maximum number of Gel'fand patterns of ( lambda ) corresponding to any weight is equal to f( lambda ), where f( lambda ) is the number of standard Young tableaux corresponding to the partition.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
