Full Text Available
Note: Clicking the button above will open the full text document at the original institutional repository in a new window.
Thesis (PhD (Mathematical Sciences. Applied Mathematics))--University of Stellenbosch, 2004.
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | English |
| Published: |
Stellenbosch : University of Stellenbosch
2006
|
| Subjects: | |
| Tags: |
No Tags, Be the first to tag this record!
|
| _version_ | 1867613991413481472 |
|---|---|
| access_status_str | Open Access |
| author | Grundlingh, Werner R. |
| author2 | Van Vuuren, J. H. |
| author_browse | Grundlingh, Werner R. Van Vuuren, J. H. |
| author_facet | Van Vuuren, J. H. Grundlingh, Werner R. |
| author_sort | Grundlingh, Werner R. |
| collection | Thesis |
| dc_rights_str_mv | University of Stellenbosch |
| description | Thesis (PhD (Mathematical Sciences. Applied Mathematics))--University of Stellenbosch, 2004. |
| format | Thesis |
| id | oai:scholar.sun.ac.za:10019.1/1388 |
| institution | Stellenbosch University (South Africa) |
| language | English |
| last_indexed | 2026-06-10T12:44:55.985Z |
| license_str | Other — see source repository |
| provenance_str_mv | Harvested via OAI-PMH from SUNScholar — Stellenbosch University Repository |
| publishDate | 2006 |
| publishDateRange | 2006 |
| publishDateSort | 2006 |
| publisher | Stellenbosch : University of Stellenbosch |
| publisherStr | Stellenbosch : University of Stellenbosch |
| record_format | dspace |
| source_str | SUNScholar — Stellenbosch University Repository |
| spelling | oai:scholar.sun.ac.za:10019.1/1388 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 ... Doctoral 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 application/pdf Stellenbosch : University of Stellenbosch |
| 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 |
| title | 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_short | Two new combinatorial problems involving dominating sets for lottery schemes |
| title_sort | two new combinatorial problems involving dominating sets for lottery schemes |
| topic | Combinatorial optimization Games of chance (Mathematics) Lotteries -- Mathematics Domination (Graph theory) Dissertations -- Applied mathematics Theses -- Applied mathematics |
| url | http://hdl.handle.net/10019.1/1388 |
| work_keys_str_mv | AT grundlinghwernerr twonewcombinatorialproblemsinvolvingdominatingsetsforlotteryschemes |