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