๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Locally trivial t-designs and t-designs without repeated blocks

โœ Scribed by Luc Teirlinck

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
869 KB
Volume
77
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

โœฆ Synopsis

To Haim Hanani on his seventy-fifth birthday

๐Ÿ“œ SIMILAR VOLUMES

Non-trivial t-designs without repeated b
Non-trivial t-designs without repeated blocks exist for all t
โœ Luc Teirlinck ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 703 KB

We study several classes of arrays generalizing designs and orthogonal arrays. We use these to construct non-trivial t-designs without repeated blocks for all t. ## 1. Designs and arrays In this paper, we will assume all sets that are not obviously infinite, to be finite. If X and Y are sets, X Y

Quasi-Symmetric Designs with Good Blocks
Quasi-Symmetric Designs with Good Blocks
โœ T. P. McDonough; V. C. Mavron ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 460 KB

The article is concerned with a characterization of quasi-symmetric (QS) designs with intersection numbers 0 and y. It uses the idea of a good block. Such a block G has the property that for any block B with IG n B J = y, every point is on a block containing G n B. It is proved that if a QS design I

Block transitive resolutions of t-design
Block transitive resolutions of t-designs and room rectangles
โœ Robert A. Liebler; Spyros S. Magliveras; Sergei V. Tsaranov ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 779 KB

By a resolution of t-designs we mean a partition of the trivial design (x) of all k-subsets of a v-set X into t -(v',k, 2) designs, where vt<~v. A resolution of t-designs with v = v ~ is also called a large set of t-designs. A Room rectangle R, based on (x), is a rectangular array whose non-empty en