On a Class of Symmetric Balanced Generalized Weighing Matrices

Let q be a prime power and m a positive integer. A construction method is given to multiply the parametrs of an -circulant BGW(v=1+q+q ₂+·+q ^m , q ^m , q ^m –q ^m–1) over the cyclic group C _n of order n with (q–1)/n being an even integer, by the parameters of a symmetric BGW(1+q ^m+1, q ^m+1, q ^m+1–q ^m ) with zero diagonal over a cyclic group C _vn to generate a symmetric BGW(1+q+·+q ^2m+1,q ^2m+1,q ^2m+1–q ^2m) with zero diagonal, over the cyclic group C _n . Applications include two new infinite classes of strongly regular graphs with parametersSRG(36(1+25+·+25^2m+1),15(25)^2m+1,6(25)^2m+1,6(25)^2m+1), and SRG(36(1+49+·+49^2m+1),21(49)^2m+1,12(49)^2m+1,12(49)^2m+1).     

Some Characterizations of Finite Hermitian Veroneseans

We characterize the finite Veronesean of all Hermitian varieties of PG(n,q²) as the unique representation of PG(n,q²) in PG(d,q), d n(n+2), where points and lines of PG(n,q²) are represented by points and ovoids of solids, respectively, of PG(d,q), with the only condition that the point set of PG(d,q) corresponding to the point set of PG(n,q²) generates PG(d,q). Using this result for n=2, we show that is characterized by the following properties: (1) ; (2) each hyperplane of PG(8,q) meets in q²+1, q³+1 or q³+q²+1 points; (3) each solid of PG(8,q) having at least q+3 points in common with shares exactly q²+1 points with it.51E24     

A footnote to mean square value of DirichletL-series

Following appropriate use of approximate functional equation for Hurwitz Zeta function, we obtain upper bounds for } Here fors = σ + it, L(s,x) denotes DirichletL-series for character x(modq). In particular, we obtain S(1/2 +it) ≪q logqt + t^5/8 q^−1/8, which is an improvement in the range q |t| < q^11/7, on hitherto best known result. This incidentally gives S(1/2+ it)≪ q log3q for |t|q^9/5.     

Designs on vector spaces constructed using quadratic forms

Let N be the set of nonnegative integers, let , t, v be in N and let K be a subset of N, let V be a v-dimensional vector space over the finite field GF(q), and let W _Kbe the set of subspaces of V whose dimensions belong to K. A t-[v, K, ; q]-design on V is a mapping : W _K N such that for every t-dimensional subspace, T, of V, we have (B)=. We construct t-[v, {t, t+1}, ; q-designs on the vector space GF(q ^v) over GF(q) for t2, v odd, and q ^t(q–1)² equal to the number of nondegenerate quadratic forms in t+1 variables over GF(q). Moreover, the vast majority of blocks of these designs have dimension t+1. We also construct nontrivial 2-[v, k, ; q]-designs for v odd and 3kv–3 and 3-[v, 4, q ⁶+q ⁵+q ⁴; q]-designs for v even. The distribution of subspaces in the designs is determined by the distribution of the pairs (Q, a) where Q is a nondegenerate quadratic form in k variables with coefficients in GF(q) and a is a vector with elements in GF(q ^v) such that Q(a)=0.This research was partly supported by NSA grant #MDA 904-88-H-2034.     

Nonexistence of [n, 5, d]q Codes Attaining the Griesmer Bound for q4 ?2q2 ?2q+1 ≤ d≤ q4?2q2 ?q

We prove that there does not exist a [q⁴+q³−q²−3q−1, 5, q⁴−2q²−2q+1]_q code over the finite field for q≥ 5. Using this, we prove that there does not exist a [g_q(5, d), 5, d]_q code with q⁴ −2q² −2q +1 ≤ d ≤ q⁴ −2q² −q for q≥ 5, where g_q(k,d) denotes the Griesmer bound.MSC 2000: 94B65, 94B05, 51E20, 05B25     

A Distance-Regular Graph with Strongly Closed Subgraphs

Let be a distance-regular graph of diameter d, valency k and r := maxi | (c _i,b _i) = (c ₁,b ₁). Let q be an integer with r + 1 q d – 1.In this paper we prove the following results: Theorem 1 Suppose for any pair of vertices at distance q there exists a strongly closed subgraph of diameter q containing them. Then for any integer i with 1 i q and for any pair of vertices at distance i there exists a strongly closed subgraph of diameter i containing them. Theorem 2 If r 2, then c _2r+3 1.As a corollary of Theorem 2 we have d k ²(r + 1) if r 2.     

Exponential Sums for O+(2n,q) and Their Applications

For a nontrivial additive character of the finite field with q elements and each positive integer r, the exponential sums ( ( trw )^r ) over w SO ⁺(2n,q) and over w O ⁺(2n,q) are considered. We show that both of them can be expressed as polynomials in q involving certain new exponential sums. Estimates on those new exponential sums are given. Also, we derive from these expressions the formulas for the number of elements w in SO ⁺(2n,q) and O ⁺(2n,q) with (trw) ^r = , for each in the finite field with q elements.     

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.     

A family of translation planes of order q 2m+1 with two orbits of length 2 and q 2m+1−1 on l ∞

A class of translation planes of order q ^2m+1, where q is an odd prime power and m1, is constructed. If m=1, then this class is contained in the class of order q ³ constructed by Hiramine [5]. These planes of order q ^2m+1 are of dimension 2m+1 over their kernels. If q ^2m+13³, then the linear translation complements of these planes have two orbits of length 2 and q ^2m+1–1 on l and this class contains many planes which are not generalized André planes. If q ^2m+1= 3³, then each plane of this class is isomorphic to the Hering plane of order 27.Dedicated to Professor Tuyosi Oyama on his 60th birthday     

GBRD's: Some new constructions for difference matrices,generalised hadamard matrices and balanced generalised weighing matrices

A new construction is given for difference matrices. The generalized Hadamard matrices GH(q(q – 1)²; EA(q)) are constructed whenq andq – 1 are both prime powers. Other generalised Hadamard matrices are also shown to exist. For example, there exist GH(n; G) forn = 5² 2 3, 2⁶ 3², 11² 2² 3, 17² 2 3², 53² 2 3³, 71² 2² 3², 107² 2² 3³, 149² 5² 2 3,.... Finally, a new construction for the BGW ((q ⁴ – 1)/(q – 1),q ³,q ²(q – 1);q _q-1), and a construction for the new BGW ((q ⁸ – 1)/(q ² – 1),q ⁶,q ⁴(q ² – 1);G) are given, wheneverq is a prime power, andG is a group of orderq + 1.     

A characterization of the natural embedding of the split Cayley hexagon in by intersection numbers

In this paper, we prove that a set of q⁵+q⁴+q³+q²+q+1 lines of with the properties that (1) every point of is incident with either 0 or q+1 elements of , (2) every plane of is incident with either 0, 1 or q+1 elements of , (3) every solid of is incident with either 0, 1, q+1 or 2q+1 elements of , and (4) every hyperplane of is incident with at most q³+3q²+3q members of , is necessarily the set of lines of a regularly embedded split Cayley generalized hexagon in .     

Positive Harmonic Functions for Semi-Isotropic Random Walks on Trees, Lamplighter Groups, and DL-Graphs

We determine all positive harmonic functions for a large class of “semi-isotropic” random walks on the lamplighter group, i.e., the wreath product ℤ_q≀ℤ, where q≥2. This is possible via the geometric realization of a Cayley graph of that group as the Diestel–Leader graph . More generally, (q,r≥2) is the horocyclic product of two homogeneous trees with respective degrees q+1 and r+1, and our result applies to all -graphs. This is based on a careful study of the minimal harmonic functions for semi-isotropic walks on trees. Mathematics Subject Classifications (2000) 60J50, 05C25, 20E22, 31C05, 60G50. Supported by European Commission, Marie Curie Fellowship HPMF-CT-2002-02137.     

On 1-Blocking Sets in PG(n,q), n ≥ 3

In this article we study minimal1-blocking sets in finite projective spaces _PG(n,q),n 3. We prove that in PG(n,q ²),q = p ^h , p prime, p > 3,h 1, the second smallest minimal 1-blockingsets are the second smallest minimal blocking sets, w.r.t.lines, in a plane of PG(n,q ²). We also study minimal1-blocking sets in PG(n,q ³), n 3, q = p ^h, p prime, p > 3,q 5, and prove that the minimal 1-blockingsets of cardinality at most q 3 + q ² + q + ¹ are eithera minimal blocking set in a plane or a subgeometry PG(3,q).     

New Hadamard matrices and conference matrices obtained via Mathon's construction

We give a formulation, via (1, –1) matrices, of Mathon's construction for conference matrices and derive a new family of conference matrices of order 59^2t+1 + 1,t 0. This family produces a new conference matrix of order 3646 and a new Hadamard matrix of order 7292. In addition we construct new families of Hadamard matrices of orders 69^2t+1 + 2, 109^2t+1 + 2, 8499 ^t ,t 0;q ²(q + 3) + 2 whereq 3 (mod 4) is a prime power and 1/2(q + 5) is the order of a skew-Hadamard matrix); (q + 1)q ²9 ^t ,t 0 (whereq 7 (mod 8) is a prime power and 1/2(q + 1) is the order of an Hadamard matrix). We also give new constructions for Hadamard matrices of order 49 ^t 0 and (q + 1)q ² (whereq 3 (mod 4) is a prime power).This work was supported by grants from ARGS and ACRB.Dedicated to the memory of our esteemed friend Ernst Straus.     

Characterization of 3 D 4(q)

The author defined the concept order components in [2] and gave a new characterization of sporadic simple groups by their order components in [7]. Afterwards the following groups were characterized by the author: G₂(q), q = 0 (mod 3)^[8]; E₈(q)^[9]; Suzuki-Ree groups^[10]; PSL₂(q)^[11]. Here the author will continue such kind of characterization and prove that:Theorem 1. Let G be a finite group, M = ³D₄(q). If G and M has the same order components, then G M.And the following theorems follows from Theorem 1.Theorem 2. (Thompsons Conjecture) Let G be a finite group, Z(G) = 1,M = ³D₄(q). If N(G) = N(M), then G M. (ref. [6])Theorem 3. (Wujie Shi) Let G be a finite group, M = ³D₄(q). If|G| = |M|, _e(G) = _e(M), then G M. (ref. [15])All notations are the same as in [2]. According to the classification theorem of finite simple groups, [12] and [13], we can list the order components of finite simple groups with nonconnected prime graphs in Tables 1-4 (ref. [5]).American Mathematics Society Classification 20D05 20D60The author is indebted to Fred and Barbara Kort Sino-Israel Postdoctoral Programme for supporting my post-doctoral position (1999.10-2000.10) at Bar-Ilan University, also to Emmy Noether Mathematics Institute and NSFC for partially financial support.     

Tables on fifth power residuacity

In this paper 2 ^p 1 (modq),q=10p+1,p 3 (mod 4),p andq prime, is expressed uniquely (except for changes in sign and interchange ofx, y) in the formq=w ²+25 (x ²+y ²)/2+125z ², 4wz=y ²–x ²–4xy, withw, x, y, z odd, forp<10⁵. For 10⁵<p<10⁶, allp such that 2 ^p 1 (mod 10p + 1),p 3 (mod 4),p and 10p + 1 prime, are listed.     

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     

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.     

Mixed nests

t-nests witht=((q+1)/2+i) are constructed usingi André nets and (q + 1)/2 regulus nets constructed via a group of order ((q + 1)/2)². The constructed planes obtained using these mixed nests are characterized by the existence of two symmetric homology groups of order (q + 1)/2.The research for this article was partially supported by FONDECYT. This work was done during visits to the University of Iowa in 1993 by the second author and to University of Chile in 1994 by the first author. The authors gratefully acknowledge the support of the Universities of Chile and Iowa.     

Blocking sets in PG(2, q n ) from cones of PG(2n, q)

Let Ω and be a subset of Σ = PG(2n−1,q) and a subset of PG(2n,q) respectively, with Σ ⊂ PG(2n,q) and . Denote by K the cone of vertex Ω and base and consider the point set B defined by