Orderly generation of half regular symmetric designs via Rahilly families of pre-difference sets
From MaRDI portal
Publication:1976883
DOI10.1007/BF01220293zbMath0965.05022MaRDI QIDQ1976883
Anton Betten, Alice C. Niemeyer, Priscila P. Alejandro
Publication date: 1 May 2001
Published in: Journal of Geometry (Search for Journal in Brave)
automorphism groups; half-regular symmetric designs; pre-difference sets; Rahilly families of groups; Rahilly family
05B05: Combinatorial aspects of block designs
05B10: Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.)
Cites Work
- Permutation group algorithms based on partitions. I: Theory and algorithms
- New symmetric designs from regular Hadamard matrices
- Orderly algorithms for graph generation
- Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item