On the Structure oft-Designs

From MaRDI portal
Revision as of 00:11, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3964579

DOI10.1137/0601002zbMath0499.05012OpenAlexW2049120748MaRDI QIDQ3964579

Shuo-Yen Robert Li, Wen-Ch'ing Winnie Li, Ronald L. Graham

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




Related Items (45)

On the structure of (v,k,t) tradesReconstructing graphs from their k-edge deleted subgraphsIncidence Matrices of Subsets—A Rank FormulaPolytopes of roots of type ANIntersection Matrices RevisitedOn trades and designsOn the bases of tradesKernels of modular inclusion mapsSome approaches for solving the general (\(t,k\))-design existence problem and other related problemsHolographic algorithms: from art to scienceThe Goldman-Rota identity and the Grassmann schemeMore on the Wilson \(W_{tk}(v)\) matricesOn the inclusion matrix \(W_{23}(v)\)Inclusion matrices for rainbow subsetsA note on the rank of inclusion matricesSignature theory in holographic algorithmsSome aspects of groups acting on finite posetsComplete designs with blocks of maximal multiplicityEigenfunctions and minimum 1-perfect bitrades in the Hamming graphRank of inclusion matrices and modular representation theoryClassification of some large sets and designsFinite Gel'fand pairs and their applications to probability and statisticsAn algorithn for generating a basis of the trades on t-designsColorings and orientations of graphsThe \(k\)-orbit reconstruction and the orbit algebraStudying designs via multisetsSome new 6-(14, 7, 4) designsA new proof of a classical theorem in design theoryA prospect for a general method of constructing \(t\)-designsUnnamed ItemTags on subsetsIndependence numbers of graphs and generators of idealsDiagonal forms of incidence matrices associated with \(t\)-uniform hypergraphsCohomological Aspects of HypergraphsMinimal null designs of subspace lattices over finite fieldsIntersection theorems and mod \(p\) rank of inclusion matricesA computer algorithm for generating 3-designs by the method of trade offOn the number of sets in a null t-designRecent progress in algebraic design theoryOn the vector space of 0-configurationsOn functions of strength tLinear dependencies among subsets of a finite setOn the spectrum of \([v,k,t\) trades] ⋮ Construction of BIB designs with various support sizes - with special emphasis for \(v=8\) and \(k=4\)An extremal problem for Graham-Rothschild parameter words




Cites Work




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