Euler's partition theorem and the combinatorics of -sequences

Euler's partition theorem and the combinatorics of -sequences Euler's partition theorem and the combinatorics of -sequences

01.06.2015 Views

A coin-flipping interpretation of the l-nomial For real r, let C r (l) be a weighted coin for which the probability of tails is ul r /∆(l) r and the probability of heads is vl r /∆(l) r . The probability of getting exactly k heads when tossing the n coins C (l) −(n−1)/2 , C (l) 1−(n−1)/2 , C (l) 2−(n−1)/2 , . . . , C (l) (n−1)/2 : ( n k) (l) ∆ (l) −(n−1)/2 ∆(l) 1−(n−1)/2 · · · ∆(l) (n−1)/2−1 ∆(l) (n−1)/2 ∆ (l) j/2 may not be an integer, but ∆(l) −j/2 ∆(l) j/2 = ∆(l) j + 2 is.

Figure: The 8 possible results of tossing the weighted coins C (l) −1 , C (l) 0 , C (l) 1 . Heads (pink) are indicated with their “v” weight and tails (blue) with their “u” weight. The weight of each toss is shown.

Figure: The 8 possible results <strong>of</strong> tossing <strong>the</strong> weighted coins<br />

C (l)<br />

−1 , C (l)<br />

0 , C (l)<br />

1 . Heads (pink) are indicated with <strong>the</strong>ir “v” weight <strong>and</strong><br />

tails (blue) with <strong>the</strong>ir “u” weight. The weight <strong>of</strong> each toss is shown.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!