Related papers: Hadamard Hypercubes
Computer simulations serve as powerful tools for scientists and engineers to gain insights into complex systems. Less costly than physical experiments, computer experiments sometimes involve large number of trials. Conventional design…
We describe combinatorial properties of the defining row of a circulant Hadamard matrix by exploiting its orthogonality to subsequent rows, and show how to exclude several particular forms of these matrices.
We comment on two randomized algorithms for constructing low-rank matrix decompositions. Both algorithms employ the Subsampled Randomized Hadamard Transform [14]. The first algorithm appeared recently in [9]; here, we provide a novel…
In this paper we study derived equivalences between triangular matrix algebras using certain classical recollements. We show that special properties of these recollements actually characterize triangular matrix algebras, and describe…
A family of two-unitary complex Hadamard matrices (CHM) stemming from a particular matrix, of size $36$ is constructed. Every matrix in this orbit remains unitary after operations of partial transpose and reshuffling which makes it a…
Conference matrices are used to define complex structures on real vector spaces. Certain lattices in these spaces become modules for rings of quadratic integers. Multiplication of these lattices by non-principal ideals yields simple…
What is the dimension of a smooth family of complex Hadamard matrices including the Fourier matrix? We address this problem with a power series expansion. Studying all dimensions up to 100 we find that the first order result is misleading…
We study two kinds of generalizations of symmetric block designs to higher dimensions, the so-called $\mathcal{C}$-cubes and $\mathcal{P}$-cubes. For small parameters, all examples up to equivalence are determined by computer calculations.…
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…
In this paper we are constructing integer lattice squares, cubes or hypercubes in $\mathbb R^d$ with $d\in \{2,3,4\}$. For squares and cubes we find a complete description of their Ehrhart polynomial. For hypercubes, we compute one of the…
We present a complete computational classification of the combinatorial types of hyperplane sections, or slices, of the regular cube up to dimension six. For each dimension, we determine the exact number of distinct combinatorial types.…
The $d$-dimensional hypercube graph $Q_d$ has as vertices all subsets of $\{1,\ldots,d\}$, and an edge between any two sets that differ in a single element. The Ruskey-Savage conjecture asserts that every matching of $Q_d$, $d\ge 2$, can be…
Theoretical and computational frameworks of modern science are dominated by binary structures. This binary bias, seen in the ubiquity of pair-wise networks and formal operations of two arguments in mathematical models, limits our capacity…
We show that k=w+2 mutually unbiased bases can be constructed in any square dimension d=s^2 provided that there are w mutually orthogonal Latin squares of order s. The construction combines the design-theoretic objects (k,s)-nets (which can…
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…
The notion of unbiased orthogonal designs is introduced as a generalization among unbiased Hadamard matrices, unbiased weighing matrices and quasi-unbiased weighing matrices. We provide upper bounds and several constructions for mutually…
Two skew Hadamard matrices are considered {\sf SH}-equivalent if they are similar by a signed permutation matrix. This paper determines the number of {\sf SH}-inequivalent skew Hadamard matrices of order $36$ for some types. We also study…
We show that any two Hadamard subfactors arising from a pair of distinct complex Hadamard matrices of order 3 are either equal or conjugate by a unitary in the relative commutant of their intersection. Moreover, when the Hadamard subfactors…
Random projections or sketching are widely used in many algorithmic and learning contexts. Here we study the performance of iterative Hessian sketch for least-squares problems. By leveraging and extending recent results from random matrix…
A new class of harmonic Hadamard manifolds, those spaces called of hypergeometric type, is defined in terms of Gauss hypergeometric equations. Spherical Fourier transform defined on a harmonic Hadamard manifold of hypergeometric type admits…