An orderly algorithm and some applications in finite geometry

DOI10.1016/S0012-365X(97)00167-2zbMath0956.68148MaRDI QIDQ1584240

Gordon F. Royle

Publication date: 2 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

combinatorial structures

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial structures in finite projective spaces (51E20)

Related Items (17)

Twisted hyperbolic flocks ⋮ Nonexistence Certificates for Ovals in a Projective Plane of Order Ten ⋮ Efficient exhaustive listings of reversible one dimensional cellular automata ⋮ Complete arcs in \(PG(2,25)\): The spectrum of the sizes and the classification of the smallest complete arcs ⋮ On the Structure of Semiovals of Small Size ⋮ Orderly algorithm to enumerate central groupoids and their graphs ⋮ A census of small transitive groups and vertex-transitive graphs ⋮ On the minimum size of complete arcs and minimal saturating sets in projective planes ⋮ Matroids with nine elements ⋮ Flocks and partial flocks of quadrics: A survey ⋮ A computer-assisted proof of the uniqueness of the Perkel graph ⋮ Classification and constructions of complete caps in binary spaces ⋮ Maximal (\(n\),3)-arcs in PG(2,13) ⋮ On the binary projective codes with dimension 6 ⋮ Maximal integral point sets in affine planes over finite fields ⋮ Computer search for small complete caps ⋮ Twisted quadrics and \(\alpha\)-flocks

Uses Software

• nauty

Cites Work

• On the flocks of \(Q^+(3,q)\)
• Conical flocks, partial flocks, derivation, and generalized quadrangles
• The translation planes of order twenty-five
• A class of translation planes
• Flocks in \(\mathrm{PG}(3,q)\)
• The translation planes of order 49
• On hyperovals in small projective planes
• Flocks and ovals
• Derivation of Flocks of Quadratic Cones
• Orderly algorithms for graph generation
• Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations
• Isomorph-Free Exhaustive Generation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An orderly algorithm and some applications in finite geometry