Hostname: page-component-586b7cd67f-dlnhk Total loading time: 0 Render date: 2024-11-22T01:26:31.319Z Has data issue: false hasContentIssue false
  • English
  • Français

Asymptotic Enumeration of Difference Matrices over Cyclic Groups

Published online by Cambridge University Press:  01 August 2017

AARON M. MONTGOMERY
AARON M. MONTGOMERY*
Affiliation:
Department of Mathematics, Baldwin Wallace University, Berea, Ohio, 44017, USA (e-mail: amontgom@bw.edu)
Get access Rights & Permissions [Opens in a new window]

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.

Keywords

Primary 05B20Secondary 05A16
Type
Paper
Information
Combinatorics, Probability and Computing , Volume 27 , Issue 1 , January 2018 , pp. 84 - 109
Copyright
Copyright © Cambridge University Press 2017 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1] Barvinok, A. and Hartigan, J. A. (2012) An asymptotic formula for the number of non-negative integer matrices with prescribed row and column sums. Trans. Amer. Math. Soc. 364 4323–4368.CrossRefGoogle Scholar
[2] Billingsley, P. (1995) Probability and Measure, third edition, Wiley.Google Scholar
[3] Canfield, E. R. and McKay, B. D. (2011) Asymptotic enumeration of integer matrices with large equal row and column sums. Combinatorica 30 655–680.CrossRefGoogle Scholar
[4] Colbourn, C. J. and Dinitz, J. H., eds (2006) Handbook of Combinatorial Designs, second edition, Discrete Mathematics and its Applications, CRC Press.Google Scholar
[5] De Launey, W. and Levin, D. A. (2010) A Fourier-analytic approach to counting partial Hadamard matrices. Cryptogr. Commun. 2 307–334.Google Scholar
[6] Drake, D. A. (1979) Partial λ-geometries and generalized Hadamard matrices over groups. Canad. J. Math. 31 617–627.Google Scholar
[7] Evans, A. B. (2002) On orthogonal orthomorphisms of cyclic and non-abelian groups. Discrete Math. 243 229–233.Google Scholar
[8] Gao, Z., McKay, B. D. and Wang, X. (2000) Asymptotic enumeration of tournaments with a given score sequence containing a specified digraph. Random Struct. Alg. 16 47–57.Google Scholar
[9] Ge, G. (2005) On (g, 4; 1)-difference matrices. Discrete Math. 301 164–174.Google Scholar
[10] Harville, D. A. (1997) Matrix Algebra from a Statistician's Perspective, Springer.Google Scholar
[11] Isaev, M. (2011) Asymptotic behaviour of the number of Eulerian circuits. Electron. J. Combin. 18 #219.CrossRefGoogle Scholar
[12] Jungnickel, D. (1979) On difference matrices, resolvable transversal designs and generalized Hadamard matrices. Math. Z. 167 49–60.Google Scholar
[13] Kuperberg, G., Lovett, S. and Peled, R. (2013) Probabilistic existence of regular combinatorial structures. https://arxiv.org/pdf/1302.4295 Google Scholar
[14] McKay, B. D. and Wormald, N. C. (1990) Asymptotic enumeration by degree sequence of graphs of high degree. European J. Combin. 11 565–580.Google Scholar
[15] Montgomery, A. (2013) Topics in random walks. PhD thesis, University of Oregon.Google Scholar
[16] Spitzer, F. (1976) Principles of Random Walk, second edition, Vol. 34 of Graduate Texts in Mathematics, Springer.Google Scholar