English
Related papers

Related papers: Hadamard matrices modulo 5

200 papers

There are several well-known methods that one can use to construct Hadamard matrices from base sequences BS(m,n). In view of the recent classification of base sequences BS(n+1,n) for n <= 30, it may be of interest to show on an example how…

Combinatorics · Mathematics 2011-06-16 Dragomir Z. Djokovic

We show that an $n\times n$ circulant Hadamard matrix must satisfy a family of congruence equations that have solutions only when $n \leq 4$, proving Ryser's 1963 conjecture that no such matrices exist for $n>4$.

Combinatorics · Mathematics 2023-02-17 Joshua Morris

Let $n$ be the order of a (quaternary) Hadamard matrix. It is shown that the existence of a projective plane of order $n$ is equivalent to the existence of a balancedly multi-splittable (quaternary) Hadamard matrix of order $n^2$.

Combinatorics · Mathematics 2022-11-07 Hadi Kharaghani , Sho Suda

In this paper we study $b_5(n)$, the $5$-regular partitions of $n$. Using the theory of modular forms, we prove several theorems on the divisibility and distribution properties of $b_5(n)$ modulo prime $m\geq5$. In particular, we prove that…

Number Theory · Mathematics 2022-08-04 Qi-Yang Zheng

We study the existence and construction of circulant matrices $C$ of order $n\geq2$ with diagonal entries $d\geq0$, off-diagonal entries $\pm1$ and mutually orthogonal rows. These matrices generalize circulant conference ($d=0$) and…

Combinatorics · Mathematics 2019-02-05 Ondřej Turek , Dardo Goyeneche

Two matrices with elements taken from the set {-1,1} are Hadamard equivalent if one can be converted into the other by a sequence of permutations of rows and columns, and negations of rows and columns. In this paper we summarize what is…

Combinatorics · Mathematics 2007-06-13 William P. Orrick

In this paper we provide an analytical procedure which leads to a system of $(n-2)^2$ polynomial equations whose solutions give the parameterisation of the complex $n\times n$ Hadamard matrices. It is shown that in general the Hadamard…

Quantum Physics · Physics 2016-09-08 Petre Dita

Let $S(x)$ be the number of $n \leq x$ for which a Hadamard matrix of order $n$ exists. Hadamard's conjecture states that $S(x)$ is about $x/4$. From Paley's constructions of Hadamard matrices, we have that \[ S(x) = \Omega(x/\log x). \] In…

Combinatorics · Mathematics 2010-04-28 Warwick de Launey , Daniel M. Gordon

Let $s(n)$ be the number of 1-shell totally symmetric plane partitions (TSPPs) of $n$. In this paper, an infinite family of congruences modulo powers of $5$ for $s(n)$ will be deduced through an elementary approach. Namely, $$s\left(2\cdot…

Number Theory · Mathematics 2020-03-30 Shane Chern

The purpose of this paper is to introduce new parametric families of complex Hadamard matrices in two different ways. First, we prove that every real Hadamard matrix of order N>=4 admits an affine orbit. This settles a recent open problem…

Combinatorics · Mathematics 2007-05-23 Ferenc Szöllosi

Around 2016, Calinescu, Milas and Penn conjectured that the rank $r$ Nahm sum associated with the $r\times r$ tadpole Cartan matrix is modular, and they provided a proof for $r=2$. The $r=3$ case was recently resolved by Milas and Wang. We…

Number Theory · Mathematics 2025-04-25 Changsong Shi , Liuquan Wang

Let $NT(m, k, n)$ denote the total number of parts in the partitions of n with rank congruent to m modulo k. Andrews proved Beck's conjecture on congruences for $NT(m, k, n)$ modulo 5 and 7. Generalizing Andrews'results, Chern obtain…

Number Theory · Mathematics 2023-03-10 Nankun Hong , Renrong Mao

In 2013, Nebe and Villar gave a series of ternary self-dual codes of length $2(p+1)$ for a prime $p$ congruent to $5$ modulo $8$. As a consequence, the third ternary extremal self-dual code of length $60$ was found. We show that the ternary…

Combinatorics · Mathematics 2023-03-28 Makoto Araya , Masaaki Harada , Koji Momihara

Complex Hadamard matrices, consisting of unimodular entries with arbitrary phases, play an important role in the theory of quantum information. We review basic properties of complex Hadamard matrices and present a catalogue of inequivalent…

Quantum Physics · Physics 2007-05-23 Wojciech Tadej , Karol Zyczkowski

Let $p_{-k}(n)$ enumerate the number of $k$-colored partitions of $n$. In this paper, we establish some infinite families of congruences modulo 25 for $k$-colored partitions. Furthermore, we prove some infinite families of Ramanujan-type…

Combinatorics · Mathematics 2017-11-08 Dazhao Tang

A new, two-parameter, nonaffine family of complex Hadamard matrices of order 6 is reported. It interpolates between the two Fourier families, and contains as one-parameter subfamilies the Dita family, a symmetric family and an almost (up to…

Mathematical Physics · Physics 2015-05-13 Bengt R. Karlsson

It is proved that the number of 9-regular partitions of n is divisible by 3 when n is congruent to 3 mod 4, and by 6 when n is congruent to 13 mod 16. An infinite family of congruences mod 3 holds in other progressions modulo powers of 4…

Combinatorics · Mathematics 2013-06-07 William J. Keith

It is shown that a normalized complex Hadamard matrix of order $6$ having three distinct columns, each containing at least one $-1$ entry necessarily belongs to the transposed Fourier family, or to the family of $2$-circulant complex…

Combinatorics · Mathematics 2024-10-07 Ákos K. Matszangosz , Ferenc Szöllősi

First we give an overview of the known supplementary difference sets (SDS) (A_i), i=1..4, with parameters (n;k_i;d), where k_i=|A_i| and each A_i is either symmetric or skew and k_1 + ... + k_4 = n + d. Five new Williamson matrices over the…

Combinatorics · Mathematics 2010-02-14 Dragomir Z. Djokovic

All generalized Hadamard matrices of order 18 over a group of order 3, H(6,3), are enumerated in two different ways: once, as class regular symmetric (6,3)-nets, or symmetric transversal designs on 54 points and 54 blocks with a group of…

Combinatorics · Mathematics 2012-05-28 Masaaki Harada , Clement Lam , Akihiro Munemasa , Vladimir D. Tonchev