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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Innovations in Incidence Geometry: Algebraic, Topological and Combinatorial
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
