Please use this identifier to cite or link to this item: http://hdl.handle.net/10525/347

 Title: Algorithms for Finding Unitals and Maximal Arcs in Projective Planes of Order 16 Authors: Stoichev, Stoicho Keywords: UnitalMaximal ArcProjective PlaneGraph IsomorphismGraph Automorphism GroupAlgorithm Issue Date: 2007 Publisher: Institute of Mathematics and Informatics Bulgarian Academy of Sciences Citation: Serdica Journal of Computing, Vol. 1, No 3, (2007), 279p-292p Abstract: Two heuristic algorithms (M65 and M52) for finding respectively unitals and maximal arcs in projective planes of order 16 are described. The exact algorithms based on exhaustive search are impractical because of the combinatorial explosion (huge number of combinations to be checked). Algorithms M65 and M52 use unions of orbits of di erent subgroups of the automorphism group of the 273x273 bipartite graph of the projective plane. Two very efficient algorithms (developed by the author and not described here) are used in M65 and M52: (i) algorithm VSEPARN for computing the generators, orbits and order of the graph automorphism group; (ii) graph isomorphism algorithm derived from VSEPARN. Four properties are proved and used to speed up the algorithms M65 and M52. The results of these algorithms are published. After changing only the parameters of these algorithms they can be used for determining unitals in projective planes of different orders. Description: The paper has been presented at the International Conference Pioneers of Bulgarian Mathematics, Dedicated to Nikola Obreshkoff and Lubomir Tschakalo ff , Sofia, July, 2006. URI: http://hdl.handle.net/10525/347 ISSN: 1312-6555 Appears in Collections: Volume 1 Number 3

Files in This Item:

File Description SizeFormat
sjc037-vol1-num3-2007.pdf179.53 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 DSpace Software Copyright © 2002-2009  The DSpace Foundation - Feedback