首页 | 本学科首页   官方微博 | 高级检索  
     检索      


A shuffling theorem for reflectively symmetric tilings
Authors:Tri Lai
Abstract:The author and Rohatgi recently proved a ‘shuffling theorem’ for doubly-dented hexagons. In particular, they showed that shuffling removed unit triangles along a horizontal axis in a hexagon changes the tiling number by only a simple multiplicative factor. In this paper, we consider a similar phenomenon for a symmetry class of tilings, namely, the reflectively symmetric tilings. We also prove several shuffling theorems for halved hexagons.
Keywords:Perfect matchings  Plane partitions  Dual graph  Lozenge tilings  Graphical condensation  Symplectic characters
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号