✦ LIBER ✦

Affine triple systems and matroid designs

✍ Scribed by H. Peyton Young

Publisher: Springer-Verlag
Year: 1973
Tongue: French
Weight: 804 KB
Volume: 132
Category: Article
ISSN: 0025-5874
DOI: 10.1007/bf01179740

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lie triple systems and affinely connecte

Lie triple systems and affinely connected spaces

✍ P. I. Kovalev 📂 Article 📅 1973 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 225 KB

Rank inequalities and separation algorit

Rank inequalities and separation algorithms for packing designs and sparse triple systems

✍ Lucia Moura 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 220 KB

Combinatorial designs ÿnd numerous applications in computer science, and are closely related to problems in coding theory. Packing designs correspond to codes with constant weight; 4-sparse partial Steiner triple systems (4-sparse PSTSs) correspond to erasure-resilient codes that are useful in handl

Translations and axial collineations of

Translations and axial collineations of affine designs

✍ Alan D. Griffiths; Vassili C. Mavron 📂 Article 📅 1975 🏛 Springer-Verlag 🌐 French ⚖ 637 KB

Nilpotent block designs I: Basic concept

Nilpotent block designs I: Basic concepts for Steiner triple and quadruple systems

✍ Robert W. Quackenbush 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 396 KB 👁 1 views

This paper discusses the concepts of nilpotence and the center for Steiner Triple and Quadruple Systems. The discussion is couched in the language of block designs rather than algebras. Nilpotence is closely connected to the well known doubling and tripling constructions for these designs. A sample

One-factors and the existence of affine

One-factors and the existence of affine designs

✍ Neal Brand; Somporn Sutinuntopas 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 582 KB

One-factors and the existence of affine designs, Discrete Mathematics 120 (1993) 25-35. Kiihler (1982) defines a graph G, for p a prime which he relates to affine designs. He shows that if the graph has a l-factor then there exists an affine 3-(p, 4, %) design with 1, satisfying the usual necessary

Cyclically resolvable designs and triple

Cyclically resolvable designs and triple whist tournaments

✍ I. Anderson; N. J. Finizio 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 552 KB

## We construct cyclically resolvable (v, 4 , l ) designs and cyclic triple whist tournaments Twh(v) for all v of the form 3pt'. . .p> + 1, where the pi are primes 3 1 (mod 4), such that each p1 -1 is divisible by the same power of 2.