Coloring connections with counting mountain-valley assignments
classification
🧮 math.CO
cs.CG
keywords
assignmentscreasemountain-valleyallowattemptsbijectionbroadercase
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.