Existence of (q,6,1) Difference Families withq a Prime Power

The existence of a (q,k,1) difference family in GF(q) has been completely solved for k=3, 4, 5. For k=6 fundamental results have been given by Wilson. In this article, we continue the investigation and show that the necessary condition for the existence of a(q,6,1) difference family in GF(q), i.e. q 1 (mod 30) is also sufficient with one exception of q=61. The method of this paper is to lower Wilson's bound by using Weil's theorem on character sums to exploit Wilson's sufficient conditions for the existence of (q,6,1) difference families. The remaining gap is closed by computer searches.     

Existence of (q,k, 1) difference families with q a prime power and k = 4, 5

The existence of a (q, k, 1) difference family in GF(q) has been completely solved for k = 3. For k = 4, 5 partial results have been given by Bose, Wilson, and Buratti. In this article, we continue the investigation and show that the necessary condition for the existence of a (q, k, 1) difference family in GF(q), i.e., q ≡ 1 (mod k(k − 1)) is also sufficient for k = 4, 5. For general k, Wilson's bound shows that a (q, k, 1) difference family in GF(q) exists whenever q ≡ 1 (mod k(k − 1)) and q > [k(k − 1)/2]^k(k−1). An improved bound on q is also presented. © 1999 John Wiley & Sons, Inc. J Combin Designs 7: 21–30, 1999     

The Existence of （v, 4, 1） Disjoint Difference Families with v a Prime Power

A （v, k, λ） difference family （（v, k, λ）-DF in short） over an abelian group G of order v, is a collection F=（Bi｜i ∈ I} of k-subsets of G, called base blocks, such that any nonzero element of G can be represented in precisely A ways as a difference of two elements lying in some base blocks in F. A （v, k, λ）-DDF is a difference family with disjoint blocks. In this paper, by using Weil＇s theorem on character sum estimates, it is proved that there exists a （p^n, 4, 1）-DDF, where p = 1 （rood 12） is a prime number and n ≥1.     

Constructions of (q, K, λ, t, Q) almost difference families

The concept of a (q, k, λ, t) almost difference family (ADF) has been introduced and studied by C. Ding and J. Yin as a useful generalization of the concept of an almost difference set. In this paper, we consider, more generally, (q, K, λ, t, Q)-ADFs, where K = {k₁, k₂, ..., k_r} is a set of positive integers and Q = (q₁, q₂,..., q_r) is a given block-size distribution sequence. A necessary condition for the existence of a (q, K, λ, t, Q)-ADF is given, and several infinite classes of (q, K, λ, t, Q)-ADFs are constructed.     

The Existence of (v,4,1) Disjoint Difference Families with a Prime Power

A(υ,κ,λ,)difference family((υ,κ,λ,)-DF in short)over an abelian group G of order v,is a collection F = {B_i|i∈I}ofκ-subsets of G,called base blocks,such that any nonzero element of G can be represented in preciselyλways as a difference of two elements lying in some base blocks in F.A(υ,κ,λ,)-DDF is a difference family with disjoint blocks.In this paper,by using Weil's theorem on character sum estimates,it is proved that there exists a(p~n,4,1)-DDF,where p≡1(rood 12)is a prime number and n≥1.     

New partial geometric difference sets and partial geometric difference families

Using Galois rings and Galois fields, we construct several infinite classes of partial geometric difference sets, and partial geometric difference families, with new parameters. Furthermore, these partial geometric difference sets (and partial geometric difference families) correspond to new infinite families of directed strongly regular graphs. We also discuss some of the links between partially balanced designs, 2-adesigns (which were recently coined by Cunsheng Ding in “Codes from Difference Sets” (2015)), and partial geometric designs, and make an investigation into when a 2-adesign is a partial geometric design.     

Existence question for difference families and construction of some new families

We establish some properties of mixed difference families. We obtain some criteria for the existence of such families and a special kind of multipliers. Several methods are presented for the construction of difference families by using cyclotomy and genetic algorithms. © 2004 Wiley Periodicals, Inc. J Combin Designs 12: 256–270, 2004.     

Some (17q, 17, 2) and (25q, 25, 3) BIBD Constructions

We give the explicit construction of a regular (17q, 17, 2)-BIBD for any prime power q 17 (mod 32) such that 2 is not a 4th power in GF(q) and the explicit construction of a regular (25q, 25, 3)-BIBD for any prime power q 25 (mod 48) such that and +3 are non-squares in GF(q).     

Recursive constructions for difference matrices and relative difference families

We present a new recursive construction for difference matrices whose application allows us to improve some results by D. Jungnickel. For instance, we prove that for any Abelian p-group G of type (n₁, n₂, …, n_t) there exists a (G, p^e, 1) difference matrix with e = Also, we prove that for any group G there exists a (G, p, 1) difference matrix where p is the smallest prime dividing |G|. Difference matrices are then used for constructing, recursively, relative difference families. We revisit some constructions by M. J. Colbourn, C. J. Colbourn, D. Jungnickel, K. T. Phelps, and R. M. Wilson. Combining them we get, in particular, the existence of a multiplier (G, k, λ)-DF for any Abelian group G of nonsquare-free order, whenever there exists a (p, k, λ)-DF for each prime p dividing |G|. Then we focus our attention on a recent construction by M. Jimbo. We improve this construction and prove, as a corollary, the existence of a (G, k, λ)-DF for any group G under the same conditions as above. © 1998 John Wiley & Sons, Inc. J Combin Designs 6: 165–182, 1998     

Old and new designs via difference multisets and strong difference families

Let X =((x_1,1,x_1,2,…,x_1,k),(x_2,1,x_2,2,…,x_2,k),…,(x_t,1,x_t,2,…,x_t,k)) be a family of t multisets of size k defined on an additive group G. We say that X is a t-(G,k,μ) strong difference family (SDF) if the list of differences (x_h,i-x_h,j∣h=1,…,t;i≠ j) covers all of G exactly μ times. If a SDF consists of a single multiset X, we simply say that X is a (G,k,μ) difference multiset. After giving some constructions for SDF's, we show that they allow us to obtain a very useful method for constructing regular group divisible designs and regular (or 1-rotational) balanced incomplete block designs. In particular cases this construction method has been implicitly used by many authors, but strangely, a systematic treatment seems to be lacking. Among the main consequences of our research, we find new series of regular BIBD's and new series of 1-rotational (in many cases resovable) BIBD's.     

Optimal (4up, 5, 1) optical orthogonal codes

By a (ν, k, 1)‐OOC we mean an optical orthogonal code. In this paper, it is proved that an optimal (4p, 5, 1)‐OOC exists for prime p ≡ 1 (mod 10), and that an optimal (4up, 5, 1)‐OOC exists for u = 2, 3 and prime p ≡ 11 (mod 20). These results are obtained by applying Weil's theorem. © 2004 Wiley Periodicals, Inc.     

Solving isomorphism problems about 2‐designs from disjoint difference families

Recently, two new constructions of disjoint difference families in Galois rings were presented by Davis, Huczynska, and Mullen and Momihara. Both were motivated by a well‐known construction of difference families from cyclotomy in finite fields by Wilson. It is obvious that the difference families in the Galois ring and the difference families in the finite field are not equivalent. A related question, which is in general harder to answer, is whether the associated designs are isomorphic or not. In our case, this problem was raised by Davis, Huczynska, and Mullen. In this paper, we show that, in most cases, the 2‐ designs arising from the difference families in Galois rings and those arising from the difference families in finite fields are nonisomorphic by comparing their block intersection numbers.     

Equations in finite fields with restricted solution sets. I (Character sums)

In earlier papers, for “large” (but otherwise unspecified) subsets A, B of Z _p and for h(x) ∈ Z _p [x], Gyarmati studied the solvability of the equations a + b = h(x), resp. ab = h(x) with a ∈ A, b ∈ B, x ∈ Z _p , and for large subsets A, B, C, D of Z _p Sárközy showed the solvability of the equations a + b = cd, resp. ab + 1 = cd with a ∈ A, b ∈ B, c ∈ C, d ∈ D. In this series of papers equations of this type will be studied in finite fields. In particular, in Part I of the series we will prove the necessary character sum estimates of independent interest some of which generalize earlier results.     

Constructing difference families through an optimization approach: Six new BIBDs

In this paper we formulate the construction of difference families as a combinatorial optimization problem. A tabu search algorithm is used to find an optimal solution to the optimization problem for various instances of difference families. In particular, we construct six new difference families which lead to an equal number of new balanced incomplete block designs with parameters: (49, 98, 18, 9, 3), (61, 122, 20, 10, 3), (46, 92, 20, 10, 4), (45, 90, 22, 11, 5), (85, 255, 24, 8, 2) and (34, 85, 30, 12, 10). © 2000 John Wiley & Sons, Inc. J Combin Designs 8: 261–273, 2000     

On the Existence of Simple BIBDs with Number of Elements a Prime Power

We show that, when the number of elements is a prime power q, in many situations the necessary conditions

相似文献   

Perfect difference families,perfect difference matrices,and related combinatorial structures

The existence problems of perfect difference families with block size k, k=4,5, and additive sequences of permutations of length n, n=3,4, are two outstanding open problems in combinatorial design theory for more than 30 years. In this article, we mainly investigate perfect difference families with block size k=4 and additive sequences of permutations of length n=3. The necessary condition for the existence of a perfect difference family with block size 4 and order v, or briefly (v, 4,1)‐PDF, is v≡1(mod12), and that of an additive sequence of permutations of length 3 and order m, or briefly ASP (3, m), is m≡1(mod2). So far, (12t+1,4,1)‐PDFs with t<50 are known only for t=1,4−36,41,46 with two definiteexceptions of t=2,3, and ASP (3, m)'s with odd 3<m<200 are known only for m=5,7,13−29,35,45,49,65,75,85,91,95,105,115,119,121,125,133,135,145,147,161,169,175,189,195 with two definite exceptions of m=9,11. In this article, we show that a (12t+1,4,1)‐PDF exists for any t⩽1,000 except for t=2,3, and an ASP (3, m) exists for any odd 3<m<200 except for m=9,11 and possibly for m=59. The main idea of this article is to use perfect difference families and additive sequences of permutations with “holes”. We first introduce the concepts of an incomplete perfect difference matrix with a regular hole and a perfect difference packing with a regular difference leave, respectively. We show that an additive sequence of permutations is in fact equivalent to a perfect difference matrix, then describe an important recursive construction for perfect difference matrices via perfect difference packings with a regular difference leave. Plenty of perfect difference packings with a desirable difference leave are constructed directly. We also provide a general recursive construction for perfect difference packings, and as its applications, we obtain extensive recursive constructions for perfect difference families, some via incomplete perfect difference matrices with a regular hole. Examples of perfect difference packings directly constructed are used as ingredients in these recursive constructions to produce vast numbers of perfect difference families with block size 4. © 2010 Wiley Periodicals, Inc. J Combin Designs 18: 415–449, 2010     

Impossibility of a Certain Cyclotomic Equation with Applicationsto Difference Sets

Under certain conditions, we show the nonexistence ofan element in the p-th cyclotomicfield over , that satisfies . As applications, we establish the nonexistence ofsome difference sets and affine difference sets.     

(C_k \oplus G,k,\lambda ) Difference Families

Let G be an additive group and C _k be the additive group of the ring Z _k of residues modulo k. If there exist a (G, k, ) difference family and a (G, k, ) perfect Mendelsohn difference family, then there also exists a difference family. If the (G, k, ) difference family and the (G, k, ) perfect Mendelsohn difference family are further compatible, then the resultant difference family is elementary resolvable. By first constructing several series of perfect Mendelsohn difference families, many difference families and elementary resolvable difference families are thus obtained.     

Ruling out (160, 54, 18) difference sets in some nonabelian groups

We prove the following theorems. Theorem A. Let G be a group of order 160 satisfying one of the following conditions. (1) G has an image isomorphic to D₂₀ × Z₂ (for example, if G ≃ D₂₀ × K). (2) G has a normal 5‐Sylow subgroup and an elementary abelian 2‐Sylow subgroup. (3) G has an abelian image of exponent 2, 4, 5, or 10 and order greater than 20. Then G cannot contain a (160, 54, 18) difference set. Theorem B. Suppose G is a nonabelian group with 2‐Sylow subgroup S and 5‐Sylow subgroup T and contains a (160, 54, 18) difference set. Then we have one of three possibilities. (1) T is normal, |ϕ(S)| = 8, and one of the following is true: (a) G = S × T and S is nonabelian; (b) G has a D₁₀ image; or (c) G has a Frobenius image of order 20. (2) G has a Frobenius image of order 80. (3) G is of index 6 in A Γ L(1, 16). To prove the first case of Theorem A, we find the possible distribution of a putative difference set with the stipulated parameters among the cosets of a normal subgroup using irreducible representations of the quotient; we show that no such distribution is possible. The other two cases are due to others. In the second (due to Pott) irreducible representations of the elementary abelian quotient of order 32 give a contradiction. In the third (due to an anonymous referee), the contradiction derives from a theorem of Lander together with Dillon's “dihedral trick.” Theorem B summarizes the open nonabelian cases based on this work. © 2000 John Wiley & Sons, Inc. J Combin Designs 8: 221–231, 2000