scientific article
From MaRDI portal
Publication:3222207
zbMath0557.05018MaRDI QIDQ3222207
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
randomizationgroupquasi-complete Latin squarescomplete Latin squarescomplete set of mutually orthogonal latin squaressequenceable
Related Items (35)
A product theorem for 2-sequencings ⋮ A short proof of the existence of \(2\)-sequencings in dihedral groups ⋮ Constructions for regular-graph semi-Latin rectangles with block size two ⋮ Equineighboured balanced nested row-column designs ⋮ Optimal minimal balanced crossover designs in first and second carryover effects ⋮ An extension theorem for terraces. ⋮ Narcissistic half-and-half power-sequence terraces for \(\mathbb Z_n\) with \(n=pq^{t}\). ⋮ Construction of minimal balanced cross over designs having good efficiency of separability ⋮ A class of self-orthogonal 2-sequencings ⋮ Balanced directed cycle designs based on groups ⋮ Some \(\mathbb Z_{n+2}\) terraces from \(\mathbb Z_n\) power-sequences, \(n\) being an odd prime ⋮ Some da capo directed power-sequence \(\mathbb Z _{n+1}\) terraces with \(n\) an odd prime power ⋮ A general approach to constructing power-sequence terraces for \(\mathbb Z_n\) ⋮ Further results on logarithmic terraces ⋮ Optimal and near optimal sets of Latin squares for correlated errors ⋮ A review of uniform cross-over designs ⋮ Combinatorially fruitful properties of \(3\cdot 2^{-1}\) and \(3\cdot 2^{-2}\) modulo \(p\) ⋮ Constructions for Terraces and R-Sequencings, Including a Proof That Bailey's Conjecture Holds for Abelian Groups ⋮ Hamiltonian decompositions of complete \(k\)-uniform hypergraphs ⋮ The construction of nearly balanced and nearly strongly balanced uniform cross-over designs ⋮ Construction of some classes of balanced cross-over designs from terraces ⋮ Some power-sequence terraces for \(\mathbb Z_{pq}\) with as few segments as possible ⋮ Properties of Designs in Experiments on Spatial Lattices ⋮ New complete Latin squares of odd order ⋮ There are infinitely many Williams squares with circular structure and order a multiple of 4 ⋮ Some series constructions for two-dimensional neighbor designs ⋮ Round-dance neighbour designs from terraces ⋮ Sectionable terraces and the (generalised) Oberwolfach problem ⋮ Choosing cross-over designs when few subjects are available ⋮ Optimal incomplete block designs for general dependence structures ⋮ Unnamed Item ⋮ From graceful labellings of paths to cyclic solutions of the Oberwolfach problem ⋮ History of the statistical design of agricultural experiments ⋮ Some results on multi-level factorial designs with dependent obervations ⋮ On terraces for Abelian groups.
This page was built for publication:
