A Note on Difference Sets
β Scribed by Hikoe Enomoto; Mariko Hagita; Makoto Matsumoto
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 234 KB
- Volume
- 84
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
β¦ Synopsis
Let D be a (v, k, *)-difference set in a group G. Assume that G has a normal subgroup N such that GΓN is cyclic or nearly cyclic. Under the self-conjugacy assumption on exp(GΓN), we shall give bounds on |N| and *. The theorem is applicable to a wider variety of parameters for groups, not necessarily abelian. These bounds exclude a (96, 20, 4)-difference set in ZΓ4Z_ZΓ8Z_ZΓ3Z or ZΓ2Z_ZΓ2Z_ZΓ8Z_ ZΓ3Z, which were recently proved by
π SIMILAR VOLUMES
Let D be a planar cyclic difference set with 0 β D. Krasikov and SchΓΆnheim proposed in the problem: prove that there are elements d i , d j , d k β D -{0} such that d i + d j + d k = 0. We prove this and a little more.
Mutually orthogonal sets of hypercubes are higher dimensional generalizations of mutually orthogonal sets of Latin squares. For Latin squares, it is well known that the Cayley table of a group of order n is a Latin square, which has no orthogonal mate if n is congruent to 2 modulo 4. We will prove a
For integers m, n β₯ 2, let f (m, n) be the minimum order of a graph where every vertex belongs to both a clique of cardinality m and an independent set of cardinality n. We show that f (m, n) = ( β m -1 + β n -1) 2 .
We formulate and solve a collection of functional equations arising in the framework of fuzzy logic when modeling the concept of a difference operation between couples of fuzzy sets.