Extending t-designs

DOI10.1016/0097-3165(75)90006-0MaRDI QIDQ1213875zbMATH OpenOpenAlexFDO

Authors William O. Alltop

Publication date 1975

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0097-3165(75)90006-0

Mathematics Subject Classification ID

Other designs, configurations (05B30)

Cites work

• scientific article; zbMATH DE number 3257050 (Why is no real title available?)
• A Theorem on Steiner Systems
• An infinite class of 5-designs

Cited in

(29)

• An upper bound of the value of t of the support t-designs of extremal binary doubly even self-dual codes
• Design-theoretic analogies between codes, lattices, and vertex operator algebras
• Classification of 6‐(14,7,4) designs with nontrivial automorphism groups
• Some new families of 3-regular self-complementary \(k\)-hypergraphs
• Bussey systems and Steiner's tactical problem
• On the number of mutually disjoint cyclic designs and large sets of designs
• Simple non-trivial designs with an arbitrary automorphism group
• Some existence theorems for \(t\)-designs
• On three-designs of small order
• The existence of simple \(6\text{-}(14,7,4)\) designs
• All block designs with \(b={v\choose k}/2\) exist
• Large sets of t-designs through partitionable sets: a survey
• Simple \(8\)-\((31,12,3080)\), \(8\)-\((40,12,16200)\) and \(8\)-\((40,12,16520)\) designs from \(\mathrm{PSL}(3,5)\) and \(\mathrm{PSL}(4,3)\)
• Constructing regular self-complementary uniform hypergraphs
• New \(t\)-designs and large sets of \(t\)-designs
• The family of t-designs. Part I
• Classifications of certain t-designs
• A method of constructing 2-resolvable \(t\)-designs for \(t=3,4\)
• The maximum number of columns in E(s2) $\,E({s}^{2})$‐optimal supersaturated designs with 16 rows and smax=4 ${s}_{{\rm{\max }}}=4$ is 60
• On some \(t\)-\((2k,k,\lambda)\) designs
• A summary of noncylic difference sets, \(k<20\)
• Recursive constructions for 3-designs and resolvable 3-designs
• A note on the Assmus-Mattson theorem for some binary codes
• On \(\mathrm{E}(s^2)\)-optimal and minimax-optimal supersaturated designs with 20 rows and 76 columns
• A study of orthogonal arrays from the point of view of design theory
• Some new 6-(14, 7, 4) designs
• On the mutual embeddability of (2k, k, k-1) and (2k - 1,k,k) quasi- residual designs
• A construction of 2-designs from Steiner systems and extendable designs
• More on halving the complete designs

This page was built for publication: Extending t-designs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1213875)