Enumeration of resolvable 2‐(10, 5, 16) and 3‐(10, 5, 6) designs

DOI10.1002/JCD.20032zbMATH Open1059.05017OpenAlexW2124329301MaRDI QIDQ4667828FDOQ4667828

Luis B. Morales, Carlos Velarde

Publication date: 21 April 2005

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

Full work available at URL: https://doi.org/10.1002/jcd.20032

zbMATH Keywords

parallel classresolvable \(t\)-designbacktrack search with isomorph rejection

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of block designs (05B05)

Cited In (5)

• Enumeration of 2-(9, 3, \({\lambda}\)) designs and their resolutions
• On the Enumeration of ‐Optimal and Minimax‐Optimal k‐Circulant Supersaturated Designs
• The maximum number of columns in E(s2) $\,E({s}^{2})$‐optimal supersaturated designs with 16 rows and smax=4 ${s}_{{\rm{\max }}}=4$ is 60
• On \(\mathrm{E}(s^2)\)-optimal and minimax-optimal supersaturated designs with 20 rows and 76 columns
• Isomorphism and Invariants of Parallelisms of Projective Spaces

Uses Software

• nauty

   Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Enumeration of 2-(9, 3, \({\lambda}\)) designs and their resolutions 👍 👎
• Title not available (Why is that?) 👍 👎
• A census of \(t\)-\((t+8,t+2,4)4\) designs, \(2\leq t\leq 4\) 👍 👎

This page was built for publication: Enumeration of resolvable 2‐(10, 5, 16) and 3‐(10, 5, 6) designs

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