Yayın: Orthogonal Trades and the Intersection Problem for Orthogonal Arrays
| dc.contributor.author | Demirkale, Fatih | |
| dc.contributor.author | Donovan, Diane M. | |
| dc.contributor.author | Kucukcifci, Selda | |
| dc.contributor.author | Yazici, Emine Sule | |
| dc.date.accessioned | 2026-06-27T13:49:05Z | |
| dc.date.issued | 2016 | |
| dc.description.abstract | This work provides an orthogonal trade for all possible volumes N is an element of Z(+) \ {1, 2, 3, 4, 5, 7} for block size 4. All orthogonal trades of volume N <= 15 are classified up to isomorphism for this block size. The intersection problem for orthogonal arrays with block size 4 is solved for all but finitely many possible exceptions. | en |
| dc.description.sponsorship | Scientific and Technological Research Council of Turkey TUBITAK Grant [110T692, 114F505] | |
| dc.description.sponsorship | TUBITAK Visiting Scientist program [2221] | |
| dc.description.sponsorship | Australian Research Council [DP1092868] | |
| dc.description.sponsorship | Australian Research Council [DP1092868] Funding Source: Australian Research Council | |
| dc.description.uri | https://doi.org/10.1007/s00373-015-1638-y | |
| dc.identifier.doi | 10.1007/s00373-015-1638-y | |
| dc.identifier.eissn | 1435-5914 | |
| dc.identifier.endpage | 912 | |
| dc.identifier.issn | 0911-0119 | |
| dc.identifier.issue | 3 | |
| dc.identifier.startpage | 903 | |
| dc.identifier.uri | https://hdl.handle.net/20.500.14981/55133 | |
| dc.identifier.volume | 32 | |
| dc.identifier.wos | 000374837800005 | |
| dc.language.iso | eng | |
| dc.publisher | SPRINGER JAPAN KK | |
| dc.relation.ispartof | GRAPHS AND COMBINATORICS | |
| dc.subject | Orthogonal arrays | |
| dc.subject | Combinatorial trades | |
| dc.subject | Intersection problem | |
| dc.subject | LATIN SQUARES | |
| dc.subject | Mathematics | |
| dc.title | Orthogonal Trades and the Intersection Problem for Orthogonal Arrays | |
| dc.type | Article | |
| dspace.entity.type | Publication | |
| local.import.source | WOS |