Unfolding cubes: nets, packings, partitions, chords

07/27/2020
by   Kristin DeSplinter, et al.
0

We show that every ridge unfolding of an n-cube is without self-overlap, yielding a valid net. The results are obtained by developing machinery that translates cube unfolding into combinatorial frameworks. Moreover, the geometry of the bounding boxes of these cube nets are classified using integer partitions, as well as the combinatorics of path unfoldings seen through the lens of chord diagrams.

READ FULL TEXT

page 2

page 3

page 5

page 6

page 7

page 9

page 10

page 13

research
11/02/2021

Unfoldings and Nets of Regular Polytopes

Over a decade ago, it was shown that every edge unfolding of the Platoni...
research
01/20/2021

Partitions of an Integer into Powers

In this paper, we use a simple discrete dynamical model to study partiti...
research
09/08/2019

The Essence of Petri Net Gluings

Many categorical frameworks have been proposed to formalize the idea of ...
research
02/13/2018

Subtyping for Hierarchical, Reconfigurable Petri Nets

Hierarchical Petri nets allow a more abstract view and reconfigurable Pe...
research
10/21/2018

On 2-colored graphs and partitions of boxes

We prove that if the edges of a graph G can be colored blue or red in su...
research
12/23/2019

Proof nets through the lens of graph theory: a compilation of remarks

This document is intended to eventually gather a few small remarks on th...
research
06/12/2006

Simple Methods For Drawing Rational Surfaces as Four or Six Bezier Patches

In this paper, we give several simple methods for drawing a whole ration...

Please sign up or login with your details

Forgot password? Click here to reset