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 numb...
Main Author: | |
---|---|
Other Authors: | |
Format: | Others |
Language: | en |
Published: |
Stellenbosch : University of Stellenbosch
2006
|
Subjects: | |
Online Access: | http://hdl.handle.net/10019.1/1388 |
id |
ndltd-netd.ac.za-oai-union.ndltd.org-sun-oai-scholar.sun.ac.za-10019.1-1388 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-netd.ac.za-oai-union.ndltd.org-sun-oai-scholar.sun.ac.za-10019.1-13882016-01-29T04:02:22Z Two new combinatorial problems involving dominating sets for lottery schemes Grundlingh, Werner R. Van Vuuren, J. H. Burger, A. P. University of Stellenbosch. Faculty of Science. Dept. of Mathematical Sciences. Applied Mathematics. Combinatorial optimization Games of chance (Mathematics) Lotteries -- Mathematics Domination (Graph theory) Dissertations -- Applied mathematics Theses -- Applied mathematics 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 ... 2006-11-17T09:33:22Z 2010-06-01T08:20:26Z 2006-11-17T09:33:22Z 2010-06-01T08:20:26Z 2004-12 Thesis http://hdl.handle.net/10019.1/1388 en University of Stellenbosch 2600216 bytes application/pdf Stellenbosch : University of Stellenbosch |
collection |
NDLTD |
language |
en |
format |
Others
|
sources |
NDLTD |
topic |
Combinatorial optimization Games of chance (Mathematics) Lotteries -- Mathematics Domination (Graph theory) Dissertations -- Applied mathematics Theses -- Applied mathematics |
spellingShingle |
Combinatorial optimization Games of chance (Mathematics) Lotteries -- Mathematics Domination (Graph theory) Dissertations -- Applied mathematics Theses -- Applied mathematics Grundlingh, Werner R. Two new combinatorial problems involving dominating sets for lottery schemes |
description |
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 ... |
author2 |
Van Vuuren, J. H. |
author_facet |
Van Vuuren, J. H. Grundlingh, Werner R. |
author |
Grundlingh, Werner R. |
author_sort |
Grundlingh, Werner R. |
title |
Two new combinatorial problems involving dominating sets for lottery schemes |
title_short |
Two new combinatorial problems involving dominating sets for lottery schemes |
title_full |
Two new combinatorial problems involving dominating sets for lottery schemes |
title_fullStr |
Two new combinatorial problems involving dominating sets for lottery schemes |
title_full_unstemmed |
Two new combinatorial problems involving dominating sets for lottery schemes |
title_sort |
two new combinatorial problems involving dominating sets for lottery schemes |
publisher |
Stellenbosch : University of Stellenbosch |
publishDate |
2006 |
url |
http://hdl.handle.net/10019.1/1388 |
work_keys_str_mv |
AT grundlinghwernerr twonewcombinatorialproblemsinvolvingdominatingsetsforlotteryschemes |
_version_ |
1718162799200305152 |