1984
DOI: 10.3792/pjaa.60.266
|View full text |Cite
|
Sign up to set email alerts
|

Dualizing with respect to $s$-tuples

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2003
2003
2003
2003

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 7 publications
0
1
0
Order By: Relevance
“…Then it is easy to see that the parameters are v = k(2k -1), b = 4k2 -1, r = 2k + 1, k = k, .A = 1. Shrikhande (1952) has proved that the the number of s-tuples in a set of the numbers of treatments common to any two blocks in the parent design (see Kageyama and Mohan, 1984b). [Note that if the number of times s-tuples of treatments occur and the number of treatments common to any two blocks in the parent design are not constant, then the values of ki s ) and .xis) are also varying.]…”
Section: Dualizationmentioning
confidence: 99%
“…Then it is easy to see that the parameters are v = k(2k -1), b = 4k2 -1, r = 2k + 1, k = k, .A = 1. Shrikhande (1952) has proved that the the number of s-tuples in a set of the numbers of treatments common to any two blocks in the parent design (see Kageyama and Mohan, 1984b). [Note that if the number of times s-tuples of treatments occur and the number of treatments common to any two blocks in the parent design are not constant, then the values of ki s ) and .xis) are also varying.]…”
Section: Dualizationmentioning
confidence: 99%