Use this URL to cite or link to this record in EThOS: http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.694589
Title: Bounds for complete arcs in finite projective planes
Author: Pichanick, E. V. D.
ISNI:       0000 0004 5992 2181
Awarding Body: University of Sussex
Current Institution: University of Sussex
Date of Award: 2016
Availability of Full Text:
Access from EThOS:
Full text unavailable from EThOS. Please try the link below.
Access from Institution:
Abstract:
This thesis uses algebraic and combinatorial methods to study subsets of the Desarguesian plane IIq = PG(2, q). Emphasis, in particular, is given to complete (k, n)-arcs and plane projective curves. Known Diophantine equations for subsets of PG(2, q), no more than n of which are collinear, have been applied to k-arcs of arbitrary degree. This yields a new lower bound for complete (k, n)-arcs in PG(2, q) and is a generalization of a classical result of Barlotti. The bound is one of few known results for complete arcs of arbitrary degree and establishes new restrictions upon the parameters of associated projective codes. New results governing the relationship between (k, 3)-arcs and blocking sets are also provided. Here, a sufficient condition ensuring that a blocking set is induced by a complete (k, 3)-arc in the dual plane q is established and shown to complement existing knowledge of relationships between k-arcs and blocking sets. Combinatorial techniques analyzing (k, 3)-arcs in suitable planes are then introduced. Utilizing the numeric properties of non-singular cubic curves, plane (k, 3)-arcs satisfying prescribed incidence conditions are shown not to attain existing upper bounds. The relative sizes of (k, 3)-arcs and non-singular cubic curves are also considered. It is conjectured that m3(2, q), the size of the largest complete (k, 3)-arc in PG(2, q), exceeds the number of rational points on an elliptic curve. Here, a sufficient condition for its positive resolution is given using combinatorial analysis. Exploiting its structure as a (k, 3)-arc, the elliptic curve is then considered as a method of constructing cubic arcs and results governing completeness are established. Finally, classical theorems relating the order of the plane q to the existence of an elliptic curve with a specified number of rational points are used to extend theoretical results providing upper bounds to t3(2, q), the size of the smallest possible complete (k, 3)-arc in PG(2, q).
Supervisor: Not available Sponsor: Not available
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID: uk.bl.ethos.694589  DOI: Not available
Keywords: QA0440 Geometry. Trigonometry. Topology
Share: