Automorphisms of Certain Design Groups
โ Scribed by W.F. Ke; H. Kiechle
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 499 KB
- Volume
- 167
- Category
- Article
- ISSN
- 0021-8693
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
## Abstract In this article, we introduce a new orderly backtrack algorithm with efficient isomorph rejection for classification of __t__โdesigns. As an application, we classify all simple 2โ(13,3,2) designs with nontrivial automorphism groups. The total number of such designs amounts to 1,897,386.
showed that outer automorphism groups of fundamental groups of closed orientable surfaces are residually finite. Here we generalize her result by showing that outer automorphism groups of generalized free products of two free groups amalgamating a maximal cyclic subgroup are residually finite. From
If n G 3 and F is free of rank n, then Out Aut F s Out Out F s 1 . n n n แฎ 2000 Academic Press n is an isomorphism. Tits's theorem leads to a proof that the outer automor-
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
We show that certain properties of groups of automorphisms can be read off from the actions they induce on the finite characteristic quotients of their underlying group G. In particular, we obtain criteria for groups of automorphisms of a ลฝ . residually finite and soluble minimax -by-finite group G