On enumeration of hypergroups of order 3
β Scribed by Ch. Tsitouras; Ch. G. Massouros
- Publisher
- Elsevier Science
- Year
- 2010
- Tongue
- English
- Weight
- 344 KB
- Volume
- 59
- Category
- Article
- ISSN
- 0898-1221
No coin nor oath required. For personal study only.
β¦ Synopsis
In this paper we present a symbolic manipulation package that enumerates the hypergroups of order 3. It separates them into isomorphic classes and calculates their cardinality.
π SIMILAR VOLUMES
We develop methods for coding with first-order formulas into the partial order E of enumerable sets under inclusion. First we use them to reprove and generalize the (unpublished) result of the first author that the elementary theory of E has the same computational complexity as the theory of the nat
## Abstract We investigate signings of symmetric GDD($16 \times 2^i$, 16, $2^{4-i}$)s over $Z\_2$ for $1 \le i \le 3$. Beginning with $i=1$, at each stage of this process a signing of a GDD($16 \times 2^i$, 16, $2^{4-i}$) produces a GDD($16 \times 2^{i+1}$, 16, $2^{4-i-1}$). The initial GDDs ($i=1$