✦ LIBER ✦

Generating random combinatorial objects

✍ Scribed by V.G Kulkarni

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 971 KB
Volume: 11
Category: Article
ISSN: 0196-6774
DOI: 10.1016/0196-6774(90)90002-v

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Handbook of Applied Algorithms || Genera

Handbook of Applied Algorithms || Generating All and Random Instances of a Combinatorial Object

✍ Nayak, Amiya; Stojmenovi, Ivan 📂 Article 📅 2008 🏛 John Wiley & Sons, Inc. 🌐 English ⚖ 330 KB

discover The Benefits Of Applying Algorithms To Solve Scientific, Engineering, And Practical Problems Providing A Combination Of Theory, Algorithms, And Simulations, Handbook Of Applied Algorithms Presents An All-encompassing Treatment Of Applying Algorithms And Discrete Mathematics To Practi

Object oriented random number generators

✍ Joseph A. Fisher 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 269 KB

Random number generation: A combinatoria

Random number generation: A combinatorial approach

✍ Pablo M Salzberg 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 524 KB

Given a sample with replacement from a finite set ~, we show simply how to generate a maximal sequence of functions of the sample, all uniform on ~/, such that these functions are pairwise independent. We also consider the problem of generating a sequence of k-wise independent functions of the sampl

A General Random Combinatorial Model of

A General Random Combinatorial Model of Botanical Trees

✍ Paul Kruszewski; Sue Whitesides 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 406 KB

We present a new mathematical model of botanical trees capable of simulating the combinatorial structure of specific species based on their bifurcation ratios. We first describe a general combinatorial model of botanical trees for the purposes of synthetic imagery. We apply techniques from probabili

Isomorphisms of cyclic combinatorial obj

Isomorphisms of cyclic combinatorial objects

✍ Neal Brand 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 784 KB

Let u = qp' where p is a prime number and p does not divide q. Let 58 and 48' be isomorphic combinatorial objects whose vertex sets is &,, the integers module IJ, and further assume that translations in &, are automorphisms of the objects. Conditions are given which imply that S and 58' must be isom

Generating convex polyominoes at random

✍ Winfried Hochstättler; Martin Loebl; Christoph Moll 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 517 KB

We give a new recursion formula for the number of convex polyominoes with fixed perimeter. From this we derive a bijection between an interval of natural numbers and the polyominoes of given perimeter. This provides a possibility to generate such polyominoes at random in polynomial time. Our method