Counting configurations in designs (Q5953380)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Counting configurations in designs |
scientific article; zbMATH DE number 1694174
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting configurations in designs |
scientific article; zbMATH DE number 1694174 |
Statements
Counting configurations in designs (English)
0 references
11 March 2002
0 references
An \(n\)-line configuration of a \(t\)-\((v,k,\lambda)\) design is a set of \(n\) blocks. The collection of configurations can be partitioned according to isomorphism and cardinalities of the resulting isomorphism classes can be considered. The author gives linear equations relating these cardinalities. For any fixed choice of \(t\) and \(k\), the coefficients in these equations can be expressed as functions of \(v\) and \(\lambda\) and so depend only on the design's parameters, and not its structure. This provides a characterization of the elements of a generating set for \(m\)-line configurations of an arbitrary design.
0 references
configurations
0 references
designs
0 references
0 references
0.8106438517570496
0 references
0.7862389087677002
0 references
0.7775508165359497
0 references
0.7761349081993103
0 references