2000 character limit reached
Counting results for thin Butson matrices
Published 18 Nov 2013 in math.CO | (1311.4475v2)
Abstract: A partial Butson matrix is a matrix $H\in M_{M\times N}(\mathbb Z_q)$ having its rows pairwise orthogonal, where $\mathbb Z_q\subset\mathbb C\times$ is the group of $q$-th roots of unity. We investigate here the counting problem for these matrices in the "thin" regime, where $M=2,3,\ldots$ is small, and where $N\to\infty$ (subject to the condition $N\in p\mathbb N$ when $q=pk>2$). The proofs are inspired from the de Launey-Levin and Richmond-Shallit counting results.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.