most citedAn Asymptotic Formula for the Number of Balanced Incomplete Block Design Incidence Matrices

1 citations · 1 across the 1 of their papers we have counts for

collaborators
Showing math.COShow all

2 papers · 1 filter

math.CO2016

Asymptotic Enumeration of Difference Matrices over Cyclic Groups

Aaron M Montgomery

We identify a relationship between a certain family of random walks on Euclidean lattices and difference matrices over cyclic groups. We then use the techniques of Fourier analysis…

math.CO2014★ 1 cited

An Asymptotic Formula for the Number of Balanced Incomplete Block Design Incidence Matrices

Aaron M. Montgomery

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…