Searcharxiv⌕ Search

arXiv · 2610.28394

On complete morphisms of Butson Hadamard matrices

Abstract

A complete morphism of Butson classes replaces each entry of a matrix in $\mathrm{BH}(n,k)$ by an $m \times m$ block, uniformly, to produce a matrix in $\mathrm{BH}(mn,t)$. We show that every complete morphism is described by a pair $(U,Z)$, where $Z \in \mathrm{BH}(m,t)$ and $U$ is a unitary matrix annihilated by the $k^{\textrm{th}}$ cyclotomic polynomial. We deduce from a theorem of Lam and Leung that complete morphisms onto real Hadamard matrices exist precisely when $k$ is a power of $2$. The exponent-reducing morphisms of Östergård--Paavola and Ó Catháin--Swartz achieve the smallest block size the degree bound allows, and we show that there are no other complete morphisms for which $U$ is monomial. We construct new complete morphisms where $U$ is not monomial: a complete morphism $\mathrm{BH}(n,7) \rightarrow \mathrm{BH}(6n,6)$ is given, the first to eliminate a prime from the alphabet.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ronan Egan, Pádraig Ó Catháin. 2026-10-20. On complete morphisms of Butson Hadamard matrices. https://arxiv.org/abs/2610.28394

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Transience of walks in the countable complete digraph with complex edge weights

We extend a fragment of the symbolic method in enumerative combinatorics by allowing coefficients in generating functions to be defined by infinite series and generalize Pólya's theorem on random walks. Pólya's theorem determines limits of the probabilities that walks in the grid graph on $\mathbb{Z}^d$, starting at the origin $\overline{0}$, visit the given vertex $\overline{v}$. We generalize the grid graph to the countable complete directed graph $\vec{K}_{\mathbb{N}}$ on the vertices $\mathbb{N}=\{1,2,\dots\}$ and weight its edges by complex numbers. We obtain 16 generalizations of Pólya's theorem. Our approach, in fact, generalizes Markov chains on $\mathbb{N}$ starting at $1$.

math.CO↗

Integral quasi-strongly regular Cayley graphs

Quasi-strongly regular graphs form a significant generalization of strongly regular graphs. We study the eigenvalues of a family of such graphs, $Γ_H(G)$, constructed from a finite group $G$ and a subgroup $H$. Our main results include a sufficient condition for $Γ_H(G)$ to be integral and an explicit computation of its entire spectrum when $H$ is normal, revealing that the spectrum in this case depends only on $|G|$ and the index $[G:H]$.

math.CO↗

Efficient total facial coloring of combinatorial maps

Let $1<k\in\mathbb{Z}$. A total coloring of a connected simple regular graph $G$ via color set $]k]_0=\{0,1,\ldots, k\}$ is efficient if each color yields an efficient dominating set, where efficient domination applies to each color class in $V(G)$. An efficient total coloring of $G$ via $[k]_0$ extends to an efficient total facial coloring $c$ of a map $M(G)$ of $G$ if it assigns a vertex-and-edge $k$-color set to the boundary cycle of each face, with the consequently missing color assigned to the face itself, so that the two adjacent faces along each edge are assigned different colors. Focus is set upon planar and toroidal maps. Modifications of $c$ are also treated by removing a perfect dominating set or a 1-factor from $G$.

math.CO↗