𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A full classification of the complete k-arcs of PG(2,23) and PG(2,25)

✍ Scribed by K. Coolsaet; H. Sticker


Publisher
John Wiley and Sons
Year
2009
Tongue
English
Weight
174 KB
Volume
17
Category
Article
ISSN
1063-8539

No coin nor oath required. For personal study only.

✦ Synopsis


Abstract

A full classification (up to equivalence) of all complete k‐arcs in the Desarguesian projective planes of order 23 and 25 was obtained by computer. The algorithm used is an application of isomorph‐free backtracking using canonical augmentation, as introduced by McKay, which we have adapted to the case of subset generation in Desarguesian projective planes. We have applied two variants of the same algorithm, and both techniques yield exactly the same results. Earlier (partial) results by other authors on k‐arcs in PG(2, q) with qβ©½25, are reproduced by our programs. We describe those parts of the algorithms which are relevant to the particular problem of generating k‐arcs and which have made this project feasible. We also list the number of complete arcs in PG(2, 23) and PG(2, 25) according to size of the arc and type of the automorphism group. Explicit descriptions are given for the arcs with the larger automorphism groups. Β© 2009 Wiley Periodicals, Inc. J Combin Designs 17: 459–477, 2009


πŸ“œ SIMILAR VOLUMES


The complete k-arcs of PG(2, 27) and PG(
✍ Kris Coolsaet; Heide Sticker πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 167 KB

A full classification (up to equivalence) of all complete k-arcs in the Desarguesian projective planes of order 27 and 29 was obtained by computer. The resulting numbers of complete arcs are tabulated according to size of the arc and type of the automorphism group, and also according to the type of

The complete (k, 3)-arcs of PG(2,q), q≀1
✍ K. Coolsaet; H. Sticker πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 197 KB

## Abstract We have classified by computer the projectively distinct complete (**__k__**, **3**)‐arcs in **PG**(**2**, **__q__**), **__q__**≀**13**. The algorithm used is an application of isomorph‐free backtracking using canonical augmentation, an adaptation of our earlier algorithms for the gener

Types of superregular matrices and the n
✍ Gerzson KΓ©ri πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 182 KB

## Abstract Based on the classification of superregular matrices, the numbers of non‐equivalent __n__‐arcs and complete __n__‐arcs in PG(__r__, __q__) are determined (i) for 4 ≀ __q__ ≀ 19, 2 ≀ __r__ ≀ qβ€‰βˆ’β€‰2 and arbitrary __n__, (ii) for 23 ≀ __q__ ≀ 32, __r__ = 2 and __n__ β‰₯ qβ€‰βˆ’β€‰8<$>. The equivale