Coloring connections with counting mountain-valley assignments
Hull, Thomas C.
Original · EN
We survey more recent attempts at enumerating the number of mountain-valley assignments that allow a given crease pattern to locally fold flat. In particular, we solve this problem for square twist tessellations and generalize the method used to a broader family of crease patterns. We also describe the more difficult case of the Miura-ori and a recently-discovered bijection with 3-vertex colorings of grid graphs.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.