Tiling - Revision history

Danf: illustration

2015-01-03T02:38:39Z

illustration

← Older revision		Revision as of 19:38, 2 January 2015
Line 11:		Line 11:
	no one has proved that any infinite Penrose tiling is three-colorable.</pre>		no one has proved that any infinite Penrose tiling is three-colorable.</pre>

	''2002''		''2002'' -<
	* [http://www.ual.es/~jcaceres/ptbpcb3c.ps Penrose Tilings by Pentacles can be 3-Colored]		* [http://www.ual.es/~jcaceres/ptbpcb3c.ps Penrose Tilings by Pentacles can be 3-Colored]
	<pre>by J. Caceres, M.E. Gegundez, A. Marquez , 2002		<pre>by J. Caceres, M.E. Gegundez, A. Marquez , 2002
Line 32:		Line 32:
	* If the value of a cell does not equal the value of any bordering		* If the value of a cell does not equal the value of any bordering
	cell, the cell does not change value</pre>		cell, the cell does not change value</pre>

			[[Image:Penrose_life.gif]]

	''Conway's game of life on Penrose tiles''		''Conway's game of life on Penrose tiles''

Danf: conway's game of life on penrose tiling

2015-01-03T01:10:46Z

conway's game of life on penrose tiling

@@ Line 1: / Line 1: @@
 (some notes for collaborative study)
-[https://noisebridge.net/images/c/c2/Gardner_PenroseTilings1-1977.pdf 2 chapters from Martin Gardner's book "Penrose Tiles to Trapdoor Ciphers"]
+* http://preshing.com/20110831/penrose-tiling-explained/
-''is this still unproven?'' -> <pre>
+''1977'' -> <pre>
 A Penrose tiling can, of course, always be colored with four colors so
 that no two tiles of the same color share a common edge.  Can it always be
@@ Line 9: / Line 10: @@
 theorem, that if any Penrose tiling is three-colorable, all are, but so far
 no one has proved that any infinite Penrose tiling is three-colorable.</pre>
 [[Category:Math]]

Danf: add link to some python code

2015-01-02T22:55:44Z

add link to some python code

← Older revision		Revision as of 15:55, 2 January 2015
Line 2:		Line 2:

	[https://noisebridge.net/images/c/c2/Gardner_PenroseTilings1-1977.pdf 2 chapters from Martin Gardner's book "Penrose Tiles to Trapdoor Ciphers"]		[https://noisebridge.net/images/c/c2/Gardner_PenroseTilings1-1977.pdf 2 chapters from Martin Gardner's book "Penrose Tiles to Trapdoor Ciphers"]


	''is this still unproven?'' -> <pre>		''is this still unproven?'' -> <pre>
Line 12:		Line 11:


			http://preshing.com/20110831/penrose-tiling-explained/
	[[Category:Math]]		[[Category:Math]]

Danf: is any infinite Penrose tiling three-colorable?

2015-01-02T22:42:44Z

is any infinite Penrose tiling three-colorable?

← Older revision		Revision as of 15:42, 2 January 2015
Line 1:		Line 1:
	(some notes for collaborative study)		(some notes for collaborative study)

	[https://noisebridge.net/images/c/c2/Gardner_PenroseTilings1-1977.pdf ~~chapter 7~~ from Martin Gardner's book "Penrose Tiles to Trapdoor Ciphers"]		[https://noisebridge.net/images/c/c2/Gardner_PenroseTilings1-1977.pdf 2 chapters from Martin Gardner's book "Penrose Tiles to Trapdoor Ciphers"]


			''is this still unproven?'' -> <pre>
			A Penrose tiling can, of course, always be colored with four colors so
			that no two tiles of the same color share a common edge. Can it always be
			colored with three? It can be shown, Conway said, from the local isomorphism
			theorem, that if any Penrose tiling is three-colorable, all are, but so far
			no one has proved that any infinite Penrose tiling is three-colorable.</pre>


	[[Category:Math]]		[[Category:Math]]

Danf: notes

2015-01-02T22:12:14Z

notes

New page

(some notes for collaborative study)

[https://noisebridge.net/images/c/c2/Gardner_PenroseTilings1-1977.pdf chapter 7 from Martin Gardner's book "Penrose Tiles to Trapdoor Ciphers"]

[[Category:Math]]