I am not a Mathematician, and I've been pondering this idea for years. I will try to describe it intelligibly.(adsbygoogle = window.adsbygoogle || []).push({});

Imagine a Ring. It has three "Inputs" and three "Outputs".

Any of the three "Outputs" takes you to a different Ring with threeEntrancesand threeExits.

You cannot return to the original Ring in less than three moves. Nor do any second or third level Rings connect directly to any common Rings, nor does any Ring have both aDirect EntranceandExitto the same Ring.....

What is the minimum number of interconnecting Rings I will need, to make the system "Circular" and "Homogenous" in the sense that it always leads inevitably back to the starting point, if one avoids entering any other Ring more than once?

Is there a Maxim number of Rings that can be connected in this way?

I assume that the structure would beSymmetric, in that any Ring that I choose arbitrarily to start from, would inevitably take me Back to the starting Ring in the same number of non-retracing steps.

This thing grows to the Point of being a. Are there are Equations to "Wooly-Bear Worm to VisualizeFlatten it out"--that is, give results without needing to clearly visualize it?

Believe it or not, I'm trying to create an an, using the Interlocking Circles in Place of a "Abstract Three Value Symbolic Logic SystemT" "F".Truth Table

Just for .....

Well, for no good reason that I can think of.....

Thanx.

.....RVM45

**Physics Forums | Science Articles, Homework Help, Discussion**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# A Question about Topological Connectivity

**Physics Forums | Science Articles, Homework Help, Discussion**