An incidence algebra for t-designs with automorphisms
type: Item
instance of: scholarly article
title: An incidence algebra for t-designs with automorphisms
zbMATH Open document ID: 0648.05010
DOI: 10.1016/0097-3165(86)90094-4
author: Donald L. Kreher
published in: Journal of Combinatorial Theory. Series A
publication date: 1986-01-01T00:00:00Z
review text: A t-design or generalized Steiner system S(\(\lambda\) ;t,k,v) is a pair (X,\({\mathcal B})\) with a v-set X of points and a family \({\mathcal B}\) of k- subsets of X called blocks such that, each block has k points and any t points are contained in exactly \(\lambda\) blocks. An automorphism of (X,\({\mathcal B})\) is a permutation of X which preserves \({\mathcal B}\). In this paper the algebra of matrices, whose rows and columns are indexed by the members of \({\mathcal P}(X)\), that are invariant under the natural action of a group \(G\leq Sym(X)\) is introduced. An epimorphism \(\tau\) from this algebra onto the matrices whose rows and columns are indexed by the orbits of G acting on \({\mathcal P}(X)\) is discovered. This mapping carries the matrices of Wilson onto the matrices of Kramer and Mesner and therefore can be used to generalize the t-design inequalities of Fisher, Wilson, and Ray-Chaudhuri. A conjecture of Earl Kramer is settled and an elementary proof of a theorem of Livingston and Wagner is presented.
Mathematics Subject Classification ID: 05B05
zbMATH DE Number: 4057522
zbMATH Keywords: t-design
zbMATH Keywords: generalized Steiner system
MaRDI profile type: Publication
full work available at URL: 0097-3165(86)90094-4
OpenAlex ID: W1984514561
cites work: An infinite class of 4-designs
cites work: An infinite class of 5-designs
cites work: Q4044586
cites work: On three-designs of small order
cites work: Q3663312
cites work: Q3710534
cites work: t-designs on hypergraphs
cites work: Transitivity of finite permutation groups on unordered sets
cites work: Q3340868
cites work: On t-designs
cites work: Q3851094
cites work: On partitions and permutation groups on unordered sets
cites work: Non-trivial \(t\)-designs without repeated blocks exist for all \(t\). (Reprint)
cites work: Q5512231
cites work: Incidence matrices of t-designs
description: scientific article; zbMATH DE number 4057522