𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Permutations, signs and the Brownian bridge

✍ Scribed by Shlomo Levental

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
85 KB
Volume
46
Category
Article
ISSN
0167-7152

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Signed Permutation Statistics and Cycle
Signed Permutation Statistics and Cycle Type
✍ Victor Reiner πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 294 KB

We derive a multivariate generating function which counts signed permutations by their cycle type and two other descent statistics, analogous to a result of Gessel and Reutenauer [4,5] for (unsigned) permutations. The derivation uses a bijection which is the hyperoctahedral analogue of Gessel's neck

On the tractability of the Brownian Brid
On the tractability of the Brownian Bridge algorithm
✍ G. Larcher; G. Leobacher; K. Scheicher πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 266 KB

Recent results in the theory of quasi-Monte Carlo methods have shown that the weighted Koksma-Hlawka inequality gives better estimates for the error of quasi-Monte Carlo algorithms. We present a method for finding good weights for several classes of functions and apply it to certain algorithms using