A theorem in finite projective geometry and some applications to number theory
TL;DR: In this article, it was shown that there is always at least one collineation of period q with respect to any point in the projective plane PG(2, pn) for every prime p and positive integer n.
read more
Abstract: A point in a finite projective plane PG(2, pn), may be denoted by the symbol (Xl, X2, X3), where the coordinates x1, X2, X3 are marks of a Galois field of order pn, GF(pn). The symbol (0, 0, 0) is excluded, and if k is a non-zero mark of the GF(pn), the symbols (X1, X2, X3) and (kxl, kx2, kx3) are to be thought of as the same point. The totality of points whose coordinates satisfy the equation ulxl+u2x2+U3x3 = 0, where u1, U2, u3 are marks of the GF(pn), not all zero, is called a line. The plane then consists of p2n +pn + 1 = q points and q lines; each line contains pn+1 points.t A finite projective plane, PG(2, pn), defined in this way is Pascalian and Desarguesian; it exists for every prime p and positive integer n, and there is only one such PG(2, pn) for a given p and n (VB, p. 247, VY, p. 151). Let Ao be a point of a given PG(2, pn), and let C be a collineation of the points of the plane. (A collineation is a 1-1 transformation carrying points into points and lines into lines.) Suppose C carries Ao into Al, A1 into A2,... , Ak into Ao; or, denoting the product C C by C2, C. C2 by C3, etc., we have C(Ao) =A1, C2(Ao) =A2, . . , Ck(A o) =A o. If k is the smallest positive integer for which C k(A o) =Ao, we call k the period of C with respect to the point A o. If the period of a collineation C with respect to a point Ao is q (=p2n+pn+l), then the period of C with respect to any point in the plane is q, and in this case we will call C simply a collineation of period q. We prove in the first theorem that there is always at least one collineation of period q, and from it we derive some results of interest in finite geometry and number theory. Let
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Composition theorems for difference families and regular planes
TL;DR: Two composition theorems are proved that yield the existence of new (ordinary) difference families and thus of new block designs with a point regular abelian automorphism group.
34
Computing runs on a general alphabet
TL;DR: In this article, a RAM algorithm was proposed to find all runs of a given string of length n over a general ordered alphabet in O( n log 2 3? n ) time and linear space.
Recent Results on Difference Sets with Classical Parameters
Qing Xiang
- 01 Jan 1999
TL;DR: In this article, the authors survey recent results on cyclic difference sets with classical parameters and discuss constructions of cyclic Difference Sets from hyperovals and related 2-rank results.
33
Noncoherent Spectral/Spatial OCDMA System Using Two-Dimensional Hybrid Codes
TL;DR: A newly constructed two-dimensional hybrid codes (2-D hybrid codes) and the corresponding system architecture for a spectral/spatial optical code division multiple access (OCDMA) system that can suppress the phase-induced intensity noise and has the multiuser interference cancellation property.
33
Sets of Integers Whose Subsets Have Distinct Sums
TL;DR: In this paper, a study on sets of positive integers whose subsets have distinct sums is presented, and several theorems and lemmas are given for m = k + 2 when x = 2 k.
33