Urn sampling without replacement: enumerative combinatorics in R
Urn sampling without replacement: enumerative combinatorics in R
This short paper introduces a code snippet in the form of two new R functions that
enumerate possible draws from an urn without replacement; these functions call C code,
written by the author. Some simple combinatorial problems are solved using the software.
urn problems, drawing without replacement, enumerative combinatorics, Scrabble, R
6pp
Hankin, R.K.S.
296864a6-e423-44b6-ad0e-25422c913540
January 2007
Hankin, R.K.S.
296864a6-e423-44b6-ad0e-25422c913540
Hankin, R.K.S.
(2007)
Urn sampling without replacement: enumerative combinatorics in R.
Journal of Statistical Software, 17 (Code Snippet 1), .
Abstract
This short paper introduces a code snippet in the form of two new R functions that
enumerate possible draws from an urn without replacement; these functions call C code,
written by the author. Some simple combinatorial problems are solved using the software.
This record has no associated files available for download.
More information
Published date: January 2007
Keywords:
urn problems, drawing without replacement, enumerative combinatorics, Scrabble, R
Identifiers
Local EPrints ID: 44006
URI: http://eprints.soton.ac.uk/id/eprint/44006
PURE UUID: 65a58f21-4afa-4dcd-b6f5-9d77aa98b739
Catalogue record
Date deposited: 06 Feb 2007
Last modified: 11 Dec 2021 16:20
Export record
Contributors
Author:
R.K.S. Hankin
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics