Maximal and minimal polyexes
| dc.contributor.author | Yang, Winston | |
| dc.date.accessioned | 2013-01-17T19:32:46Z | |
| dc.date.available | 2013-01-17T19:32:46Z | |
| dc.date.issued | 2002-06-17 | |
| dc.description.abstract | The minimum perimeter of a polyhex with n hexagons is 2|?(12n-3)|. To prove this result, we first obtain a lower bound on the perimeter by considering maximal polyhexes (i.e., polyhexes with a given perimeter and a maximum number of hexagons). We then show how to construct minimal polyhexes that attain the perimeter lower bounds. A polyhex has even perimeter. If p is even, then the maximum number of hexagons in a polyhex with perimeter p is round (p^2/48). | en |
| dc.identifier.citation | 02-04 | en |
| dc.identifier.uri | http://digital.library.wisc.edu/1793/64368 | |
| dc.subject | perimeter | en |
| dc.subject | polyhexes | en |
| dc.title | Maximal and minimal polyexes | en |
| dc.type | Technical Report | en |