Open Access
2006 Construction of a point-cyclic resolution in $\mathrm{PG}(9,2)$
Michael Braun
Innov. Incidence Geom. 3: 33-50 (2006). DOI: 10.2140/iig.2006.3.33

Abstract

We consider resolutions of projective geometries over finite fields. A resolution is a set partition of the set of lines such that each part, which is called resolution class, is a set partition of the set of points. If a resolution has a cyclic automorphism of full length the resolution is said to be point-cyclic. The projective geometry PG ( 5 , 2 ) and PG ( 7 , 2 ) are known to be point-cyclically resolvable. We describe an algorithm to construct such point-cyclic resolutions and show that PG ( 9 , 2 ) has also a point-cyclic resolution.

Citation

Download Citation

Michael Braun. "Construction of a point-cyclic resolution in $\mathrm{PG}(9,2)$." Innov. Incidence Geom. 3 33 - 50, 2006. https://doi.org/10.2140/iig.2006.3.33

Information

Received: 6 October 2005; Accepted: 25 May 2006; Published: 2006
First available in Project Euclid: 28 February 2019

zbMATH: 1108.51011
MathSciNet: MR2267605
Digital Object Identifier: 10.2140/iig.2006.3.33

Subjects:
Primary: 51E20

Keywords: group of automorphisms , lattice point enumeration , point-cyclic , resolution

Rights: Copyright © 2006 Mathematical Sciences Publishers

MSP
Back to Top