English
Related papers

Related papers: Hadamard matrices of order 764 exist

200 papers

We describe the second order ODE's cubic in the first order derivative with 2-dimensional symmetry algebra. We show that there exist only eight different types of them. We also construct the easily verifiable Equivalence Criterion for every…

Classical Analysis and ODEs · Mathematics 2013-07-15 Vera V. Kartak

We first give an Oppenheim type determinantal inequality for the Khatri-Rao product of two block positive semidefinite matrices, and then we extend our result to multiple block matrices. As products, the extensions of Oppenheim type…

Functional Analysis · Mathematics 2021-07-21 Yongtao Li , Lihua Feng

We prove that a circulant Hadamard code of length $4n$ can always be seen as an HFP-code (Hadamard full propelinear code) of type $C_{4n}\times C_2$, where $C_2=\langle u\rangle$ or the same, as a cocyclic Hadamard code. We compute the rank…

Combinatorics · Mathematics 2017-11-28 Josep Rifà

Generalising a result for Hopf algebras, we not only define the four possible types of Hopf modules in the bialgebroid setting but also yield the notion of two-sided two-cosided Hopf modules, also known as Hopf bimodules or tetramodules, in…

Quantum Algebra · Mathematics 2025-10-09 Sophie Chemla , Niels Kowalzig

In [7] the authors have introduced a new construction using the Hadamard product to present star configurations of codimension $ c $ of $\mathbb{P}^n$ and which they called Hadamard star configurations. In this paper, we introduce a more…

Algebraic Geometry · Mathematics 2019-12-24 Iman Bahmani Jafarloo , Gabriele Calussi

A notable difference between the ordinary and Hadamard products is that the Hadamard product of two singular positive semidefinite matrices can be nonsingular, and one of the factors can even be indefinite. We present an eigenvalue lower…

Signal Processing · Electrical Eng. & Systems 2026-04-22 Roger A. Horn , Shengxuan Luo , Hongwei Xu , Zai Yang

Let $G$ be a finite group and let $h$ be a positive integer. A $\text{BH}(G,h)$ matrix is a $G$-invariant $|G|\times |G|$ matrix $H$ whose entries are complex $h$th roots of unity such that $HH^*=|G|I_{|G|}$, where $H^*$ denotes the complex…

Combinatorics · Mathematics 2019-12-16 Tai Do Duc

A trade in a complex Hadamard matrix is a set of entries which can be changed to obtain a different complex Hadamard matrix. We show that in a real Hadamard matrix of order $n$ all trades contain at least $n$ entries. We call a trade…

Combinatorics · Mathematics 2015-12-17 Padraig Ó Catháin , Ian M. Wanless

We present explicit inverses of two Brownian--type matrices, which are defined as Hadamard products of certain already known matrices. The matrices under consideration are defined by $3n-1$ parameters and their lower Hessenberg form…

Numerical Analysis · Mathematics 2025-10-20 F. N. Valvi , V. S. Geroyannis

We devise a method that reduces the problem of classifying systems of forms and linear mappings to the problem of classifying systems of linear mappings. Canonical matrices of (i) bilinear or sesquilinear forms, (ii) pairs of symmetric,…

Representation Theory · Mathematics 2008-01-08 Vladimir V. Sergeichuk

In this note we investigate the existence of flat orthogonal matrices, i.e. real orthogonal matrices with all entries having absolute value close to $\frac{1}{\sqrt{n}}$. Entries of $\pm \frac{1}{\sqrt{n}}$ correspond to Hadamard matrices,…

Combinatorics · Mathematics 2015-05-15 Philippe Jaming , Mate Matolcsi

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

We define Bush-type generalized Hadamard matrices over abelian groups and construct symmetric Bush-type generalized Hadamard matrices over the additive group of finite field $\mathbb{F}_q$, $q$ a prime power. We then show and study an…

Combinatorics · Mathematics 2015-09-18 Hadi Kharaghani , Sho Suda

In this paper, we introduce two new forms of the dual Hartwig-Spindelb{\"o}ck decomposition and employ them to derive explicit representations for several classes of dual generalized inverses. Building on these representations, we further…

Rings and Algebras · Mathematics 2026-02-10 Tan Mei , Kezheng Zuo , Hui Yan

We study $n$-dimensional matrices with $\{0,1\}$-entries ($n$-cubes) such that all their $2$-dimensional slices are incidence matrices of symmetric designs. A known construction of these objects obtained from difference sets is generalized…

Combinatorics · Mathematics 2025-09-30 Vedran Krčadinac , Mario Osvin Pavčević , Kristijan Tabak

In this article we construct examples of derivations in matrix semirings. We study hereditary and inner derivations, derivatives of diagonal, triangular, Toeplitz, circulant matrices and of matrices of other forms and prove theorems for…

Rings and Algebras · Mathematics 2018-01-17 Dimitrinka Vladeva

Many interesting examples of complex Hadamard matrices $H\in M_N(\mathbb C)$ can be put, up to the standard equivalence relation for such matrices, in bistochastic form. We discuss here this phenomenon, with a number of computations for…

Combinatorics · Mathematics 2019-11-14 Teo Banica

We provide the first example of a sign pattern $S$ for which there exist orthogonal matrices $Q_1$ and $Q_2$ with sign pattern $S$ such that $\det Q_1=1$ and $\det Q_2=-1$. The existence of such matrices is raised by C. Waters in {"Sign…

Combinatorics · Mathematics 2012-12-27 Bryan L. Shader , Chanyoung L. Shader

A construction that generates Williamson matrices of order $2n$ from Williamson matrices of odd order $n$ is presented. The construction is completely constructive and only uses three simple sequence operations.

Combinatorics · Mathematics 2018-03-06 Curtis Bright

A quick way to compute generating functions related to Pell-Padovan tetranacci numbers and classical sequences of recursions of order two is provided. Eight special instances can be computed at once.

Combinatorics · Mathematics 2026-03-05 Helmut Prodinger