Counting locally flat-foldable origami configurations via 3-coloring graphs

DOI10.1007/S00373-020-02240-2MaRDI QIDQ2657083zbMATH OpenOpenAlexFDO

Authors Alvin Chiu, William Hoganson, Thomas C. Hull, Sylvia Wu

Publication date 17 March 2021

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1910.01278

Exact enumeration problems, generating functions (05A15) Coloring of graphs and hypergraphs (05C15) Enumeration in graph theory (05C30) Discrete geometry (52C99)

Abstract: Origami, where two-dimensional sheets are folded into complex structures, is proving to be rich with combinatorial and geometric structure, most of which remains to be fully understood. In this paper we consider emph{flat origami}, where the sheet of material is folded into a two-dimensional object, and consider the mountain (convex) and valley (concave) creases made by such foldings, called a emph{MV assignment} of the crease pattern. We establish a method to, given a flat-foldable crease pattern

C

under certain conditions, create a planar graph

C^{*}

whose 3-colorings are in one-to-one correspondence with the locally-valid MV assignments of

C

. This reduces the general, unsolved problem of enumerating locally-valid MV assignments to the enumeration of 3-colorings of graphs.

Recommendations

Cites work

Cited in

(5)

This page was built for publication: Counting locally flat-foldable origami configurations via 3-coloring graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2657083)