A class of doubly resolvable GDDs from Baer subplanes (Q5934192): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4876928 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4349623 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4858161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On resolvable designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The existence of doubly resolvable \((v,3,2)\)-BIBDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4877008 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4742798 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An even side analogue of Room squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Doubly resolvable designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Mutually Orthogonal Resolutions and Near-Resolutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A few more RBIBDs with \(k=5\) and \(\lambda{}=1\) / rank
 
Normal rank

Latest revision as of 17:30, 3 June 2024

scientific article; zbMATH DE number 1606089
Language Label Description Also known as
English
A class of doubly resolvable GDDs from Baer subplanes
scientific article; zbMATH DE number 1606089

    Statements

    A class of doubly resolvable GDDs from Baer subplanes (English)
    0 references
    14 July 2002
    0 references
    A group divisible design (GDD) is a triple \(({\mathcal X},{\mathcal G},{\mathcal B})\) which satisfies the following properties: \(\mathcal G\) is partition of a finite set \(\mathcal X\) into subsets called groups; \(\mathcal B\) is a set of subsets of \(\mathcal X\) (called blocks) such that a group and a block contain at most one common element; and every pair of distinct elements from distinct groups occurs in a unique block. A set \(P\) of blocks is called a resolution (parallel) class if every element of \(\mathcal X\) occurs precisely once in the blocks of \(P\). A set \(Q\) is called a partial resolution (parallel) class with respect to a group \(G\in {\mathcal G}\) if every element of \({\mathcal X}-G\) occurs precisely once in the blocks of \(Q\). A set \(\mathcal P\) (\(\mathcal Q\)) of resolution (partial resolution) classes is called a resolution (partial resolution) if \(\mathcal P\) (\(\mathcal Q\)) partitons the set of blocks \(\mathcal B\). Two (partial) resolutions \(R\) and \(R'\) are called orthogonal if any (partial) resolution class of \(R\) and any (partial) resolution class of \(R'\) intersect in at most one block. Pairs of orthogonal resolutions and pairs of orthogonal partial resolutions have been studied. In this paper, the author considers GDDs which have a resolution and an orthogonal partial resolution. (Houses of order \(n\) are examples of this type of GDD with block size 2.) The author constructs an infinite class of 3-GDDs of type \(6^{12t+4}\) and an infinite class of 4-GDDs of type \(12^{20t+5}\) which have a resolution and an orthogonal partial resolution. The paper does not contain any motivation for investigating these designs.
    0 references
    0 references
    Baer subplanes
    0 references
    group divisible design
    0 references
    partial resolution
    0 references