We give a new recursive construction of simple non-trivial designs. Using this construction, we show that given a natural number t and a finite group G; a simple non-trivial t-design admitting an automorphism group isomorphic to G exists. Further, we apply our construction to get a recursive constru
โฆ LIBER โฆ
Hadamard designs with no non-trivial automorphisms
โ Scribed by C. W. Norman
- Publisher
- Springer
- Year
- 1973
- Tongue
- English
- Weight
- 227 KB
- Volume
- 2
- Category
- Article
- ISSN
- 0046-5755
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Simple Non-trivial Designs with an Arbit
โ
Ngo Dac Tuan
๐
Article
๐
2002
๐
Elsevier Science
๐
English
โ 92 KB
A Series of Hadamard Designs with Large
โ
Dieter Held; Mario-Osvin Pavฤeviฤ
๐
Article
๐
2000
๐
Elsevier Science
๐
English
โ 78 KB
for helmut wielandt on his 90th birthday Whilst studying a certain symmetric 99 49 24 -design acted upon by a Frobenius group of order 21, it became clear that the design would be a member of an infinite series of symmetric 2q 2 + 1 q 2 q 2 -1 /2 -designs for odd prime powers q. In this note, we pre
On (v, k, ฮป) graphs and designs with tri
โ
F.C Bussemaker; W.H Haemers; J.J Seidel; E Spence
๐
Article
๐
1989
๐
Elsevier Science
๐
English
โ 633 KB
Examples of non-trivial efficiency-balan
โ
Dr. Sanpei Kageyama
๐
Article
๐
1984
๐
John Wiley and Sons
๐
English
โ 109 KB
The group of automorphisms of non-associ
โ
M. A. Shahabi; A. S. Janfada
๐
Article
๐
1993
๐
Springer
๐
English
โ 222 KB
A note on functionally complete algebras
โ
Jon Froemke
๐
Article
๐
1974
๐
Springer-Verlag
๐
French
โ 135 KB