A Combinatorial Proof of a Weyl Type Formula for Hook Schur Polynomials

Journal of Algebraic Combinatorics - Netherlands
doi 10.1007/s10801-007-0109-9
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

A Bijective Proof of the Hook-Length Formula

Journal of Algorithms
1982English

A Summation Formula for Macdonald Polynomials

Letters in Mathematical Physics
Nonlinear PhysicsMathematical PhysicsStatistical
2016English

A Combinatorial Formula for the Pontrjagin Classes

Bulletin of the American Mathematical Society
MathematicsApplied Mathematics
1992English

A Nekrasov–Okounkov Formula for Macdonald Polynomials

Journal of Algebraic Combinatorics
CombinatoricsDiscrete MathematicsNumber TheoryAlgebra
2017English

A Formula for N-Row Macdonald Polynomials

Journal of Algebraic Combinatorics
CombinatoricsDiscrete MathematicsNumber TheoryAlgebra
2005English

A Short Proof of a Generating Function for Jacobi Polynomials

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1980English

A New Proof of Bernstein’s Inequality for Legendre Polynomials

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1975English

On Semiring Complexity of Schur Polynomials

Computational Complexity
MathematicsComputational MathematicsTheoretical Computer ScienceComputational Theory
2018English

A Proof of the Nakaoka-Toda Formula

Pacific Journal of Mathematics
Mathematics
1964English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy