Asymptotic Enumeration of Difference Matrices over Cyclic Groups
Combinatorics
2017-06-06 v2 Probability
Abstract
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 to estimate the return probabilities of these random walks, which in turn yields the asymptotic number of difference matrices over cyclic groups as the number of columns increases.
Cite
@article{arxiv.1607.08904,
title = {Asymptotic Enumeration of Difference Matrices over Cyclic Groups},
author = {Aaron M Montgomery},
journal= {arXiv preprint arXiv:1607.08904},
year = {2017}
}
Comments
19 pages