2000 character limit reached
Domino shuffling on Novak half-hexagons and Aztec half-diamonds
Published 25 Mar 2011 in math.CO | (1103.5054v1)
Abstract: We explore the connections between the well-studied Aztec Diamond graphs and a new family of graphs called the Half-Hexagons, discovered by Jonathan Novak. In particular, both families of graphs have very simple domino shuffling algorithms, which turn out to be intimately related. This connection allows us to prove an "arctic parabola" theorem for the Half-Hexagons as a corollary of the Arctic Circle theorem for the Aztec Diamond.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.