Beta version of rules for my notation (Linear Arrays only) (#is an array, + is a symbol (It's addition in rules 16/17), X is the value of an array)
- The "Alpha" or "a" is the first entry in an array.
- The "Beta" or "b" is the second entry in an array.
- The "Hybrid" or "h" is the last entry in an array.
- If h=1, then the h is cropped off.
- If a=1, then X=1
- If b=1, then X = a
- If any entires that are NOT a, b, or h is 1; Crop of the 1, and replace all other entries with a.
- If there are multiples 1's in an array; Replace all of the 1's with a's.
- If a=0, then X=0
- If b=0, than X=0
- If h =0; Crop the h off.
- If any entires that are NOT a, b, or h is 0; Crop the 0 off the array.
- If there are multiple 0's om an array, all the 0's are cropped off.
- The rules for 0's and 1's does NOT apply to centain higher level symbols (The "Higher Level Symbols" here are WIP)
- {a,h} = a inside a h-gon using Steinhaus-Moser Notation.
- {a,b,h} = {a+1,{a+1,b-1,h},h-1}
- {a,b,#,h} = {a+1,{a+1,b-1,#,h},#,h-1}
- {a[h]} = {h,h,h,.....} with a h's
- If there are only 2 entires, the b does not exist.
- The "Decomposing" rules (&Rules 16/17) only exist if; a>2 in {a[h]}
- End.
Also I think that TREE(3) deserves a seperate page