Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/wiley/block-intersection-polynomials-ezrzlP0iZi
References (11)
-
C. Colbourn, J. Dinitz (1996)
CRC Handbook of Combinatorial DesignsJournal of the American Statistical Association, 92
-
K. Phelps, Douglas Stinson, S. Vanstone (1989)
The existence of simple S3(3, 4, v)Discret. Math., 77
-
Donald Kreher, S. Radziszowski (1986)
The existence of simple 6-(14, 7, 4) designsJ. Comb. Theory, Ser. A, 43
-
P. Dobcsányi, D. Preece, L. Soicher (2007)
On balanced incomplete-block designs with repeated blocksEur. J. Comb., 28
-
(2004)
Version 9 -
L. Soicher (1981)
The computation of Galois groups -
M. Jacroux (1984)
On the block structure of proper block designsJournal of Statistical Planning and Inference, 9
-
Encyclopaedia of design theory -
J. McSorley, L. Soicher (2005)
Constructing t-designs from t-wise balanced designs -
(2006)
The DESIGN package for GAP, Version 1 -
(2006)
GAP — groups, algorithms, and programming, Version 4
- Publisher
- Wiley
- Copyright
- © London Mathematical Society
- ISSN
- 0024-6093
- eISSN
- 1469-2120
- DOI
- 10.1112/blms/bdm034
- Publisher site
- See Article on Publisher Site
Abstract
We introduce the block intersection polynomial, which is constructed using certain information about a block design with respect to a subset S of its point‐set, and then provides further information about the number of blocks intersecting S in exactly i points, for i = 0, …, |S|. We also discuss some applications of block intersection polynomials, including bounding the multiplicity of a block in a t‐(v, k, λ) design and in a resolvable t‐(v, k, λ) design.
Journal
Bulletin of the London Mathematical Society – Wiley
Published: Aug 1, 2007