Ku, Cheng Yeaw and Wong, Kok Bin (2018) On No-Three-In-Line Problem on m-Dimensional Torus. Graphs and Combinatorics, 34 (2). pp. 355-364. ISSN 0911-0119, DOI https://doi.org/10.1007/s00373-018-1878-8.
Full text not available from this repository.Abstract
Let Z be the set of integers and Zl be the set of integers modulo l. A set L⊆T=Zl1×Zl2Zlm is called a line if there exist a, b∈ T such that L={a+tb∈T:t∈Z}. A set X⊆ T is called a no-three-in-line set if | X∩ L| ≤ 2 for all the lines L in T. The maximum size of a no-three-in-line set is denoted by τ(T). Let m≥ 2 and k1, k2, … , km be positive integers such that gcd (ki, kj) = 1 for all i, j with i≠ j. In this paper, we will show that (Formula presented.).We will give sufficient conditions for which the equality holds. When k1= k2= ⋯ = km= 1 and n= pl where p is a prime and l≥ 1 is an integer, we will show that equality holds if and only if p= 2 and l= 1 , i.e., τ(Zpl×Zpl×⋯×Zpl) = 2pl(m-1) if and only if p= 2 and l= 1.
| Item Type: | Article |
|---|---|
| Funders: | UNSPECIFIED |
| Uncontrolled Keywords: | Chinese remainder theorem; Discrete torus; No-three-in-line problem |
| Subjects: | Q Science > Q Science (General) Q Science > QA Mathematics |
| Divisions: | Faculty of Science > Institute of Mathematical Sciences |
| Depositing User: | Ms. Juhaida Abd Rahim |
| Date Deposited: | 04 Jul 2019 08:58 |
| Last Modified: | 04 Jul 2019 08:58 |
| URI: | http://eprints.um.edu.my/id/eprint/21579 |
Actions (login required)
 |
View Item |
