Interactive tool for computing Schur-type polynomials by enumerating Gelfand-Tsetlin patterns. Fix a partition lambda at level k and enumerate all valid interlacing sequences of partitions from the empty partition up to lambda, alternating vertical and horizontal strips. The weighted sum over configurations gives a polynomial in variables x_i and y_i.
(parts ≤ k)
code
(note: parameters in the code might differ from the ones in simulation results below)-
Link to code(Pure JavaScript GT pattern enumeration for Schur polynomials)