Asymptotic Enumeration of Difference Matrices over Cyclic Groups

DOI10.1017/S0963548317000281zbMath1378.05192arXiv1607.08904OpenAlexW2963521551MaRDI QIDQ4601056

Aaron M. Montgomery

Publication date: 19 January 2018

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1607.08904

zbMATH Keywords

random walks on Euclidean lattices

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Enumeration in graph theory (05C30) Asymptotic enumeration (05A16) Random walks on graphs (05C81)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Fourier-analytic approach to counting partial Hadamard matrices
• Asymptotic behaviour of the number of Eulerian circuits
• On difference matrices, resolvable transversal designs and generalized Hadamard matrices
• Asymptotic enumeration by degree sequence of graphs of high degree
• Asymptotic enumeration of integer matrices with large equal row and column sums
• Probabilistic existence of regular combinatorial structures
• On (\(g\), 4; 1)-difference matrices
• An asymptotic formula for the number of non-negative integer matrices with prescribed row and column sums
• Partial λ-Geometries and Generalized Hadamard Matrices Over Groups
• Asymptotic enumeration of tournaments with a given score sequence containing a specified digraph
• On orthogonal orthomorphisms of cyclic and non-Abelian groups

This page was built for publication: Asymptotic Enumeration of Difference Matrices over Cyclic Groups