Maximal and minimal polyiamonds

dc.contributor.author	Meyer, Robert
dc.contributor.author	Yang, Winston
dc.date.accessioned	2013-01-17T19:25:51Z
dc.date.available	2013-01-17T19:25:51Z
dc.date.issued	2002-05-30
dc.identifier.citation	00-03	en
dc.identifier.uri	http://digital.library.wisc.edu/1793/64366
dc.description.abstract	The minimum perimeter of an n-polyiamond in whichever of \|?6n\|or \|?6n\|+ 1 has the same parity as n. To prove this result, we first obtain a lower bound on the perimeter by considering maximal polyiamonds (i.e., polyiamonds with a given perimeter and a maximum number of triangles). We then show how to construct minimal polyiamonds that attain the perimeter lower bounds. The maximum number of triangles in a polyiamond with perimeter p is round (p^2/6)-?6, where ?6 is ) if p=0 (mod 6), and is 1 else.	en
dc.subject	minimal	en
dc.subject	maximal	en
dc.subject	perimeter	en
dc.subject	polyiamond	en
dc.title	Maximal and minimal polyiamonds	en
dc.type	Technical Report	en

Math Prog Technical Reports
Math Prog Technical Reports Archive for the Department of Computer Sciences at the University of Wisconsin-Madison