Combinatorics and Graph Theory


Combinatorial Process and Pascal's Triangle Or Mount Meru

Authors: John Frederick Sweeney

In Vedic Physics, the combinatorial process by which counts are counted closely resembles the binomial triangle, or Pascal's Triangle, which was known to Ancient India and China as Mount Meru or Zhang's triangle. This is not accidental, but instead reflects the numerical structure of the universe, as the pattern repeats itself in many types of numbers, including Clifford Algebras, Octonions, the Exceptional Lie Algebras, the Magic Triangle, and Barnes - Wall Lattices. Previous papers have discussed details of the counts; this paper focuses on the triangular relationships between numbers, especially those noted by Tony "Frank" Smith.

Comments: 20 Pages.

Download: PDF

Submission history

[v1] 2013-07-11 11:56:55

Unique-IP document downloads: 120 times

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus