On the construction of [q 4 + q 2 − q, 5,q 4 − q 3 + q 2 − 2q; q]-codes meeting the Griesmer bound

It is unknown whether or not there exists an [87, 5, 57; 3]-code. Such a code would meet the Griesmer bound. The purpose of this paper is to give a constructive proof of the existence of [q ⁴ + q ² – q, 5, q ⁴ – q ³ + q ² – 2q; q]-codes for any prime power q 3. As a special case, it is shown that there exists an [87, 5, 57; 3]-code with weight enumerator 1 + 156z ³⁷ + 82z ⁶⁰ + 2z ⁶³ + 2z ⁷⁸. The new construction settles an open problem due to Hill and Newton [10].     

Error bounds for least squares approximation by polynomials

Let f ε Cⁿ⁺¹[−1, 1] and let H[f](x) be the nth degree weighted least squares polynomial approximation to f with respect to the orthonormal polynomials q_k associated with a distribution dα on [−1, 1]. It is shown that if q_n+1/q_n max(q_n+1(1)/q_n(1), −q_n+1(−1)/q_n(−1)), then f − H[f] f^{n + 1} · q_n+1/q_{n + 1}^{(n + 1)}, where · denotes the supremum norm. Furthermore, it is shown that in the case of Jacobi polynomials with distribution (1 − t)^α (1 + t)^β dt, α, β > −1, the condition on q_n+1/q_n is satisfied when either max(α,β) −1/2 or −1 < α = β < −1/2.     

A Recursive Construction for New Symmetric Designs

We introduce a recursive construction of regular Handamard matrices with row sum 2h for h=±3ⁿ. Whenever q=(2h – 1)² is a prime power, we construct, for every positive integer m, a symmetric designs with parameters (4h²(q^m+1 – 1)/(q – 1), (2h² – h)q^m, (h² – h)q^m).     

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.     

On the non-existence of linear codes attaining the Griesmer bound

A lower bound on the size of a set K in PG(3, q) satisfying for any plane of PG(3, q), q4 is given. It induces the non-existence of linear [n,4,n + 1 – q ²]-codes over GF(q) attaining the Griesmer bound for .     

On the sharpness of a theorem of B. segre

The theorem of B. Segre mentioned in the title states that a complete arc of PG(2,q),q even which is not a hyperoval consists of at mostq−√q+1 points. In the first part of our paper we prove this theorem to be sharp forq=s ² by constructing completeq−√q+1-arcs. Our construction is based on the cyclic partition of PG(2,q) into disjoint Baer-subplanes. (See Bruck [1]). In his paper [5] Kestenband constructed a class of (q−√q+1)-arcs but he did not prove their completeness. In the second part of our paper we discuss the connections between Kestenband’s and our constructions. We prove that these constructions result in isomorphic (q−√q+1)-arcs. The proof of this isomorphism is based on the existence of a traceorthogonal normal basis in GF(q ³) over GF(q), and on a representation of GF(q)³ in GF(q ³)³ indicated in Jamison [4].     

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.     

Lower bounds for the cardinality of minimal blocking sets in projective spaces

In this paper new lower bounds for the cardinality of minimal m-blocking sets are determined. Let r₂(q) be the number such that q+r₂(q)+1 is the cardinality of the smallest non-trivial line-blocking set in a plane of order q. If B is a minimal m-blocking set in PG(n,q) that contains at most q^m+q^m−1+…+q+1+r₂(q)·(∑_i=2m−n′^m−1qⁱ) points for an integer n′ satisfying mn′2m, then the dimension of B is at most n′. If the dimension of B is n′, then the following holds. The cardinality of B equals q^m+q^m−1+…+q+1+r₂(q)(∑_i=2m−n′^m−1qⁱ). For n′=m the set B is an m-dimensional subspace and for n′=m+1 the set B is a cone with an (m−2)-dimensional vertex over a non-trivial line-blocking set of cardinality q+r₂(q)+1 in a plane skew to the vertex. This result is due to Heim (Mitt. Math. Semin. Giessen 226 (1996), 4–82). For n′>m+1 and q not a prime the number q is a square and for q16 the set B is a Baer cone. If q is odd and |B|<q^m+q^m−1+…+q+1+r₂(q)(q^m−1+q^m−2), it follows from this result that the subspace generated by B has dimension at most m+1. Furthermore we prove that in this case, if , then B is an m-dimensional subspace or a cone with an (m−2)-dimensional vertex over a non-trivial line-blocking set of cardinality q+r₂(q)+1 in a plane skew to the vertex. For q=p^3h, p7 and q not a square we show this assertion for |B|q^m+q^m−1+…+q+1+q^2/3·(q^m−1+…+1).     

Asymptotic formulas for n-diameters of certain compacta in L2[0, 1]

In the current article the order of the Kolmogorov n-diameters of compacta, determined by the operatorsLy =p (x)dy/dx +q (x)y, Ly = [–d²/dx² +q (x) d/dx]^r y in L₂[0, 1] with a bound on the order of the error is studied and asymptotic formulas for d_n as a function of p(x), q(x), and r are derived.Translated from Matematicheskie Zametki, Vol. 20, No. 3, pp. 331–340, September, 1976.     

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).     

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     

Normal Spreads

In Dedicata 16 (1984), pp. 291–313, the representation of Desarguesian spreads of the projective space PG(2t – 1, q) into the Grassmannian of the subspaces of rank t of PG(2t – 1, q) has been studied. Using a similar idea, we prove here that a normal spread of PG(rt – 1,q) is represented on the Grassmannian of the subspaces of rank t of PG(rt – 1, q) by a cap V _{r, t} of PG(r ^t – 1, q), which is the GF(q)-scroll of a Segre variety product of t projective spaces of dimension (r – 1), and that the collineation group of PG(r ^t – 1, q) stabilizing V _{r, t} acts 2-transitively on V _{r, t} . In particular, we prove that V _{3, 2} is the union of q ² – q + 1 disjoint Veronese surfaces, and that a Hermitan curve of PG(2, q ²) is represented by a hyperplane section U of V _{3, 2}. For q 0,2 (mod 3) the algebraic variety U is the unitary ovoid of the hyperbolic quadric Q ⁺ (7, q) constructed by W. M. Kantor in Canad. J. Math., 5 (1982), 1195–1207. Finally we study a class of blocking sets, called linear, proving that many of the known examples of blocking sets are of this type, and we construct an example in PG(3, q ²). Moreover, a new example of minimal blocking set of the Desarguesian projective plane, which is linear, has been constructed by P. Polito and O. Polverino.     

On optimal simultaneous rational approximation to with being some kind of cubic algebraic function

It is shown that each rational approximant to (ω,ω²)^τ given by the Jacobi–Perron algorithm (JPA) or modified Jacobi–Perron algorithm (MJPA) is optimal, where ω is an algebraic function (a formal Laurent series over a finite field) satisfying ω³+kω-1=0 or ω³+kdω-d=0. A result similar to the main result of Ito et al. [On simultaneous approximation to (α,α²) with α³+kα-1=0, J. Number Theory 99 (2003) 255–283] is obtained.     

Properties of convergence for -Bernstein polynomials

In this paper, we discuss properties of the ω,q-Bernstein polynomials introduced by S. Lewanowicz and P. Woźny in [S. Lewanowicz, P. Woźny, Generalized Bernstein polynomials, BIT 44 (1) (2004) 63–78], where fC[0,1], ω,q>0, ω≠1,q⁻¹,…,q⁻ⁿ⁺¹. When ω=0, we recover the q-Bernstein polynomials introduced by [G.M. Phillips, Bernstein polynomials based on the q-integers, Ann. Numer. Math. 4 (1997) 511–518]; when q=1, we recover the classical Bernstein polynomials. We compute the second moment of , and demonstrate that if f is convex and ω,q(0,1) or (1,∞), then are monotonically decreasing in n for all x[0,1]. We prove that for ω(0,1), q_n(0,1], the sequence converges to f uniformly on [0,1] for each fC[0,1] if and only if lim_n→∞q_n=1. For fixed ω,q(0,1), we prove that the sequence converges for each fC[0,1] and obtain the estimates for the rate of convergence of by the modulus of continuity of f, and the estimates are sharp in the sense of order for Lipschitz continuous functions.     

Partial Ovoids in Classical Finite Polar Spaces

Ovoids in finite polar spaces are related to many other objects in finite geometries. In this article, we prove some new upper bounds for the size of partial ovoids in Q ^–(2n+1,q) and W(2n+ 1,q). Further, we give a combinatorial proof for the non-existence of ovoids of H(2n +1,q ²) for n>q ³.     

A Characterization of the Complement of a Hyperbolic Quadric in PG (3, q), for q Odd

The incidence structure NQ⁺(3, q) has points the points not on a non-degenerate hyperbolic quadric Q⁺(3, q) in PG(3, q), and its lines are the lines of PG(3, q) not containing a point of Q⁺(3, q). It is easy to show that NQ⁺(3, q) is a partial linear space of order (q, q(q−1)/2). If q is odd, then moreover NQ⁺(3, q) satisfies the property that for each non-incident point line pair (x,L), there are either (q−1)/2 or (q+1)/2 points incident with L that are collinear with x. A partial linear space of order (s, t) satisfying this property is called a ((q−1)/2,(q+1)/2)-geometry. In this paper, we will prove the following characterization of NQ⁺(3,q). Let S be a ((q−1)/2,(q+1)/2)-geometry fully embedded in PG(n, q), for q odd and q>3. Then S = NQ⁺(3, q).     

On the flocks of Q+(3,q)

A complete characterization of the flocks of Q⁺(3, q) is given. As an application, it follows that if q is odd, q11, 23, 59, there exist no maximal exterior sets of Q⁺ (2n–1, q) for n>2.Paper written with partial financial support of M.P.I.; the authors are members of G.N.S.A.G.A. of C.N.R.     

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).     

Representations for the first associated q-classical orthogonal polynomials

Let {p_k(x; q)} be any system of the q-classical orthogonal polynomials, and let be the corresponding weight function, satisfying the q-difference equation D_q(σ)=τ, where σ and τ are polynomials of degree at most 2 and exactly 1, respectively. Further, let {p_k⁽¹⁾(x;q)} be associated polynomials of the polynomials {p_k(x; q)}. Explicit forms of the coefficients b_n,k and c_n,k in the expansions

are given in terms of basic hypergeometric functions. Here _k(x) equals x^k if σ⁺(0)=0, or (x;q)_k if σ⁺(1)=0, where σ⁺(x)σ(x)+(q−1)xτ(x). The most important representatives of those two classes are the families of little q-Jacobi and big q-Jacobi polynomials, respectively.Writing the second-order nonhomogeneous q-difference equation satisfied by p_n−1⁽¹⁾(x;q) in a special form, recurrence relations (in k) for b_n,k and c_n,k are obtained in terms of σ and τ.     

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.