An Asymptotic Formula for the Number of Balanced Incomplete Block Design Incidence Matrices (1407.4552v3)

Published 17 Jul 2014 in math.CO and math.PR

Abstract: We identify a relationship between a random walk on a certain Euclidean lattice and incidence matrices of balanced incomplete block designs. We then compute the return probability of the random walk and use it to obtain the asymptotic number of BIBD incidence matrices (as the number of columns increases). Our strategy is similar in spirit to the one used by de Launey and Levin to count partial Hadamard matrices.

Summary

We haven't generated a summary for this paper yet.

Whiteboard

Generate a whiteboard explanation of this paper.

Sign Up to Generate

Video Overview

Generate a video overview of this paper.

Sign Up to Generate

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Top Community Prompts

Explain it Like I'm 14

Practical Applications

Conceptual Simplification

Sign Up to Activate View All Prompts

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Aaron M. Montgomery

Collections

Sign up for free to add this paper to one or more collections.