On the existence of (v,7,1)-perfect Mendelsohn designs (Q2277270): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Beiliang Du / rank
 
Normal rank
Property / author
 
Property / author: Lie Zhu / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Direct Constructions for Perfect 3-Cyclic Designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3698809 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3788020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolvable perfect cyclic designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3686719 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5725147 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A series of separable designs with application to pairwise orthogonal Latin squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4190650 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced incomplete block designs and related designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized complete mappings, neofields, sequenceable groups and block designs. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3342588 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of doubly resolvable Kirkman systems and equidistant permutation arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5587083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5619847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect cyclic designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5737481 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial theory seminar Eindhoven University of Technology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4071247 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3335792 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0012-365x(90)90129-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2031824879 / rank
 
Normal rank

Latest revision as of 09:22, 30 July 2024

scientific article
Language Label Description Also known as
English
On the existence of (v,7,1)-perfect Mendelsohn designs
scientific article

    Statements

    On the existence of (v,7,1)-perfect Mendelsohn designs (English)
    0 references
    0 references
    0 references
    0 references
    1990
    0 references
    A set of v points together with a collection of k-cycles (called blocks) described on the points is a (v,k,\(\lambda\))-Mendelsohn design if any two points are consecutive in exactly \(\lambda\) blocks. If any two points are at a distance t in exactly \(\lambda\) blocks for \(t=1,2,...,k-1\) then the design is said to be perfect. An obvious necessary condition for the existence of a perfect (v,7,1)-Mendelsohn design is that v be congruent to 0 or 1(mod 7). Here the authors show that this condition is also sufficient provided \(v\geq 2136\). The proof is based on establishing the following result about pairwise balanced designs (with variable block sizes): a pairwise balanced design on v points with \(\lambda =1\) and every block size a prime power congruent to 0 or 1(mod 7) exists for all \(v\geq 2136\) with v congruent to 0 or 1(mod 7).
    0 references
    perfect cyclic design
    0 references
    Mendelsohn design
    0 references
    pairwise balanced design
    0 references

    Identifiers