An existence theorem for some simple \(t\)-designs (Q1175985): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q127212828, #quickstatements; #temporary_batch_1722549874584 |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / cites work | |||
Property / cites work: An infinite class of 5-designs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: New infinite families of simple 5-designs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the existence of an infinite family of simple 5-designs / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0012-365x(91)90351-2 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2078438161 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q127212828 / rank | |||
Normal rank |
Latest revision as of 23:06, 1 August 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An existence theorem for some simple \(t\)-designs |
scientific article |
Statements
An existence theorem for some simple \(t\)-designs (English)
0 references
25 June 1992
0 references
A \(t\)-design \(S_ \lambda(t,\ell,v)\) is said to be simple if it contains no repeated blocks. The main result of this paper is the following theorem: Let \(S=(P,B)\) be an \(S_ \lambda(t,\ell,v)\) design and \(S'=(P',B')\) be a simple \(S_{\lambda'}(t,k,\ell)\) design with \(| B'|=b'\), if \(b^{'2}(\lambda-1)<{1\choose k}\) then there exists a simple \(S_{\lambda\lambda'}(t,k,v)\) design. The author applies this result to the Alltop's 5-designs to prove the existence of a new infinite family of 5-designs.
0 references
simple designs
0 references
Alltop's 5-designs
0 references
5-designs
0 references