Hello,
I found Steven Wolfram’s lectures in the past days extremely stimulating so I decided to play with SetReplace. Constructing 1D lines or circle boundaries is trivial. So I decided to construct flat 2d space using a replacement rule.
Here are some of my results:
Attach triangles to free sides starting with a triangle
The failure to keep itself in the plain is explained by the second image. We notice a failure to form hexagons because nodes generated by recursively can’t be unified. 60, 180 and 300 degrees we see not unified nodes while those at 0, 120, 240 from the previous generation have already created new triangles which forces a hyperbolic embedding. The inability to join vertices also implies that all connections between nodes on different leaves must connect trough the initial nodes.
WolframModelPlot[
SetReplace[
{{1, 2, 3, 1},
{1, 2}, {2, 1}, {2, 3}, {3,2}, {3, 1}, {1, 3}},
{{v1_, v2_}, {v2_, v1_}} :>
Module[{v5},
{{v1, v5, v2, v1},
{v1,v5}, {v5,v1}, {v5,v2}, {v2,v5}}],n]]
The choice of N is given by A068156 (1, 3, 9, 21, 45, 93, 189, 381, 765, 1533, 3069, 6141) if that wasn’t obvious.
Subdividing a square to generate a grid
The insight here is that we can use hyper edges as meta data to remember what areas we still need to expand. Note that after sub-dividing a hyper-edge we remove it.
Here we notice a similar inability to join nodes which leads. The leave connecting nodes here are the ones which were generated in the first step. Even though this rules does not add extra area (See extra triangles in above example) it adds new lines and new points. This is enough to make it fit better into a hyperbolic space.
a = SetReplace[{{1, 2, 3, 4, 1 },{1,2},{2,3},{3,4},{4,1}},
{{v1_, v2_, v3_, v4_, v1_},{v1_, v2_},{v2_, v3_},{v3_, v4_},{v4_, v1_}} :>
Module[{v12,v23,v34,v41,vm},
{{v1,v12,vm,v41,v1}, {v1,v12}, {v12,vm}, {vm,v41}, {v41,v1},
{vm,v23,v3,v34,vm}, {vm,v23}, {v23,v3}, {v3,v34}, {v34,vm},
{v12,v2,v23,vm,v12}, {v12,v2}, {v2,v23}, {v23,vm}, {vm,v12},
{v41,vm,v34,v4,v41}, {v41,vm}, {vm,v34}, {v34,v4}, {v4,v41} }],1+4+16+4*16+16*16+4*16*16];
WolframModelPlot[a]
I also played with some other ideas to get a flat 2d space
The last one turned out be the most interesting. While there is still overlap of edges and nodes (orange) It at least has the chance of producing a paper with cuts in it:
I think I might have some idea how to unify those dangly bits too (using hyper edges as meta data but hyper edges totally curve space, so it would be very “unnatural”, although you might be able to create pure grid by having it grow to both sides/all 4 sides).
Anyway this approach has another interesting problem. The light green and light yellow area are the same. And while each dangly bit will eventually grow to a given length and thereby eventually creating and m by m grid the necessary steps required are very much asymptotically larger than O(n^2).
If I would be allowed to perform arbitrary calculation inside the thing that returns the new hyper graph additions or be able to decide based on state-full code whether to apply a rule I could produce graphs which grow like this:
A word of caution about projecting a graph down to a finite sequence of natural numbers
If I pose additional restriction I might be even able to grow graphs like this:
If I start to color the neighborhoods of nodes from the upper left corner, the central element in the upper row and the “central” node I get these growth patterns:
We see that blue and green grow just as they would on a fully connected graph. This is not the case for red. This issues raises questions about calculating the dimensionality by neighborhoods, especially in the infinite case or in the “not enough computation power cases”.
Here is an tabulation of the number of effected nodes:
We see the if the length of the square is sufficiently large we might very well think that this graph is linear for almost all values (N^2-(E+2)N) where E is the number of evaluations and convinced that it is a square a fully connected sheet in 2N of the cases.
Edit: Changed Title to what I intended originally.
