On (q 2 + q + 2, q + 2)-arcs in the Projective Plane PG(2, q)

A (k,n)-arc in PG(2,q) is usually defined to be a set of k points in the plane such that some line meets in n points but such that no line meets in more than n points. There is an extensive literature on the topic of (k,n)-arcs. Here we keep the same definition but allow to be a multiset, that is, permit to contain multiple points. The case k=q ²+q+2 is of interest because it is the first value of k for which a (k,n)-arc must be a multiset. The problem of classifying (q ²+q+2,q+2)-arcs is of importance in coding theory, since it is equivalent to classifying 3-dimensional q-ary error-correcting codes of length q ²+q+2 and minimum distance q ². Indeed, it was the coding theory problem which provided the initial motivation for our study. It turns out that such arcs are surprisingly rich in geometric structure. Here we construct several families of (q ²+q+2,q+2)-arcs as well as obtain some bounds and non-existence results. A complete classification of such arcs seems to be a difficult problem.     

On schematic orthogonal arraysOA(q t,k, q,t)

Am × k matrixA, with entries from a set ofq 2 elements, is called an orthogonal arrayOA(m, k, q, t) (t 2) if eachm × t submatrix ofA contains all possible 1 ×t row vectors with the same frequency(m = q ^t ). We call the array schematic if the set of rows ofA forms an association scheme with the relations determined by the Hamming distance. In this paper we determine the schematic orthogonal arraysOA(q ^t ,k, q, t) with2t – 1 > k.     

Partial t-Spreads in PG(2t+1,q)

This article first of all discusses the problem of the cardinality of maximal partial spreads in PG(3,q), q square, q>4. Let r be an integer such that 2rq+1 and such that every blocking set of PG(2,q) with at most q+r points contains a Baer subplane. If S is a maximal partial spread of PG(3,q) with q ²-1-r lines, then r=s( +1) for an integer s2 and the set of points of PG(3,q) not covered byS is the disjoint union of s Baer subgeometriesPG(3, ). We also discuss maximal partial spreads in PG(3,p ³), p=p ₀ ^h , p ₀ prime, p ₀ 5, h 1, p 5. We show that if p is non-square, then the minimal possible deficiency of such a spread is equal to p ²+p+1, and that if such a maximal partial spread exists, then the set of points of PG(3,p ³) not covered by the lines of the spread is a projected subgeometryPG(5,p) in PG(3,p ³). In PG(3,p ³),p square, for maximal partial spreads of deficiency p ²+p+1, the combined results from the preceding two cases occur. In the final section, we discuss t-spreads in PG(2t+1,q), q square or q a non-square cube power. In the former case, we show that for small deficiencies , the set of holes is a disjoint union of subgeometries PG(2t+1, ), which implies that 0 (mod +1) and, when (2t+1)( -1) <q-1, that 2( +1). In the latter case, the set of holes is the disjoint union of projected subgeometries PG(3t+2, ) and this implies 0 (mod q ^2/3+q ^1/3+1). A more general result is also presented.     

On the Action of the Groups GL(n+1, q), PGL(n + 1, q), SL(n + 1, q) and PSL(n + 1, q) on PG(n, q t)

Let q be a prime power and let n ≥ 0, t ≥ 1 be integers. We determine the sizes of the point orbits of each of the groups GL(n + 1, q), PGL(n + 1, q), SL(n + 1, q) and PSL(n + 1, q) acting on PG(n, q ^t) and for each of these sizes (and groups) we determine the exact number of point orbits of this size.     

On (q 2 + q + 1)-sets of class [1, m,n]2 in PG(3, q)

A characterization of cones in PG(3, q) as sets of points of PG(3, q) of size q ² + q + 1 projecting from a point V a set of q + 1 points of a plane of PG(3, q) and with three intersection numbers with respect to the planes is given.     

Ensembles de classe (0, 1, q,q + 1) de PG (d,q)

We determine all sets Q of points of any finite dimensional protective space P such that each line intersecting Q in more than one point, either is contained in Q or contains exactly one point not on Q. If P is a finite protective space of order q, these sets are the so called sets of class (0, 1, q, q + 1).     

Nonisomorphic solutions of (4t+3, 2t+1, t) designs

A technique has been developed to get a large number of nonisomorphic solutions of a (4t+3, 2t+1, t) design. Some results are proved on the conjecture for Hadamard matrices.     

Geometric and pseudo-geometric graphs (q2+1,q+1,1)

Let ₀ be a particular vertex of a strongly regular graph G with parameters v, n₁, p ₁₁ ¹ p ₁₁ ¹ . Let A be the adjacency matrix of G, and B the submatrix of A whose rows correspond to the vertices of G adjacent to ₀ and whose columns correspond to the vertices of G nonadjacent to ₀. Then the designD(₀) with incidence matrix B has the parameters v=n₁ b=v-n₁–1, r=n₁–p^11/1–1, k = p ₁₁ ² . In this paper we study the connection between G andD(₀) when the graph G is geometric or pseudo-geometric (q²+1,q+1,1).The research of this author was supported by the National Science Foundation Grant No. GP 23520 and the U.S. Air Force Office of Scientific Research under Grant No. AFOSR-68-1415C.The research of this author was supported by the National Science Foundation Grant No. GP 17172, while he was visiting professor at Stanford University.     

On the equationx t=x t+q in categories

We will show that a categoryC divides a monoid that satisfies the equationx ^t=x ^t+q iff each monoid inC satisfies the same equation.     

On the Embedding of (k,p)-Arcs is Maximal Arcs

Our main result is that a (k,p)-arc in PG (2,q),q = p ^h , with k qp - q + p - can be extended to a maximal arc. Combining this result with the recent Ball, Blokhuis, Mazzocca theorem about the non-existence of maximal arcs for p > 2, it gives an upper bound for the size of a (k,p)-arc. The method can be regarded as a generalization of B. Segre's method for proving similar embeddability theorems for k-arcs (that is when n= 2). It is based on associating an algebraic envelope containing the short lines to the (k,p)-arc. However, the construction of the envelope is independent of Segre's method using the generalization of Menelaus' theorem.     

On nets of orderq 2 and degreeq+1 admitting GL(2,q)

In this paper we consider finite nets of orderq ² and degreeq + 1 which admit GL(2,q). Our main result says that if a net of orderq ² and degreeq + 1 admits a collineation group with a point-regular normal subgroupT such that /T GL(2,q), then is isomorphic to a regulus net, a twisted regulus net, a Hering net, or . Except in the last one, each of them corresponds to a surface in PG(3,q) obtained from a homogeneous polynomial in two variables.     

Continuability,boundness and asymptotic behavior of solutions ofx″ +q(t)f(x)=r(t)

Summary In addition to obtaining sufficient conditions for continuability of solutions of x″ + q(t)f(x)=r(t), some sufficient conditions and some necessary and sufficient conditions for boundedness are obtained. The asymptotic behavior of solutions is studied through examination of r(t)/q(t) as t → ∞. Supported by Mississippi State University Biological and Physical Sciences Research Institute. Entrata in Redazione il 6 febbraio 1973.     

中立型方程x(t)+cx(t-ㄒ)+ax(t)+bx(t-ㄒ)=0零解渐近稳定的代数判据

本文建立了方程ｘ（ｔ）＋ｃｔ（ｔ－ｔ）＋ａｘ（ｔ）＋ｂｘ（ｔ－ｔ）＝０零解渐近稳定的充要条件,给出了其零解渐近稳定的代数判据,同时纠正了文［２］中出现的错误．     

Quadriques hermitiennes et ensembles de classe (0, 1, n,q+1) de PG(d,q)

This paper is a first step in the characterization of finite Hermitian quadrics as sets of class (0, 1, n, q+1) in PG(d, q).