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.     

A New Family of Cyclic Difference Sets with Singer Parameters in Characteristic Three

We construct a new family of cyclic difference sets with parameters ((3 ^d – 1)/2, (3 ^{d – 1} – 1)/2, (3 ^{d – 2} – 1)/2) for each odd d. The difference sets are constructed with certain maps that form Jacobi sums. These new difference sets are similar to Maschietti's hyperoval difference sets, of the Segre type, in characteristic two. We conclude by calculating the 3-ranks of the new difference sets.     

Blocking Structures of Hermitian Varieties

Given a hermitian variety H(d,q²) and an integer k (d–1)/2, a blocking set with respect to k-subspaces is a set of points of H(d,q²) that meets all k-subspaces of H(d,q²). If H(d,q²) is naturally embedded in PG(d,q²), then linear examples for such a blocking set are the ones that lie in a subspace of codimension k of PG(d,q²). Up to isomorphism there are k+1 non-isomorphic minimal linear blocking sets, and these have different cardinalities. In this paper it is shown for 1 k< (d–1)/2 that all sufficiently small minimal blocking sets of H(d,q²) with respect to k-subspaces are linear. For 1 k< d/2–3, it is even proved that the k+1 minimal linear blocking sets are smaller than all minimal non-linear ones.AMS Classification: 1991 MSC: 51E20, 51E21     

Abelian Difference Sets Without Self-conjugacy

We obtain some results that are useful to the study of abelian difference sets and relative difference sets in cases where the self-conjugacy assumption does not hold. As applications we investigate McFarland difference sets, which have parameters of the form v=q^d+1( q^d+ q^d-1 +...+ q+2) ,k=q^d( q^d+q^d-1+...+q+1) , = q^d ( q^(d-1)+q^(d-2)+...+q+1), where q is a prime power andd a positive integer. Using our results, we characterize those abelian groups that admit a McFarland difference set of order k- = 81. We show that the Sylow 3-subgroup of the underlying abelian group must be elementary abelian. Our results fill two missing entries in Kopilovich's table with answer no.     

Building Symmetric Designs With Building Sets

We introduce a uniform technique for constructing a family of symmetric designs with parameters (v(q ^m+1-1)/(q-1), kq ^m ,q ^m), where m is any positive integer, (v, k, ) are parameters of an abelian difference set, and q = k ²/(k - ) is a prime power. We utilize the Davis and Jedwab approach to constructing difference sets to show that our construction works whenever (v, k, ) are parameters of a McFarland difference set or its complement, a Spence difference set or its complement, a Davis–Jedwab difference set or its complement, or a Hadamard difference set of order 9 · 4 ^d , thus obtaining seven infinite families of symmetric designs.     

On the Spectrum of the Sizes of Maximal Partial Line Spreads in <Emphasis Type="Italic">PG</Emphasis>(2<Emphasis Type="Italic">n</Emphasis>,<Emphasis Type="Italic">q</Emphasis>), <Emphasis Type="Italic">n</Emphasis> ≥ 3

A lot of research has been done on the spectrum of the sizes of maximal partial spreads in PG(3,q) [P. Govaerts and L. Storme, Designs Codes and Cryptography, Vol. 28 (2003) pp. 51–63; O. Heden, Discrete Mathematics, Vol. 120 (1993) pp. 75–91; O. Heden, Discrete Mathematics, Vol. 142 (1995) pp. 97–106; O. Heden, Discrete Mathematics, Vol. 243 (2002) pp. 135–150]. In [A. Gács and T. Sznyi, Designs Codes and Cryptography, Vol. 29 (2003) pp. 123–129], results on the spectrum of the sizes of maximal partial line spreads in PG(N,q), N 5, are given. In PG(2n,q), n 3, the largest possible size for a partial line spread is q^2n-1+q^2n-3+...+q³+1. The largest size for the maximal partial line spreads constructed in [A. Gács and T. Sznyi, Designs Codes and Cryptography, Vol. 29 (2003) pp. 123–129] is (q²ⁿ⁺¹–q)/(q²–1)–q³+q²–2q+2. This shows that there is a non-empty interval of values of k for which it is still not known whether there exists a maximal partial line spread of size k in PG(2n,q). We now show that there indeed exists a maximal partial line spread of size k for every value of k in that interval when q 9.J. Eisfeld: Supported by the FWO Research Network WO.011.96NP. Sziklai: The research of this author was partially supported by OTKA D32817, F030737, F043772, FKFP 0063/2001 and Magyary Zoltan grants. The third author is grateful for the hospitality of Ghent University.     

On a relation between a cyclic relative difference set associated with the quadratic extensions of a finite field and the Szekeres difference sets

Letq 3 (mod 4) be a prime power and put . We consider a cyclic relative difference set with parametersq ²–1,q, 1,q–1 associated with the quadratic extension GF(q²)/GF((q). The even part and the odd part of the cyclic relative difference set taken modulon are supplementary difference sets. Moreover it turns out that their complementary subsets are identical with the Szekeres difference sets. This result clarifies the true nature of the Szekeres difference sets. We prove these results by using the theory of the relative Gauss sums.     

On (p a , p b , p a , p a-b )-Relative Difference Sets

This paper provides new exponent and rank conditions for the existence of abelian relative (p ^a,p ^b,p ^a,p ^a–b)-difference sets. It is also shown that no splitting relative (2^2c,2^d,2^2c,2^2c–d)-difference set exists if d > c and the forbidden subgroup is abelian. Furthermore, abelian relative (16, 4, 16, 4)-difference sets are studied in detail; in particular, it is shown that a relative (16, 4, 16, 4)-difference set in an abelian group G Z₈ × Z₄ × Z₂ exists if and only if exp(G) 4 or G = Z₈ × (Z₂)³ with N Z₂ × Z₂.     

Blocking Sets and Derivable Partial Spreads

We prove that a GF(q)-linear Rédei blocking set of size q ^t + q ^t–1 + ··· + q + 1 of PG(2,q ^t) defines a derivable partial spread of PG(2t – 1, q). Using such a relationship, we are able to prove that there are at least two inequivalent Rédei minimal blocking sets of size q ^t + q ^t–1 + ··· + q + 1 in PG(2,q ^t), if t 4.     

A new graphic characterization of non singular quadrics of PG(r,q)

LetK be ak-set of class [0, 1,m,n]₁ of anr-dimensional projective Galois space PG(r, q) of orderq. We prove that: Ifr = 2s (s 2),k = _2s–1 and if through each point ofK there are exactlyq ^2(s–1) tangent lines and at most _2s–3 n-secant lines, thenK is a non singular quadric of PG(2s,q). Ifr = 2s–1 (s2),k=_2(s–1) +q ^s–1 and if at each point ofK there are exactlyq ^2s–3 –q ^s–2 tangents and at most _2(s–2)+q ^s–2 n-secant lines, thenK is a hyperbolic quadric of PG(2s–1,q).     

On the number of nowhere zero points in linear mappings

LetA be a nonsingularn byn matrix over the finite fieldGF _q ,k=n/2,q=p ^a ,a1, wherep is prime. LetP(A,q) denote the number of vectorsx in (GF _q ) ⁿ such that bothx andAx have no zero component. We prove that forn2, and ,P(A,q)[(q–1)(q–3)] ^k (q–2) ^n–2k and describe all matricesA for which the equality holds. We also prove that the result conjectured in [1], namely thatP(A,q)1, is true for allqn+23 orqn+14.     

Constraints of the KP hierarchy and the bilinear method

We consider generalizedk-constraints of the KP hierarchy where the Lax operatorL is forced to satisfy L _– ^k =q^–1r. We study the effect of those constraints on the bilinear equations.     

Baer subgeometry partitions

For any odd integern 3 and prime powerq, it is known thatPG(n–1, q²) can be partitioned into pairwise disjoint subgeometries isomorphic toPG(n–1, q) by taking point orbits under an appropriate subgroup of a Singer cycle ofPG(n–1, q²). In this paper, we construct Baer subgeometry partitions of these spaces which do not arise in the classical manner. We further illustrate some of the connections between Baer subgeometry partitions and several other areas of combinatorial interest, most notably projective sets and flagtransitive translation planes.     

Near nearfield planes

The translation planes of order k that admit at least two affine homology groups of order (k–1)/2 are classified. If k7² or 23², the plane is generalized André and there is a Dickson pair {q, n} such that q ⁿ =k and a cyclic homology subgroup of order (q ⁿ –1)/2n.This article was written when the first author was visiting the University of Iowa during 1990–91.     

On Large Sets of v−1 L-Intersecting Steiner Triple Systems of Order v

This paper presents four new recursive constructions for large sets of v–1 STS(v). These facilitate the production of several new infinite families of such large sets. In particular, we obtain for each n2 a large set of 3 ⁿ –1 STS (3 ⁿ ) whose systems intersect in 0 or 3 blocks.     

Strongly Regular Semi-Cayley Graphs

We consider strongly regular graphs = (V, E) on an even number, say 2n, of vertices which admit an automorphism group G of order n which has two orbits on V. Such graphs will be called strongly regular semi-Cayley graphs. For instance, the Petersen graph, the Hoffman–Singleton graph, and the triangular graphs T(q) with q 5 mod 8 provide examples which cannot be obtained as Cayley graphs. We give a representation of strongly regular semi-Cayley graphs in terms of suitable triples of elements in the group ring Z G. By applying characters of G, this approach allows us to obtain interesting nonexistence results if G is Abelian, in particular, if G is cyclic. For instance, if G is cyclic and n is odd, then all examples must have parameters of the form 2n = 4s ² + 4s + 2, k = 2s ² + s, = s ² – 1, and = s ²; examples are known only for s = 1, 2, and 4 (together with a noncyclic example for s = 3). We also apply our results to obtain new conditions for the existence of strongly regular Cayley graphs on an even number of vertices when the underlying group H has an Abelian normal subgroup of index 2. In particular, we show the nonexistence of nontrivial strongly regular Cayley graphs over dihedral and generalized quaternion groups, as well as over two series of non-Abelian 2-groups. Up to now these have been the only general nonexistence results for strongly regular Cayley graphs over non-Abelian groups; only the first of these cases was previously known.     

Multiple Blocking Sets in PG(n, q), n > 3

This article discusses minimal s-fold blocking sets B in PG (n, q), q = p^h, p prime, q > 661, n > 3, of size |B| > sq + c ^p q ^2/3 - (s - 1) (s - 2)/2 (s > min (c ^p q ^1/6, q ^1/4/2)). It is shown that these s-fold blocking sets contain the disjoint union of a collection of s lines and/or Baer subplanes. To obtain these results, we extend results of Blokhuis–Storme–Szönyi on s-fold blocking sets in PG(2, q) to s-fold blocking sets having points to which a multiplicity is given. Then the results in PG(n, q), n 3, are obtained using projection arguments. The results of this article also improve results of Hamada and Helleseth on codes meeting the Griesmer bound.     

Pseudo-Paley graphs and skew Hadamard difference sets from presemifields

Let (K, + ,*) be an odd order presemifield with commutative multiplication. We show that the set of nonzero squares of (K, *) is a skew Hadamard difference set or a Paley type partial difference set in (K, +) according as q is congruent to 3 modulo 4 or q is congruent to 1 modulo 4. Applying this result to the Coulter–Matthews presemifield and the Ding–Yuan variation of it, we recover a recent construction of skew Hadamard difference sets by Ding and Yuan [7]. On the other hand, applying this result to the known presemifields with commutative multiplication and having order q congruent to 1 modulo 4, we construct several families of pseudo-Paley graphs. We compute the p-ranks of these pseudo-Paley graphs when q = 3⁴, 3⁶, 3⁸, 3¹⁰, 5⁴, and 7⁴. The p-rank results indicate that these graphs seem to be new. Along the way, we also disprove a conjecture of René Peeters [17, p. 47] which says that the Paley graphs of nonprime order are uniquely determined by their parameters and the minimality of their relevant p-ranks. Dedicated to Dan Hughes on the occasion of his 80th birthday.     

On the Minimum Size of Some Minihypers and Related Linear Codes

We denote by m_r,q(s) the minimum value of f for which an {f, _r-2+s ; r,q }-minihyper exists for r 3, 1 s q–1, where _j=(q^j+1–1)/(q–1). It is proved that m_3,q(s)=₁(₁+s) for many cases (e.g., for all q 4 when ) and that m_r,q(s) _r-1+s₁+q for 1 s q – 1,~q 3,~r 4. The nonexistence of some [n,k,n+s–q^k-2]_q codes attaining the Griesmer bound is given as an application.AMS classification: 94B27, 94B05, 51E22, 51E21     

Maximal subgroups of symmetric groups defined on projective spaces over finite fields

Let PL(n, q) be a complete projective group of semilinear transformations of the projective space P(n–1, q) of projective degree n–l over a finite field of q elements; we consider the group in its natural 2-transitive representation as a subgroup of the symmetric group S(P*(n–1, q)) on the setp*(n–1),q=p(n–1,q)/{O}. In the present note we show that for arbitrary n satisfying the inequality n>4[(qⁿ–1)/(q^n–1–1)] [in particular, for n>4(q +l)] and for an arbitrary substitutiong s (p*(n–1,q))pL(n,q) the group PL(n,q), g contains the alternating group A(P* (n–1,q)). Forq=2, 3 this result is extended to all n3.Translated from Matematicheskie Zametki, Vol. 16, No. 1, pp. 91–100, July, 1974.The author expresses his sincere thanks to M. M. Glukhov for his interest in his work.