dmtcs:6332 -
Discrete Mathematics & Theoretical Computer Science,
April 22, 2020,
DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016)
-
https://doi.org/10.46298/dmtcs.6332
DHD-puzzlesArticle
Authors: Sabine Beil 1
NULL
Sabine Beil
1 Fakultät für Mathematik [Wien]
In this work triangular puzzles that are composed of unit triangles with labelled edges are considered. To be more precise, the labelled unit triangles that we allow are on the one hand the puzzle pieces that compute Schubert calculus and on the other hand the flipped K-theory puzzle piece. The motivation for studying such puzzles comes from the fact that they correspond to a class of oriented triangular fully packed loop configurations. The main result that is presented is an expression for the number of these puzzles with a fixed boundary in terms of Littlewood- Richardson coefficients.