Talk:Orthogonal array

From Citizendium
Revision as of 05:22, 25 June 2008 by imported>Andrey Khalyavin (→‎Question)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search
This article is a stub and thus not approved.
Main Article
Discussion
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
 
To learn how to update the categories for this article, see here. To update categories, edit the metadata template.
 Definition An array of tuples over an finite alphabet that have every combination of symbols in some sets of coordinates appear equaly often. [d] [e]
Checklist and Archives
 Workgroup category Mathematics [Please add or review categories]
 Talk Archive none  English language variant British English

Question

I have problems understanding your article. For instance, you write:

Latin squares are . In order to see this, consider all triples where — symbol in i-th row and j-th column in the latic [latin? PW] square. Then such triples for all

but then in the example i and j run from 1 to 3 and do not start at 0. And what is s, is it 3? If so, I find it confusing that you use s for the number of "symbols" and s(i,j) for the "symbol" itself. What is the difference between n and s? Also, the term "symbol" sounds odd to me, would "object" not be a better word, or is the word symbol standard in this subfield of math?--Paul Wormer 06:42, 23 June 2008 (CDT)

The notation was a bit awkward, so I changed s(i,j) to a(i,j). And I also changed the counting so that i and j start at 0. In the Latin square example, n and s are the same. I have no idea whether "symbol" is the standard term in this field, but it may well be. -- Jitse Niesen 12:36, 24 June 2008 (CDT)
Thanks for the changes. Technically any s dictinct symbols can be used in an orthogonal array and a latin square but using is more consistent. And answering previous question: n is a parameter of latin square (its size and number of symbols), s is a parameter of orthogonal array. Andrey Khalyavin 06:22, 25 June 2008 (CDT)