Zur Bestimmung und Trennung des Titans

Ohne Zusammenfassung     

Riffle shuffles,cycles, and descents

We derive closed form expressions and limiting formulae for a variety of functions of a permutation resulting from repeated riffle shuffles. The results allow new formulae and approximations for the number of permutations inS _n with given cycle type and number of descents. The theorems are derived from a bijection discovered by Gessel. A self-contained proof of Gessel's result is given.     

Ebullioskopie

Ohne Zusammenfassung     

The connectivity of the block-intersection graphs of designs

It is shown that the vertex connectivity of the block-intersection graph of a balanced incomplete block design,BIBD (v, k, 1), is equal to its minimum degree. A similar statement is proved for the edge connectivity of the block-intersection graph of a pairwise balanced design,PBD (v, K, 1). A partial result on the vertex connectivity of these graphs is also given. Minimal vertex and edge cuts for the corresponding graphs are characterized.Research supported in part by a B.C. Science Council G.R.E.A.T. Scholarship.Research supported in part by an NSERC Postdoctoral Fellowship.     

Nachweis und colorimetrische Bestimmungsmethoden des Molybd?ns

Ohne Zusammenfassung     

Destillation

Ohne Zusammenfassung