Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. DHD-puzzles
Conference paper

DHD-puzzles

Sabine Beil (1)
(1) Fakultät für Mathematik [Wien]
Download article
Open on HAL
Imported on
July 4, 2016
Published on
April 22, 2020
Last modified on
March 31, 2025
Volume
DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016)
DOI
10.46298/dmtcs.6332
License
https://about.hal.science/hal-authorisation-v1
Indicators
559
Views
630
Downloads

DHD-puzzles

Sabine Beil (1)
(1) Fakultät für Mathematik [Wien]
Abstract
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.
Keywords
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
Preview
Loading PDF preview...