相对差集和组合集的构造

利用Galois环、Bent函数、Gaolis环上的部分指数和等技巧,构造了指数不超过4的有限交换群上的分裂型相对差集和一类非分裂型组合集.     

On Relative Difference Sets in Dihedral Groups

In this paper, we study extensions of trivial difference sets in dihedral groups. Such relative difference sets have parameters of the form (uλ,u,uλ, λ) or (uλ+2,u, uλ+1, λ) and are called semiregular or affine type, respectively. We show that there exists no nontrivial relative difference set of affine type in any dihedral group. We also show a connection between semiregular relative difference sets in dihedral groups and Menon–Hadamard difference sets. In the last section of the paper, we consider (m, u, k, λ) difference sets of general type in a dihedral group relative to a non-normal subgroup. In particular, we show that if a dihedral group contains such a difference set, then m is neither a prime power nor product of two distinct primes.     

Using the Simplex Code to Construct Relative Difference Sets in 2-groups

Relative Difference Sets with the parameters (2a, 2b, 2a, 2a-b) have been constructed many ways (see davis, EB, jung, maschmidt, and pottsurvey for examples). This paper modifies an example found in arasusehgal to construct a family of relative difference sets in 2-groups that gives examples for b = 2 and b = 3 that have a lower rank than previous examples. The Simplex code is used in the construction.     

New Families of Semi-Regular Relative Difference Sets

We give two constructions for semi-regular relative difference sets (RDSs) in groups whose order is not a prime power, where the order u of the forbidden subgroup is greater than 2. No such RDSs were previously known. We use examples from the first construction to produce semi-regular RDSs in groups whose order can contain more than two distinct prime factors. For u greater than 2 these are the first such RDSs, and for u=2 we obtain new examples.     

A New Family of Relative Difference Sets in 2-Groups

We recursively construct a new family of ( 2^6d+4, 8, 2^6d+4, 2^6d+1) semi-regular relative difference sets in abelian groups G relative to an elementary abelian subgroup U. The initial case d = 0 of the recursion comprises examples of (16, 8, 16, 2) relative difference sets for four distinct pairs (G, U).     

Two Generalized Constructions of Relative Difference Sets

We give two generalizations of some known constructions of relative difference sets. The first one is a generalization of a construction of RDS by Chen, Ray-Chaudhuri and Xiang using the Galois ring GR(4, m). The second one generalizes a construction of RDS by Ma and Schmidt from the setting of chain rings to a setting of more general rings.     

Cyclic Relative Difference Sets and their p-Ranks

By modifying the constructions in Helleseth et al. [10] and No [15], we construct a family of cyclic ((q ^3k –1)/(q–1), q–1, q ^3k–1, q ^3k–2) relative difference sets, where q=3 ^e . These relative difference sets are liftings of the difference sets constructed in Helleseth et al. [10] and No [15]. In order to demonstrate that these relative difference sets are in general new, we compute p-ranks of the classical relative difference sets and 3-ranks of the newly constructed relative difference sets when q=3. By rank comparison, we show that the newly constructed relative difference sets are never equivalent to the classical relative difference sets, and are in general inequivalent to the affine GMW difference sets.     

New Constructions of Disjoint Distinct Difference Sets

New constructions of regular disjoint distinct difference sets (DDDS) are presented. In particular, multiplicative and additive DDDS are considered.     

Constructions of Partial Difference Sets and Relative DifferenceSets Using Galois Rings

We use Galois rings to construct partial difference sets and relative difference sets in non-elementary abelianp-groups. As an example, we also use Galois ringG R(4, 2) to construct a (96,20,4) difference set in Z₄ × Z₄ × Z₆.Dedicated to Hanfried Lenz on the occasion of his 80th birthday     

‐Relative Difference Sets and Their Representations

We show that every ‐relative difference set D in relative to can be represented by a polynomial , where is a permutation for each nonzero a. We call such an f a planar function on . The projective plane Π obtained from D in the way of M. J. Ganley and E. Spence (J Combin Theory Ser A, 19(2) (1975), 134–153) is coordinatized, and we obtain necessary and sufficient conditions of Π to be a presemifield plane. We also prove that a function f on with exactly two elements in its image set and is planar, if and only if, for any .     

Constructions of Nested Partial Difference Sets with Galois Rings

There have been several recent constructions of partial difference sets (PDSs) using the Galois rings for p a prime and t any positive integer. This paper presents constructions of partial difference sets in where p is any prime, and r and t are any positive integers. For the case where 2$$ " align="middle" border="0"> many of the partial difference sets are constructed in groups with parameters distinct from other known constructions, and the PDSs are nested. Another construction of Paley partial difference sets is given for the case when p is odd. The constructions make use of character theory and of the structure of the Galois ring , and in particular, the ring × . The paper concludes with some open related problems.     

Cocyclic Generalised Hadamard Matrices and Central Relative Difference Sets

Cocyclic matrices have the form where G is a finite group, C is a finite abelian group and : G × G C is a (two-dimensional) cocycle; that is,

一些部分差集和相对差集的构造

In this paper, we give a construction of RDS in Galois ring by using some bent function, and obtain the equivalent relationship between RDS and a kind of bent function. At the same time, its existence is demonstrated.     

New Classes of Groups Containing Menon Difference Sets

A theorem due to Davis on the existence of Menon difference sets in 2-groups is generalised to non-2-groups. The existence of Menon difference sets in many new non-abelian groups is established.     

Relative difference sets in semidirect products with an amalgamated subgroup

We call a group G with subgroups G₁, G₂ such that G = G₁G₂ and both N = G₁ ∩ G₂ and G₁ are normal in G a semidirect product with amalgamated subgroup N. We show that if G_l is a group with N_l ? G_l containing a relative ‐difference set relative to N_l for l = 1,2, and if there exists a “compatible coupling” from (G₂, N₂) to (G₁, N₁), a notion introduced in the paper, then for any i,j ∈ ? there exists at least one semidirect product with amalgamated subgroup N ? N₁ ? N₂ containing a relative ‐difference set. We say “at least one” to emphasize that the proof is via recursive construction and that different groups may be obtained depending on the choices made at different stages of the recursion. A special case of this result shows that if K is any finite group containing a normal relative ‐difference set, then there exists, for each i ∈ ?, at least one semidirect product with amalgamated subgroup N containing a relative ‐difference set. These results suggest that the class of semidirect products with an amalgamated subgroup provides a rich source of new (non‐abelian) semiregular relative difference sets. © 2004 Wiley Periodicals, Inc.     

On Sylow Subgroups of Abelian Affine Difference Sets

An n-subsetD of a group G of order is called an affine difference set of G relativeto a normal subgroup N of G of order if the list of differences containseach element of G-N exactly once and no elementof N. It is a well-known conjecture that if Dis an affine difference set in an abelian group G,then for every prime p, the Sylow p-subgroupof G is cyclic. In Arasu and Pott [1], it was shownthat the above conjecture is true when . In thispaper we give some conditions under which the Sylow p-subgroupof G is cyclic.     

Looking for Difference Sets in Groups with Dihedral Images

We prove four theorems about groups with a dihedral (or cyclic) image containing a difference set. For the first two, suppose G, a group of order 2p with p an odd prime, contains a nontrivial (v, k, ) difference set D with order n = k – prime to p and self-conjugate modulo p. If G has an image of order p, then 0 2a + 2 for a unique choice of = ±1, and for a = (k – )/2p. If G has an image of order 2p, then and ( – 1)/( – 1). There are further constraints on n, a and . We give examples in which these theorems imply no difference set can exist in a group of a specified order, including filling in some entries in Smith's extension to nonabelian groups of Lander's tables. A similar theorem covers the case when p|n. Finally, we show that if G contains a nontrivial (v, k, ) difference set D and has a dihedral image D _2m with either (n, m) = 1 or m = p ^t for p an odd prime dividing n, then one of the C ₂ intersection numbers of D is divisible by m. Again, this gives some non-existence results.     

New Cyclic Difference Sets with Singer Parameters Constructed from d-Homogeneous Functions

In this paper, for a prime power q, new cyclic difference sets with Singer para- meters ((q ⁿ –1/q–1), (q ^n–1–1/q–1), (q ^n–2–1/q–1)) are constructed by using q-ary sequences (d-homogeneous functions) of period q ⁿ –1 and the generalization of GMW difference sets is proposed by combining the generation methods of d-form sequences and extended sequences. When q is a power of 3, new cyclic difference sets with Singer parameters ((q ⁿ –1/q–1), (q ^n–1–1/q–1), (q ^n–2–1/q–1)) are constructed from the ternary sequences of period q ⁿ –1 with ideal autocorrelation introduced by Helleseth, Kumar, and Martinsen.     

On the Non-existence of Semiregular Relative Difference Sets in Groups with All Sylow Subgroups Cyclic

We show that a group with all Sylow subgroups cyclic (other than ) cannot contain a normal semiregular relative difference set (RDSs). We also give a new proof that dihedral groups cannot contain (normal) semiregular RDSs either.     

广义差集与几乎完美序列

提出了广义差集的概念,并且给出了广义差集的一些初等性质.从应用的角度讲,广义差集就是使得其±1特征序列的自相关函数是(最多)三值的一种组合结构.因此,广义差集不仅仅是在概念(理论)上的推广,它还具有深层次的应用背景.事实上,给出了一些广义差集,它不是可分差集,也不是相对差集.同时也给出了一类广义差集存在的一些必要条件,使得这些广义差集对应的±1特征序列成为几乎完美序列.并举例说明本文中的方法是有效的.