Multi-set designs and numbers of common triples (Q2366951): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3760557 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4729795 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4017146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4033006 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3329480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection problem of Steiner systems S(3,4,2v) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of Steiner quadruple systems having a prescribed number of blocks in common / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner Triple Systems Having a Prescribed Number of Triples in Common / rank
 
Normal rank

Latest revision as of 18:18, 17 May 2024

scientific article
Language Label Description Also known as
English
Multi-set designs and numbers of common triples
scientific article

    Statements

    Multi-set designs and numbers of common triples (English)
    0 references
    0 references
    11 August 1993
    0 references
    A two-fold multi-set triple system is a collection of triples chosen, possibly with repetitions, from a \(v\)-set in such a way that each unordered pair (whether distinct or not) occurs precisely two times. For instance the triple \(\{x,x,y\}\) contains the pair \(\{x,x\}\) once and the pair \(\{x,y\}\) twice. Such a two-fold multi-set triple system has \(v(v+1)/3\) blocks, and a necessary and sufficient condition for existence is that \(v\equiv 0\) or \(2\pmod 3\) and \(v\geq 5\). The design is called simple if it contains no repeated blocks. Let \(I(v)\) denote the set of nonnegative integers \(s\) such that there exist two simple two-fold multi-set triple systems of order \(v\), based on the same \(v\)-set, with precisely \(s\) blocks in common. In this paper the set \(I(v)\) is completely determined for all admissible \(v\).
    0 references
    0 references
    multi-set design
    0 references
    intersection problem
    0 references
    balanced ternary design
    0 references
    triple system
    0 references