Abstract:We introduce the concept of a morphism from the set of Butson Hadamard matrices over k th roots of unity to the set of Butson matrices over ℓ th roots of unity. As concrete examples of such morphisms, we describe tensor-product-like maps which reduce the order of the roots of unity appearing in a Butson matrix at the cost of increasing the dimension. Such maps can be constructed from Butson matrices with eigenvalues satisfying certain natural conditions. Our work unifies and generalises Turyn's construction of… Show more
“…For one, a BH(n, k) exists for all n, (the Fourier matrix for example), but real Hadamard matrices, i.e., BH(n, 2), exist when n > 2 only if n ≡ 0 mod 4, and this condition is famously not yet known to be sufficient. A Butson morphism [8] is a map BH(n, k) → BH(m, ℓ). This motives the study of Butson matrices even if real Hadamard matrices are the primary interest.…”
Section: Butson Hadamard Matricesmentioning
confidence: 99%
“…For t 1 = 1, t 2 = 1, t 3 = 0 then L(H) is the matrix given in Example 1.1. For t 1 = 1, t 2 = 1, t 3 = 1 then H ∈ BH (8,8) where…”
Section: A Fourier Type Construction and Simplex Codesmentioning
confidence: 99%
“…x ∈ C 1 (1,2,3,4,5,6,7,8) x ∈ C 2 (1, 3, 5, 7) (2,4,6,8) x ∈ C 3 (1,4,7,2,5,8,3,6) x ∈ C 4 (1, 5)(2, 6)(3, 7)(4, 8)…”
In this paper we study Butson Hadamard matrices, and codes over finite rings coming from these matrices in logarithmic form, called BH-codes. We introduce a new morphism of Butson Hadamard matrices through a generalized Gray map on the matrices in logarithmic form, which is comparable to the morphism given in a recent note of Ó Catháin and Swartz. That is, we show how, if given a Butson Hadamard matrix over the k th roots of unity, we can construct a larger Butson matrix over the ℓ th roots of unity for any ℓ dividing k, provided that any prime p dividing k also divides ℓ. We prove that a Z p s-additive code with p a prime number is isomorphic as a group to a BH-code over Z p s and the image of this BH-code under the Gray map is a BH-code over Z p (binary Hadamard code for p = 2). Further, we investigate the inherent propelinear structure of these codes (and their images) when the Butson matrix is cocyclic. Some structural properties of these codes are studied and examples are provided.
“…For one, a BH(n, k) exists for all n, (the Fourier matrix for example), but real Hadamard matrices, i.e., BH(n, 2), exist when n > 2 only if n ≡ 0 mod 4, and this condition is famously not yet known to be sufficient. A Butson morphism [8] is a map BH(n, k) → BH(m, ℓ). This motives the study of Butson matrices even if real Hadamard matrices are the primary interest.…”
Section: Butson Hadamard Matricesmentioning
confidence: 99%
“…For t 1 = 1, t 2 = 1, t 3 = 0 then L(H) is the matrix given in Example 1.1. For t 1 = 1, t 2 = 1, t 3 = 1 then H ∈ BH (8,8) where…”
Section: A Fourier Type Construction and Simplex Codesmentioning
confidence: 99%
“…x ∈ C 1 (1,2,3,4,5,6,7,8) x ∈ C 2 (1, 3, 5, 7) (2,4,6,8) x ∈ C 3 (1,4,7,2,5,8,3,6) x ∈ C 4 (1, 5)(2, 6)(3, 7)(4, 8)…”
In this paper we study Butson Hadamard matrices, and codes over finite rings coming from these matrices in logarithmic form, called BH-codes. We introduce a new morphism of Butson Hadamard matrices through a generalized Gray map on the matrices in logarithmic form, which is comparable to the morphism given in a recent note of Ó Catháin and Swartz. That is, we show how, if given a Butson Hadamard matrix over the k th roots of unity, we can construct a larger Butson matrix over the ℓ th roots of unity for any ℓ dividing k, provided that any prime p dividing k also divides ℓ. We prove that a Z p s-additive code with p a prime number is isomorphic as a group to a BH-code over Z p s and the image of this BH-code under the Gray map is a BH-code over Z p (binary Hadamard code for p = 2). Further, we investigate the inherent propelinear structure of these codes (and their images) when the Butson matrix is cocyclic. Some structural properties of these codes are studied and examples are provided.
“…More recently, Compton, Craigen and de Launey proved that a matrix in BH(n, 6) with no entries in {1, −1} implies that BH(4n, 2) is nonempty [3]. The first author and Egan unified and generalised these results, giving sufficient conditions for the existence of a matrix in BH(n, k) and a matrix in M ∈ BH(m, ℓ) to imply the existence of a matrix in BH(mn, ℓ) [4]. The most substantial conditions in these constructions are on the spectrum of the matrix M. In [5], the authors of this paper and Egan proved the existence of a real Hadamard matrix with minimal polynomial Φ 2 t+1 (x), which implies that, whenever there exists H ∈ BH(n, 2 t ), there exists a real Hadamard matrix of order 2 2 t−1 −1 n.…”
An n × n matrix H is Butson-Hadamard if its entries are k th roots of unity and it satisfies HH * = nI n . Write BH(n, k) for the set of such matrices.Suppose that k = p α q β where p and q are primes and α ≥ 1. A recent result ofÖstergård and Paavola uses a matrix H ∈ BH(n, pk) to construct H ′ ∈ BH(pn, k). We simplify the proof of this result and remove the restriction on the number of prime divisors of k. More precisely, we prove that if k = mt, and each prime divisor of k divides t, then we can construct a matrix H ′ ∈ BH(mn, t) from any H ∈ BH(n, k).
“…In [6], the authors define a (complete) morphism of Butson matrices to be a function from BH(n, k) to BH(r, ℓ). A partial morphism is a morphism such that the domain is a proper subset of BH(n, k).…”
In this paper, we develop a technique for controlling the spectra of Hadamard matrices with sufficiently rich automorphism groups. For each integer t ≥ 2, we construct a Hadamard matrix H t equivalent to the Sylvester matrix of order n t = 2 2 t−1 −1 such that the minimal polynomial of 1 √ nt H t is the cyclotomic polynomial Φ 2 t+1 (x). As an application we construct real Hadamard matrices from Butson Hadamard matrices. More concretely, a Butson Hadamard matrix H has entries in the k th roots of unity and satisfies the matrix equation HH * = nI n . We write BH(n, k) for the set of such matrices. A complete morphism of Butson matrices is a map BH(n, k) → BH(m, ℓ). The matrices H t yield new examples of complete morphisms BH(n, 2 t ) → BH(2 2 t−1 −1 n, 2) , for each t ≥ 2, generalising a well-known result of Turyn.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.