𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A worm algorithm for random spatial permutations

✍ Scribed by John Kerl

Publisher
Elsevier
Year
2010
Tongue
English
Weight
366 KB
Volume
4
Category
Article
ISSN
1875-3892

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A Random Base Change Algorithm for Permu
A Random Base Change Algorithm for Permutation Groups
✍ Gene Cooperman; Larry Finkelstein πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 549 KB

A new random base change algorithm is presented for a permutation group \(G\) acting on \(n\) points whose worst case asymptotic running time is better for groups with a small to moderate size base than any known deterministic algorithm. To achieve this time bound, the algorithm requires a random ge

Random selection algorithms for spatial
Random selection algorithms for spatial and temporal sampling
✍ John A. Byers πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 961 KB

Seven BASIC programs are presented that use algorithms for selection of treatments and samples in spatial and temporal contexts. Program (1) takes a natural sequence of samples (such as logs cut from a tree trunk) and divides them into groups (equal to the number of samples divided by treatments), a

A loopless algorithm for generating the
A loopless algorithm for generating the permutations of a multiset
✍ Vincent Vajnovszki πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 372 KB

Many combinatorial structures can be constructed from simpler components. For example, a permutation can be constructed from cycles, or a Motzkin word from a Dyck word and a combination. In this paper we present a constructor for combinatorial structures, called shu e on trajectories (deΓΏned previou