Pólya enumeration of expansions of resolvable incidence structures
✍ Scribed by Dieter Schäfer; Karl Erich Wolff
- Publisher
- Elsevier Science
- Year
- 1983
- Tongue
- English
- Weight
- 767 KB
- Volume
- 43
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
✦ Synopsis
It is shov: n FOP p he number of 'true-isomorphism' classes of expansion of a resolvable inciden,:e 9;ti Mu SQ~r< ttj another incidence structure ('at infinity') can be expressed in terms of the cycle inkiiiiz:. "1 ';!r; automorphism groups of the incidence structures. As an example all expansloo::., . ,' ~:::~~I divisible design (with three parallelisms) to another divisible design are deten&&
📜 SIMILAR VOLUMES
## Abstract A backtracking over parallel classes with a partial isomorph rejection (PIR) is carried out to enumerate the resolvable 2‐(10,5,16) designs. Computational results show that the inclusion of PIR reduce substantially the CPU time for the enumeration of all designs. We prove first some res