On cyclic semi-regular group divisible designs (Q1102672): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 02:42, 31 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On cyclic semi-regular group divisible designs |
scientific article |
Statements
On cyclic semi-regular group divisible designs (English)
0 references
1987
0 references
Consider a set of v symbols partitioned into m (\(\geq 2)\) equivalence classes of n symbols each. An arrangement of these v symbols in b sets of k \((<v)\) distinct symbols is said to be a group divisible (GD) design if (i) every symbol occurs in r sets, and (ii) two distinct symbols from the same equivalence class occur together in \(\lambda_ 1\) sets and two symbols from different equivalence classes occur together in \(\lambda_ 2\) sets. If the automorphism group of a GD design contains a cyclic group of order v, then the GD design is said to be cyclic. A GD design is said to be semi-regular (SR) if rk-v \(\lambda\) \({}_ 2=0.\) In this paper, the authors study the properties of cyclic SRGD designs.
0 references
full orbit
0 references
short orbit
0 references
method of differences
0 references
semiregular group divisible designs
0 references
GD design
0 references
cyclic SRGD designs
0 references