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
Partial geometric designs and difference families
Kathleen Nowak
- 01 Jan 2015
TL;DR: In this paper, the authors examined the difference families produced by different types of difference families for partial geometric designs and showed that every design has a difference family analogue, and they also showed that these designs provide the elegant solutions desired for applications.
6
Multilength Optical Orthogonal Codes: New Upper Bounds and Optimal Constructions
Xizhao Luo,Jianxing Yin,Fei Yue +2 more
TL;DR: In this paper, some new upper bounds on code size are derived under certain restrictions and a novel encoding approach is established for MLOOCs with λ =2 (the least value among the nontrivial intercross correlations).
6
Constructing Optimal $k$-Radius Sequences
TL;DR: This paper presents an explicit construction of “short” 2-radius sequences of the shortest possible length for some values of $k$ and $n, which allows us to find 2- radius sequences ofThe shortest possiblelength for all but very special values of £n.
6
The correlations of finite Desarguesian planes, Part IV: The classification (III)
TL;DR: In this paper, the authors discuss the singular case in which the square of a correlation does not fix any non-absolute point of that correlation and show that there is, up to isomorphisms, just one such correlation, and that it possesses q 2n+1 + 1 absolute points.
6
Perfect Difference Network for Network-on-Chip Architecture
M. A. Gaikwad,Rajendra M. Patrikar +1 more
- 01 Jan 2009
TL;DR: The possibility of achieving the energy-aware NoC architecture based on the mathematical notion of Perfect Difference sets (PDS) is discussed and the analytical energy model for NoC platform using Perfect Difference Network (PDN).