On the Structure oft-Designs

DOI10.1137/0601002zbMATH Open0499.05012OpenAlexW2049120748MaRDI QIDQ3964579FDOQ3964579

Authors Shuo-Yen Robert Li, Ron Graham, Wen-Ching Winnie Li 

Publication date 1980

Published in SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/a0ec8249ecd21f58ce8fa5ece636c73e03ba5120

zbMATH Keywords

null-designsZ-modulesintegral t-designs

Mathematics Subject Classification ID

Statistical block designs (62K10) Combinatorial aspects of block designs (05B05) Representation theory of associative rings and algebras (16Gxx)

Cites work

• scientific article; zbMATH DE number 3448595 (Why is no real title available?)
• scientific article; zbMATH DE number 3255204 (Why is no real title available?)
• On t-designs
• On theory and applications of BIB designs with repeated blocks
• The module structure of integral designs

Cited in

(46)

• Construction of BIB designs with various support sizes - with special emphasis for \(v=8\) and \(k=4\)
• Eigenfunctions and minimum 1-perfect bitrades in the Hamming graph
• A prospect for a general method of constructing \(t\)-designs
• Inclusion matrices for rainbow subsets
• On the number of sets in a null t-design
• On the bases of trades
• The \(k\)-orbit reconstruction and the orbit algebra
• On the vector space of 0-configurations
• An algorithn for generating a basis of the trades on t-designs
• Kernels of modular inclusion maps
• Linear dependencies among subsets of a finite set
• More on the Wilson \(W_{tk}(v)\) matrices
• The Goldman-Rota identity and the Grassmann scheme
• On the inclusion matrix \(W_{23}(v)\)
• Some aspects of groups acting on finite posets
• Rank of inclusion matrices and modular representation theory
• On functions of strength t
• The vector space generated by permutations of a trade or a design
• Reconstructing graphs from their k-edge deleted subgraphs
• Minimal null designs of subspace lattices over finite fields
• Signature theory in holographic algorithms
• Independence numbers of graphs and generators of ideals
• Studying designs via multisets
• An extremal problem for Graham-Rothschild parameter words
• Classification of some large sets and designs
• Some approaches for solving the general (\(t,k\))-design existence problem and other related problems
• Diagonal forms of incidence matrices associated with \(t\)-uniform hypergraphs
• On trades and designs
• Intersection matrices revisited
• Cohomological Aspects of Hypergraphs
• On the spectrum of \([v,k,t]\) trades
• Diagonal forms for incidence matrices and zero-sum Ramsey theory
• Tags on subsets
• Recent progress in algebraic design theory
• A note on the rank of inclusion matrices
• Colorings and orientations of graphs
• Polytopes of roots of type A_N
• Incidence Matrices of Subsets—A Rank Formula
• On the structure of (v,k,t) trades
• Some new 6-(14, 7, 4) designs
• Complete designs with blocks of maximal multiplicity
• Intersection theorems and mod \(p\) rank of inclusion matrices
• A computer algorithm for generating 3-designs by the method of trade off
• Holographic algorithms: from art to science
• Finite Gel'fand pairs and their applications to probability and statistics
• A new proof of a classical theorem in design theory

This page was built for publication: On the Structure oft-Designs

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