اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدCirculant q-Butson Hadamard matrices
95
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
If $q = p^n$ is a prime power, then a $d$-dimensional emph{$q$-Butson Hadamard matrix} $H$ is a $dtimes d$ matrix with all entries $q$th roots of unity such that $HH^* = dI_d$. We use algebraic number theory to prove a strong constraint on the dimension of a circulant $q$-Butson Hadamard matrix when $d = p^m$ and then explicitly construct a family of examples in all possible dimensions. These results relate to the long-standing circulant Hadamard matrix conjecture in combinatorics.
قيم البحث
اقرأ أيضاً
We study the circulant complex Hadamard matrices of order $n$ whose entries are $l$-th roots of unity. For $n=l$ prime we prove that the only such matrix, up to equivalence, is the Fourier matrix, while for $n=p+q,l=pq$ with $p,q$ distinct primes the
re is no such matrix. We then provide a list of equivalence classes of such matrices, for small values of $n,l$.
In this paper, we generalize classical constructions of skew Hadamard difference families with two or four blocks in the additive groups of finite fields given by Szekeres (1969, 1971), Whiteman (1971) and Wallis-Whiteman (1972). In particular, we sh
ow that there exists a skew Hadamard difference family with $2^{u-1}$ blocks in the additive group of the finite field of order $q^e$ for any prime power $qequiv 2^u+1,({mathrm{mod, , }2^{u+1}})$ with $uge 2$ and any positive integer $e$. In the aforementioned work of Szekeres, Whiteman, and Wallis-Whiteman, the constructions of skew Hadamard difference families with $2^{u-1}$ ($u=2$ or $3$) blocks in $({mathbb F}_{q^e},+)$ depend on the exponent $e$, with $eequiv 1,2,$ or $3,({mathrm{mod, , }4})$ when $u=2$, and $eequiv 1,({mathrm{mod, , }2})$ when $u=3$, respectively. Our more general construction, in particular, removes the dependence on $e$. As a consequence, we obtain new infinite families of skew Hadamard matrices.
In this paper, we obtain a number of new infinite families of Hadamard matrices. Our constructions are based on four new constructions of difference families with four or eight blocks. By applying the Wallis-Whiteman array or the Kharaghani array to
the difference families constructed, we obtain new Hadamard matrices of order $4(uv+1)$ for $u=2$ and $vin Phi_1cup Phi_2 cup Phi_3 cup Phi_4$; and for $uin {3,5}$ and $vin Phi_1cup Phi_2 cup Phi_3$. Here, $Phi_1={q^2:qequiv 1pmod{4}mbox{ is a prime power}}$, $Phi_2={n^4in mathbb{N}:nequiv 1pmod{2}} cup {9n^4in mathbb{N}:nequiv 1pmod{2}}$, $Phi_3={5}$ and $Phi_4={13,37}$. Moreover, our construction also yields new Hadamard matrices of order $8(uv+1)$ for any $uin Phi_1cup Phi_2$ and $vin Phi_1cup Phi_2 cup Phi_3$.
We investigate polynomials, called m-polynomials, whose generator polynomial has coefficients that can be arranged as a matrix, where q is a positive integer greater than one. Orthogonality relations are established and coefficients are obtained for
the expansion of a polynomial in terms of m-polynomials. We conclude this article by an implementation in MATHEMATICA of m-polynomials and the results obtained for them.
We study the behaviour of the 2-rank of the adjacency matrix of a graph under Seidel and Godsil-McKay switching, and apply the result to graphs coming from graphical Hadamard matrices of order $4^m$. Starting with graphs from known Hadamard matrices
of order $64$, we find (by computer) many Godsil-McKay switching sets that increase the 2-rank. Thus we find strongly regular graphs with parameters $(63,32,16,16)$, $(64,36,20,20)$, and $(64,28,12,12)$ for almost all feasible 2-ranks. In addition we work out the behaviour of the 2-rank for a graph product related to the Kronecker product for Hadamard matrices, which enables us to find many graphical Hadamard matrices of order $4^m$ for which the related strongly regular graphs have an unbounded number of different 2-ranks. The paper extends results from the article Switched symplectic graphs and their 2-ranks by the first and the last author.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
