Quantum Gravity Via Expansion-Contraction 35.1: Permutations, Combinations, etc.



From Osher Doctorow mdoctorow@xxxxxxxxxxx

Aside from an idiotic comment by one of the loonie graffiti artists in
the last Section (perhaps he/she has returned from a prolonged
celebration of the November Election idiocy with MoveOn.Org types),
let's continue with more general aspects of permutations and
combinations in elementary and intermediate probability and
combinatorics.

The number of (unordered) combinations of n different things in groups
of size r < = n, C(n, r), is:

1) C(n, r) = n!/[(n-r)!r!] = (n-r+1)(n-r+2)...n/[(1)(2)...r]

while the number of (ordered) permutations corresponding to these is:

2) P(n, r) = n!/(n - r)! = (n-r+1)(n-r+2)...n

Thus, both C(n, r) and P(n, r) increase with n for fixed r, and if we
want to count them all with r ranging from 1 to n, the grand total
increases with n in a similar if partitioned way.

So we see that it is correct to regard n! as the fundamental measure of
Causal Knowledge for fixed r or for r = n, and that even the
modifications for r not equal n are in the same direction. Since the
length of an arbitrary Causal chain is better represented by general r
for 1 < = r < = n than by n, this is a useful fact, where n is the
number of different symbols.

How do combinations (unordered) occur instead of permutations in this
scenario? Where the Causal order is "interchangeable", as for example
ab and ba if both a Causes b and b Causes a.

The structure considered here has to be supplemented with Probabilities
to use the detailed machinery of Probable Influence/Causation (PI), but
the Foundational ideas still include the above ones.

Osher Doctorow

.



Relevant Pages

  • Quantum Gravity 320.4: "Exponential-Permutation-Combination Information"
    ... For more on how critical permutations and combinations are in physics ... The binomial probability distribution, b. ... The Fourier Transform, ...
    (sci.physics)
  • Re: Securing ARC4
    ... Is this applied before the normal RC4 ... Crypto primitives are hard to evaluate. ... permutations are more probable than others under your procedure. ... half the permutations have probability 4/27 and half ...
    (sci.crypt)
  • Re: Non-Scalar Cryptography - The Emporor is stark naked.
    ... Analysing the key probability as you have done will not affect the ... uncertainty of the ciphertext => the ciphertext still has equal ... the scrambling key is an absurdly small 16 bits; ... number of permutations reasonably quickly. ...
    (sci.crypt)
  • Re: Imperfect random permutation of 2^k elements
    ... > Benjamin Goldberg posted a shuffling algorithm that uses random bit ... the C code given doesn't generate all permutations with equal probability. ... so perhaps those optimizations broke something? ...
    (sci.crypt)