Existence of TP(d,k,n)
| Metadata Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | Hoffman, Dean | |
| dc.contributor.author | Aliyev, Natig | |
| dc.date.accessioned | 2019-04-24T13:13:24Z | |
| dc.date.available | 2019-04-24T13:13:24Z | |
| dc.date.issued | 2019-04-24 | |
| dc.identifier.uri | http://hdl.handle.net/10415/6695 | |
| dc.description.abstract | Given a square grid of land, which has n rows and n columns. It is required to plant trees on the land so that there are k trees in every row and column and there is at most 1 tree in any small square part of the land with d rows and d columns. What should be the values of n, k and d? How to plant the trees? The objective of this dissertation is to analyze the problem and come up with the answers to the questions proposed above. The dissertation consists of two main parts. The first part provides necessary and sufficient conditions regarding the values of n, k and d. The second part of the dissertation delivers the method to plant the trees on the land under given constraints. | en_US |
| dc.subject | Mathematics and Statistics | en_US |
| dc.title | Existence of TP(d,k,n) | en_US |
| dc.type | PhD Dissertation | en_US |
| dc.embargo.status | NOT_EMBARGOED | en_US |