Rhombus Tilings of a Hexagon with Three Fixed Border Tiles
| dc.creator | Eisenkölbl, Theresia | |
| dc.date | 1997-12-22 | |
| dc.date | 1998-09-08 | |
| dc.date.accessioned | 2026-07-07T05:23:26Z | |
| dc.date.available | 2026-07-07T05:23:26Z | |
| dc.description | We compute the number of rhombus tilings of a hexagon with sides $a+2,b+2,c+2,a+2,b+2,c+2$ with three fixed tiles touching the border. The particular case $a=b=c$ solves a problem posed by Propp. Our result can also be viewed as the enumeration of plane partitions having $a+2$ rows and $b+2$ columns, with largest entry $\le c+2$, with a given number of entries $c+2$ in the first row, a given number of entries 0 in the last column and a given bottom-left entry. | |
| dc.description | 7 pages, AmS-LaTeX, uses TeXDraw; revised version which is to appear in J. Combin. Theory Ser. A | |
| dc.identifier | https://arxiv.org/abs/math/9712261 | |
| dc.identifier | http://arxiv.org/abs/math/9712261 | |
| dc.identifier | J. Combin. Theory Ser. A 88 (1999), 368-378 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/76434 | |
| dc.subject | Combinatorics | |
| dc.subject | 05A15 05B45 52C20 | |
| dc.title | Rhombus Tilings of a Hexagon with Three Fixed Border Tiles | |
| dc.type | text |