Return to search

Two new combinatorial problems involving dominating sets for lottery schemes

Thesis (PhD (Mathematical Sciences. Applied Mathematics))--University of Stellenbosch, 2004. / Suppose a lottery scheme consists of randomly selecting an unordered winning n-subset from a universal
set of m numbers, while a player participates in the scheme by purchasing a playing set of any number of unordered n-subsets from the same universal set prior to a winning draw, and is awarded a prize if ...

Identiferoai:union.ndltd.org:netd.ac.za/oai:union.ndltd.org:sun/oai:scholar.sun.ac.za:10019.1/1388
Date12 1900
CreatorsGrundlingh, Werner R.
ContributorsVan Vuuren, J. H., Burger, A. P., University of Stellenbosch. Faculty of Science. Dept. of Mathematical Sciences. Applied Mathematics.
PublisherStellenbosch : University of Stellenbosch
Source SetsSouth African National ETD Portal
LanguageEnglish
Detected LanguageEnglish
TypeThesis
Format2600216 bytes, application/pdf
RightsUniversity of Stellenbosch

Page generated in 0.0017 seconds