Near-Compatible Factorization
A compatible factorization of order v, is a v × (v−1)2 array of distinct triples in which row i form a near-one-factor with focus i. This article aims to develop compatible factorization to display v×( v−1 2 −2 3 ) triples with minimum repetition. Through this article, we propose and define a new ty...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Academic Publications, Ltd.
2018
|
| Subjects: | |
| Online Access: | https://repo.uum.edu.my/id/eprint/30782/1/IJPAM%20120%2002%20259-273.pdf |
| _version_ | 1803629979241545728 |
|---|---|
| author | Aldiabat, Raja’i Ibrahim, Haslinda |
| author_facet | Aldiabat, Raja’i Ibrahim, Haslinda |
| author_sort | Aldiabat, Raja’i |
| collection | UUM |
| description | A compatible factorization of order v, is a v × (v−1)2 array of distinct triples in which row i form a near-one-factor with focus i. This article aims to develop compatible factorization to display v×( v−1 2 −2 3 ) triples with minimum repetition. Through this article, we propose and define a new type of factorization called near-compatible factorization. First, we prove the existence of near-compatible factorization. Then, the construction will be presented based on difference triple method. Finally, we employ this near-compatible factorization to illustrate the development of triple design, that is called near-triad design |
| first_indexed | 2024-07-04T06:46:27Z |
| format | Article |
| id | uum-30782 |
| institution | Universiti Utara Malaysia |
| language | English |
| last_indexed | 2024-07-04T06:46:27Z |
| publishDate | 2018 |
| publisher | Academic Publications, Ltd. |
| record_format | dspace |
| spelling | uum-307822024-05-19T08:33:02Z https://repo.uum.edu.my/id/eprint/30782/ Near-Compatible Factorization Aldiabat, Raja’i Ibrahim, Haslinda QA Mathematics A compatible factorization of order v, is a v × (v−1)2 array of distinct triples in which row i form a near-one-factor with focus i. This article aims to develop compatible factorization to display v×( v−1 2 −2 3 ) triples with minimum repetition. Through this article, we propose and define a new type of factorization called near-compatible factorization. First, we prove the existence of near-compatible factorization. Then, the construction will be presented based on difference triple method. Finally, we employ this near-compatible factorization to illustrate the development of triple design, that is called near-triad design Academic Publications, Ltd. 2018 Article PeerReviewed application/pdf en https://repo.uum.edu.my/id/eprint/30782/1/IJPAM%20120%2002%20259-273.pdf Aldiabat, Raja’i and Ibrahim, Haslinda (2018) Near-Compatible Factorization. International Journal of Pure and Applied Mathematics, 120 (2). pp. 259-273. ISSN 1311-8080 (printed version); 1314-3395 (on-line version) http://www.ijpam.eu 10.12732/ijpam.v120i2.10 10.12732/ijpam.v120i2.10 10.12732/ijpam.v120i2.10 |
| spellingShingle | QA Mathematics Aldiabat, Raja’i Ibrahim, Haslinda Near-Compatible Factorization |
| title | Near-Compatible Factorization |
| title_full | Near-Compatible Factorization |
| title_fullStr | Near-Compatible Factorization |
| title_full_unstemmed | Near-Compatible Factorization |
| title_short | Near-Compatible Factorization |
| title_sort | near compatible factorization |
| topic | QA Mathematics |
| url | https://repo.uum.edu.my/id/eprint/30782/1/IJPAM%20120%2002%20259-273.pdf |
| work_keys_str_mv | AT aldiabatrajai nearcompatiblefactorization AT ibrahimhaslinda nearcompatiblefactorization |