Nestings of BIBDs with block size four

Abstract In a nesting of a balanced incomplete block design (or BIBD), we wish to add a point (the nested point ) to every block of a ‐BIBD in such a way that we end up with a partial ‐BIBD. In the case where the partial ‐BIBD is in fact a ‐BIBD, we have a perfect nesting . We show that a nesting is perfect if and only if . Perfect nestings were previously known to exist in the case of Steiner triple systems (i.e., ‐BIBDs) when , as well as for some symmetric BIBDs. Here we study nestings of ‐BIBDs, which are not perfect nestings. We prove that there is a nested ‐BIBD if and only if , . This is accomplished by a variety of direct and recursive constructions.

Authors

Institutions

Publication Details

Journal
Journal of Combinatorial Designs
Published
2024-10-06
DOI
https://doi.org/10.1002/jcd.21957
Citations
5
Primary Topic
graph theory and CDMA systems
Type
article
Field-Weighted Citation Impact
1.04

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Nestings of BIBDs with block size four

Douglas R. Stinson, Donald L. Kreher, Marco Buratti
5 citations
Journal of Combinatorial Designs
graph theory and CDMA systems
1.04
article

Nestings of BIBDs with block size four

Douglas R. Stinson, Donald L. Kreher, Marco Buratti
article en
5 citations

Abstract

Abstract In a nesting of a balanced incomplete block design (or BIBD), we wish to add a point (the nested point ) to every block of a ‐BIBD in such a way that we end up with a partial ‐BIBD. In the case where the partial ‐BIBD is in fact a ‐BIBD, we have a perfect nesting . We show that a nesting is perfect if and only if . Perfect nestings were previously known to exist in the case of Steiner triple systems (i.e., ‐BIBDs) when , as well as for some symmetric BIBDs. Here we study nestings of ‐BIBDs, which are not perfect nestings. We prove that there is a nested ‐BIBD if and only if , . This is accomplished by a variety of direct and recursive constructions.

Journal of Combinatorial DesignsVol. 32(12)
Michigan Technological University (US), University of Waterloo (CA), Sapienza University of Rome (IT)
Natural Sciences and Engineering Research Council of Canada
Openalex Percentile: Top 23%
graph theory and CDMA systems
1.04
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.