Algorithms and complexity for counting configurations in Steiner triple systems

DOI10.1002/jcd.21839zbMath1529.05024arXiv2110.00320OpenAlexW3204254203MaRDI QIDQ6146212

Daniel Heinlein, Patric R. J. Östergård

Publication date: 5 February 2024

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2110.00320

zbMATH Keywords

algorithmcomputational complexitySteiner triple systemconfigurationsubsystem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Triple systems (05B07)

Cites Work

• On topological and geometric \((19_4)\) configurations
• Classification algorithms for codes and designs
• Properties of the Steiner triple systems of order 19
• Some results on quadrilaterals in Steiner triple systems
• Counting symmetric configurations \(v_3\)
• Maximal arcs, codes, and new links between projective planes of order 16
• The configuration polytope of ℓ-line configurations in Steiner triple systems
• Isomorph-Free Exhaustive Generation
• A small basis for four‐line configurations in steiner triple systems. Dedicated to the memory of gemma holly griggs
• LCL Problems on Grids
• On the n^{log n} isomorphism technique (A Preliminary Report)
• Counting configurations in designs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Algorithms and complexity for counting configurations in Steiner triple systems