On the coexistence of conference matrices and near resolvable 2-(2k+1,k,k-1) designs.

DOI10.1016/J.JCTA.2005.05.005MaRDI QIDQ2490867zbMATH OpenOpenAlexWikidataFDO

Authors Malcolm Greig, Harri Haanpää, Petteri Kaski

Publication date 18 May 2006

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jcta.2005.05.005

zbMATH Keywords

near resolvable balanced incomplete block design

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)

Recommendations

• Existence results for near resolvable designs
• On automorphism groups of divisible designs: II: Group invariant generalized conference matrices
• Almost \(\alpha\)-resolvable and almost affine \(\alpha\)-resolvable designs
• Publication:4723750
• scientific article; zbMATH DE number 874488

Cites work

• scientific article; zbMATH DE number 3637895 (Why is no real title available?)
• scientific article; zbMATH DE number 874485 (Why is no real title available?)
• scientific article; zbMATH DE number 874553 (Why is no real title available?)
• scientific article; zbMATH DE number 874569 (Why is no real title available?)
• scientific article; zbMATH DE number 917328 (Why is no real title available?)
• scientific article; zbMATH DE number 3225111 (Why is no real title available?)
• Classification of Hadamard matrices of order 24 and 28
• Enumeration of all \((2k+1,k,k-1)\)-NRBIBDs for \(3\leq k\leq 13\)
• Orthogonal Matrices with Zero Diagonal. II
• Some Aspects of Weighing Designs
• Symmetric Conference Matrices of Order pq 2 + 1
• The near resolvable \(2\)-\((13,4,3)\) designs and thirteen-player whist tournaments

Cited in

(7)

• Conference matrices with maximum excess and two-intersection sets
• Decomposable super-simple NRBIBDs with block size 4 and index 6
• On automorphism groups of divisible designs: II: Group invariant generalized conference matrices
• Existence on splitting-balanced block designs with resolvability
• Systematic enumeration of definitive screening designs
• Constructing definitive screening designs using cyclic generators
• A classification criterion for definitive screening designs

Describes a project that uses

Uses Software

• nauty

This page was built for publication: On the coexistence of conference matrices and near resolvable \(2\)-\((2k+1,k,k-1)\) designs.

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