Combinatorial hierarchy

From Wikipedia, the free encyclopedia

This article is orphaned as few or no other articles link to it. Please help introduce links in articles on related topics. (May 2008)

Combinatorial Hierarchy is a mathematical structure of bit-strings generated by an algorithm based on discrimination (exclusive-or between bits). It was originally discovered by A.F. Parker-Rhodes in the 1960s, and is interesting because of physical interpretations that relate it to Quantum Theory.^[1] For example, values close to the fine structure constant and the proton-mass gravitational coupling constant appear in the generation of the Hierarchy.^[1] Combinatorial Physics explores such relationships between the mathematical hierarchy and the physical world.

[edit] References

1. ^ ^{a b} Bastin, Ted and Kilmister, C.W. Combinatorial Physics. World Scientific, 1995, ISBN 981-02-2212-2

• A formal development of the combinatorial hierarchy in terms of group theory appears in the appendix to "On the physical interpretation and the mathematical structure of the combinatorial hierarchy," Int. Journ. Theor. Phys. 18, 7 (1979) 445.
• Theory of Indistinguishables, A.F. Parker-Rhodes, Reidel, 1981.
• Journal of the Western Regional Chapter of the Alternative Natural Philosophy Association

This article is uncategorized. Please categorize this article to list it with similar articles. (May 2008)