✦ LIBER ✦

The complete k-arcs of PG(2, 27) and PG(2, 29)

✍ Scribed by Kris Coolsaet; Heide Sticker

Publisher: John Wiley and Sons
Year: 2011
Tongue: English
Weight: 167 KB
Volume: 19
Category: Article
ISSN: 1063-8539
DOI: 10.1002/jcd.20261

No coin nor oath required. For personal study only.

✦ Synopsis

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 algebraic curve into which they can be embedded. For the arcs with the larger automorphism groups, explicit descriptions are given. The algorithm used for generating the arcs is an application of isomorph-free backtracking using canonical augmentation, an adaptation of an earlier algorithm by the authors. Part of the computer results can be generalized to other values of q: two families of arcs are presented (of size 12 and size 18) for which the symmetric group S 4 is a group of automorphisms. q 2010 Wiley

📜 SIMILAR VOLUMES

A full classification of the complete k-

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

✍ K. Coolsaet; H. Sticker 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 174 KB

## 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

The complete (k, 3)-arcs of PG(2,q), q≤1

The complete (k, 3)-arcs of PG(2,q), q≤13

✍ 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

Types of superregular matrices and the number of n-arcs and complete n-arcs in PG (r, q)

✍ 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

Correction to: Types of superregular mat

Correction to: Types of superregular matrices and the number of n-arcs and complete n-arcs in PG(r, q)

✍ Gerzson Kéri 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 50 KB

On 2-factorizations of the complete grap

On 2-factorizations of the complete graph: From the k-pyramidal to the universal property

✍ Simona Bonvicini; Giuseppe Mazzuoccolo; Gloria Rinaldi 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 180 KB 👁 1 views

## Abstract We consider 2‐factorizations of complete graphs that possess an automorphism group fixing __k__⩾0 vertices and acting sharply transitively on the others. We study the structures of such factorizations and consider the cases in which the group is either abelian or dihedral in some more d

Total Synthesis of the Proposed Azaspira

Total Synthesis of the Proposed Azaspiracid-1 Structure. Part 2. Coupling of the C1-C20, C21-C27, and C28-C40 Fragments and Completion of the Synthesis.

✍ K. C. Nicolaou; David Y.-K. Chen; Yiwei Li; Wenyuan Qian; Taotao Ling; Stepan Vy 📂 Article 📅 2003 🏛 John Wiley and Sons ⚖ 54 KB 👁 2 views