On the coexistence of conference matrices and near resolvable 2-(2k+1,k,k-1) designs.
DOI10.1016/J.JCTA.2005.05.005zbMATH Open1090.05006OpenAlexW2012560944WikidataQ59411228 ScholiaQ59411228MaRDI QIDQ2490867FDOQ2490867
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
Recommendations
Combinatorial aspects of block designs (05B05) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Classification of Hadamard matrices of order 24 and 28
- Title not available (Why is that?)
- Orthogonal Matrices with Zero Diagonal. II
- Symmetric Conference Matrices of Order pq 2 + 1
- Title not available (Why is that?)
- Enumeration of all \((2k+1,k,k-1)\)-NRBIBDs for \(3\leq k\leq 13\)
- Some Aspects of Weighing Designs
- 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
Uses Software
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)
