Counting configurations in designs
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.
- A small basis for four‐line configurations in steiner triple systems. Dedicated to the memory of gemma holly griggs
- Anti-mitre Steiner triple systems
- scientific article; zbMATH DE number 26314 (Why is no real title available?)
- scientific article; zbMATH DE number 1284204 (Why is no real title available?)
- scientific article; zbMATH DE number 1750094 (Why is no real title available?)
- scientific article; zbMATH DE number 841567 (Why is no real title available?)
- scientific article; zbMATH DE number 908564 (Why is no real title available?)
- scientific article; zbMATH DE number 934539 (Why is no real title available?)
- scientific article; zbMATH DE number 1409201 (Why is no real title available?)
- Some results on quadrilaterals in Steiner triple systems
- The matching polynomial of a regular graph
- Configurations and \((r,1)\)-designs
- Generalized configurations
- Counting Blanks in Polygonal Arrangements
- The \(L\)-functions and Modular Forms Database project
- Counting Star-Battle configurations
- Algorithms and complexity for counting configurations in Steiner triple systems
- Bussey systems and Steiner's tactical problem
- High-girth Steiner triple systems
This page was built for publication: Counting configurations in designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5953380)