Enumerating set orbits.

MaRDI QIDQ3656464zbMATH OpenFDO

Authors Christian Pech, Sven Reichard

Publication date 13 January 2010

zbMATH Keywords

computer algebra packagesfusions of coherent configurationsgeneralized hexagonsgeneralized quadranglesincidence structuresorderly generationSchur ringsset orbitsspreadsSteiner triple systems

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Association schemes, strongly regular graphs (05E30) Combinatorial geometries and geometric closure systems (51D20) General block designs in finite geometry (51E05) Generalized quadrangles and generalized polygons in finite geometry (51E12)

Recommendations

• Algorithmic Recognition of Group Actions on Orbitals
• Finding the smallest image of a set
• How fast can we compute orbits of groups?
• Permutation group algorithms based on partitions. I: Theory and algorithms
• scientific article; zbMATH DE number 475368

Cited in

(10)

• How fast can we compute orbits of groups?
• There is no McLaughlin geometry
• Minimal and canonical images
• Schur rings over the elementary abelian group of order 64
• Which sequences are orbits?
• Orbits onn-Tuples
• Unbounded Orbits and Binary Digits
• Enumerating Large Orbits and Direct Condensation
• On generalized hexagons of order \((3, t)\) and \((4, t)\) containing a subhexagon
• Infinite families of directed strongly regular graphs using equitable partitions

Describes a project that uses

Uses Software

• GAP

This page was built for publication: Enumerating set orbits.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3656464)