On Representing Sylvester-Gallai Designs.
It is shown that the maximum size of a set of vectors of a -dimensional vector space over , with the property that every subset of size is a basis, is at most , if , and at most , if , where and is prime. Moreover, for , the sets of maximum size are classified, generalising Beniamino Segre’s “arc is a conic” theorem. These results have various implications. One such implication is that a matrix, with and entries from , has columns which are linearly dependent. Another is...
The paper reports the results of a search for pairs of groups of order that can be placed in the distance for the case when . The constructions that are used are of the general character and some of their properties are discussed as well.
In this paper we examine discrete functions that depend on their variables in a particular way, namely the H-functions. The results obtained in this work make the “construction” of these functions possible. H-functions are generalized, as well as their matrix representation by Latin hypercubes.
In his book on unsolved problems in number theory [1] R. K. Guy asks whether for every natural l there exists with the following property: for every and any n elements of a group such that the product of any two of them is different from the unit element of the group, there exist l of the such that for and . In this note we answer this question in the affirmative in the first non-trivial case when l=3 and the group is abelian, proving the following result.