How many s-subspaces must miss a point set in PG(d, q)

The following result is well-known for finite projective spaces. The smallest cardinality of a set of points of PG(n, q) with the property that every s-subspace has a point in the set is (q ^n+1-s - 1)/(q - 1). We solve in finite projective spaces PG(n, q) the following problem. Given integers s and b with 0 ≤ s ≤ n - 1 and 1 ≤ b ≤ (q ^n+1-s - 1)/(q - 1), what is the smallest number of s-subspaces that must miss a set of b points. If d is the smallest integer such that b ≤ (q ^d+1 - 1)/(q - 1), then we shall see that the smallest number is obtained only when the b points generate a subspace of dimension d. We then also determine the smallest number of s-subspaces that must miss a set of b points of PG(n, q) which do not lie together in a subspace of dimension d. The results are obtained by geometrical and combinatorial arguments that rely on a strong algebraic result for projective planes by T. Szőnyi and Z. Weiner.     

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

Minimal blocking sets of size 2p – 2 and 2p – 3 in PG(2, p), p prime and p > 5

A general construction of minimal blocking sets of size 2p – 3, where p is a prime and p ≡ 1 (mod 4), p > 5, and of size 2p – 2, where p is a prime and p ≡ 3 (mod 4), p > 5 in PG(2, p) is presented. These blocking sets are all of Rédei type.      

Extending MDS Codes

A q-ary (n, k)-MDS code, linear or not, satisfies n ≤ q + k − 1. A code meeting this bound is said to have maximum length. Using purely combinatorial methods we show that an MDS code with n = q + k − 2 can be uniquely extended to a maximum length code if and only if q is even. This result is best possible in the sense that there is, for example, a non-extendable 4-ary (5, 4)-MDS code. It may be that the proof of our result is as interesting as the result itself. We provide a simple necessary and sufficient condition for code extendability. In future work, this condition might be suitably modified to give an extendability condition for arbitrary (shorter) MDS codes.Received December 1, 2003     

Eigenvalues,geometric expanders,sorting in rounds,and ramsey theory

Expanding graphs are relevant to theoretical computer science in several ways. Here we show that the points versus hyperplanes incidence graphs of finite geometries form highly (nonlinear) expanding graphs with essentially the smallest possible number of edges. The expansion properties of the graphs are proved using the eigenvalues of their adjacency matrices. These graphs enable us to improve previous results on a parallel sorting problem that arises in structural modeling, by describing an explicit algorithm to sortn elements ink time units using parallel processors, where, e.g., α₂=7/4, α₃=8/5, α₄=26/17 and α₅=22/15. Our approach also yields several applications to Ramsey Theory and other extremal problems in combinatorics.     

A completion problem for finite affine planes

A partial affine plane (PAP) of ordern is ann ²-setS of points together with a collection ofn-subsets ofS called lines such that any two lines meet in at most one point. We obtain conditions under which a PAP with nearlyn ²+n lines can be completed to an affine plane by adding lines. In particular, we make use of Bruck’s completion condition for nets to show that certain PAP’s with at leastn ²+n−√n can be completed and that forn≠3 any PAP withn ²+n−2 lines can be completed.     

On an application of Hall's representatives theorem to a finite geometry problem

It is well-known thatn points not belonging to a hyperplane determine at leastn hyperplanes. The possible configurations of hyperplanes in the case when the number of hyperplanes is equal ton are known, too. In this paper we obtain these results by means of Hall's representatives theorem. The setting is that of a finite geometry.     

The Radon-Nikodym Property for Tensor Products of Banach Lattices II

Let φ be an Orlicz function that has a complementary function φ* and let ℓ_φ be an Orlicz sequence space. We prove two results in this paper. Result 1: , the Fremlin projective tensor product of ℓ_φ with a Banach lattice X, has the Radon-Nikodym property if and only if both ℓ_φ and X have the Radon-Nikodym property. Result 2: , the Wittstock injective tensor product of ℓ_φ with a Banach lattice X, has the Radon-Nikodym property if and only if both ℓ_φ and X have the Radon-Nikodym property and each positive continuous linear operator from h_φ* to X is compact. We dedicate this paper to the memory of H. H. Schaefer The first-named author gratefully acknowledges support from the Faculty Research Program of the University of Mississippi in summer 2004.     

A remark on the conjecture of Erdös, Faber and Lovász

The celebrated Erd?s, Faber and Lovász Conjecture may be stated as follows: Any linear hypergraph on ν points has chromatic index at most ν. We show that the conjecture is equivalent to the following assumption: For any graph , where ν(G) denotes the linear intersection number and χ(G) denotes the chromatic number of G. As we will see for any graph G = (V, E), where denotes the complement of G. Hence, at least G or fulfills the conjecture.      

Blocking Subspaces By Lines In PG(<Emphasis Type="Italic">n,q</Emphasis>)

This paper studies the cardinality of a smallest set of t-subspaces of the finite projective spaces PG(n, q) such that every s-subspace is incident with at least one element of , where 0 t < s n. This is a very difficult problem and the solution is known only for very few families of triples (s, t, n). When the answer is known, the corresponding blocking configurations usually are partitions of a subspace of PG(n, q) by subspaces of dimension t. One of the exceptions is the solution in the case t = 1 and n = 2s. In this paper, we solve the case when t = 1 and 2s < n 3s-3 and q is sufficiently large.     

Blocking Sets Of External Lines To A Conic In PG(2,q), q ODD

We determine all point-sets of minimum size in PG(2,q), q odd that meet every external line to a conic in PG(2,q). The proof uses a result on the linear system of polynomials vanishing at every internal point to the conic and a corollary to the classification theorem of all subgroups of PGL(2,q). * Research supported by the Italian Ministry MURST, Strutture geometriche, combinatoria e loro applicazioni and by the Hungarian-Italian Intergovernemental project “Algebraic and Geometric Structures”.     

Computer search in projective planes for the sizes of complete arcs

The spectrum of possible sizes k of complete k-arcs in finite projective planes PG(2, q) is investigated by computer search. Backtracking algorithms that try to construct complete arcs joining the orbits of some subgroup of collineation group PΓ L (3, q) and randomized greedy algorithms are applied. New upper bounds on the smallest size of a complete arc are given for q = 41, 43, 47, 49, 53, 59, 64, 71 ≤ q ≤ 809, q ≠ 529, 625, 729, and q = 821. New lower bounds on the second largest size of a complete arc are given for q = 31, 41, 43, 47, 53, 125. Also, many new sizes of complete arcs are obtained for 31 ≤ q ≤ 167.     

Jordan Homomorphisms and Harmonic Mappings

 We show that each Jordan homomorphism R → R′ of rings gives rise to a harmonic mapping of one connected component of the projective line over R into the projective line over R′. If there is more than one connected component then this mapping can be extended in various ways to a harmonic mapping which is defined on the entire projective line over R. Received December 7, 2001; in revised form April 28, 2002 Published online January 7, 2003     

Maximum set of edges no two covered by a clique

Leth(G) be the largest number of edges of the graphG. no two of which are contained in the same clique. ForG without isolated vertices it is proved that ifh(G)≦5, thenχ( )≦h(G), but ifh(G)=6 thenχ( ) can be arbitrarily large.     

On the algorithmic complexity of coloring simple hypergraphs and steiner triple systems

In this paper we establish that decidingt-colorability for a simplek-graph whent≧3,k≧3 is NP-complete. Next, we establish that if there is a polynomial time algorithm for finding the chromatic number of a Steiner Triple system then there exists a polynomial time “approximation” algorithm for the chromatic number of simple 3-graphs. Finally, we show that the existence of such an approximation algorithm would imply that P=NP. Dedicated to Paul Erdős on his seventieth birthday     

Small semiovals in PG(2, q)

A semioval in a projective plane is a nonempty subset S of points with the property that for every point P ∈ S there exists a unique line ℓ such that . It is known that and both bounds are sharp. We say that S is a small semioval in if . Dover [5] proved that if S has a (q − 1)-secant, then , thus S is small, and if S has more than one (q − 1)-secant, then S can be obtained from a vertexless triangle by removing some subset of points from one side. We generalize this result and prove that if there exist integers 1 ≤ t and − 1 ≤ k such that and S has a (q − t)-secant, then the tangent lines at the points of the (q − t)-secant are concurrent. Specially when t = 1 then S can be obtained from a vertexless triangle by removing some subset of points from one side. The research was supported by the Italian-Hungarian Intergovernmental Scientific and Technological Cooperation Project, Grant No. I-66/99 and by the Hungarian National Foundation for Scientific Research, Grant Nos. T 043556 and T 043758.     

Tactical decompositions and some configurationsv 4

The study of configurations or — more generally — finite incidence geometries is best accomplished by taking into account also their automorphism groups. These groups act on the geometry and in particular on points, blocks, flags and even anti-flags. The orbits of these groups lead to tactical decompositions of the incidence matrices of the geometries or of related geometries. We describe the general procedure and use these decompositions to study symmetric configurationsv ₄ for smallv. Tactical decompositions have also been used to construct all linear spaces on 12 points [2] and all proper linear spaces on 17 points [3].     

The Radon–Nikodym Property for Tensor Products of Banach Lattices

Let 1 ≤ p < ∞. We show that , the Fremlin projective tensor product of ℓ_p with a Banach lattice X, has the Radon–Nikodym property if and only if X has the Radon–Nikodym property; and that , the Wittstock injective tensor product of ℓ_p with a Banach lattice X, has the Radon–Nikodym property if and only if X has the Radon–Nikodym property and each positive operator from ℓ_p' to X is compact, where 1/p +1/p'= 1 and let ℓ_p' = c₀ if p = 1. The author gratefully acknowledges support from the Office of Naval Research Grant # N00014-03-1-0621