Search arXivSearch

arXiv · 2404.02666

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 \emph{nested point}) to every block of a $(v,k,λ)$-BIBD in such a way that we end up with a partial $(v,k+1,λ+1)$-BIBD. In the case where the partial $(v,k+1,λ+1)$-BIBD is in fact a $(v,k+1,λ+1)$-BIBD, we have a \emph{perfect nesting}. We show that a nesting is perfect if and only if $k = 2 λ+ 1$. Perfect nestings were previously known to exist in the case of Steiner triple systems (i.e., $(v,3,1)$-BIBDs) when $v \equiv 1 \bmod 6$, as well as for some symmetric BIBDs. Here we study nestings of $(v,4,1)$-BIBDs, which are not perfect nestings. We prove that there is a nested $(v,4,1)$-BIBD if and only if $v \equiv 1 \text{ or } 4 \bmod 12$, $v \geq 13$. This is accomplished by a variety of direct and recursive constructions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Marco Buratti, Donald L. Kreher, Douglas R. Stinson. 2024-04-03. Nestings of BIBDs with block size four. https://arxiv.org/abs/2404.02666

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO