Related papers: Hadamard Hypercubes
In this paper we introduce a new type of Pascal's pyramids. The new object is called hyperbolic Pascal pyramid since the mathematical background goes back to the regular cube mosaic (cubic honeycomb) in the hyperbolic space. The definition…
A partial Hadamard matrix is a matrix $H\in M_{M\times N}(\mathbb T)$ whose rows are pairwise orthogonal. We associate to each such $H$ a certain quantum semigroup $G$ of quantum partial permutations of $\{1,...,M\}$ and study the…
Efficient estimation of high-dimensional matrices-including covariance and precision matrices-is a cornerstone of modern multivariate statistics. Most existing studies have focused primarily on the theoretical properties of the estimators…
In this paper, we give a construction of doubly even self-orthogonal codes from quasi-symmetric designs. Further, we study orbit matrices of quasi-symmetric designs and give a construction of doubly even self-orthogonal codes from orbit…
The collection of cyclic Hadamard matrices {H = (a_{i - j}) : 0 <= i, j < n, and a_i = -1, 1} of order n is characterized by the orthogonality relation HH^T = nI. Only two of such matrices are currently known. It will be shown that this…
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…
We study structurable algebras of skew-dimension one. We present two different equivalent constructions for such algebras: one in terms of non-linear isotopies of cubic norm structures, and one in terms of hermitian cubic norm structures.…
Let $\mathcal{S}$ be a finite set of integer points in $\mathbb{R}^d$, which we assume has many symmetries, and let $P\in\mathbb{R}^d$ be a fixed point. We calculate the distances from $P$ to the points in $\mathcal{S}$ and compare the…
A combination of hierarchical tree-like data structures and data access patterns from fast multipole methods and hierarchical low-rank approximation of linear operators from H-matrix methods appears to form an algorithmic path forward for…
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…
A difference matrix over a group is a discrete structure that is intimately related to many other combinatorial designs, including mutually orthogonal Latin squares, orthogonal arrays, and transversal designs. Interest in constructing…
We present a survey of recent results, scattered in a series of papers that appeared during past five years, whose common denominator is the use of cubic relations in various algebraic structures. Cubic (or ternary) relations can represent…
We use combinatorial and Fourier analytic arguments to prove various non-existence results on systems of real and complex unbiased Hadamard matrices. In particular, we prove that a complete system of complex mutually unbiased Hadamard…
We use non-perturbative U-duality symmetries of type II strings to construct new vacuum solutions. In some ways this generalizes the F-theory vacuum constructions. We find the possibilities of new vacuum constructions are very limited.…
This paper investigates the problem of listing faces of combinatorial polytopes, such as hypercubes, permutahedra, associahedra, and their generalizations. Firstly, we consider the face lattice, which is the inclusion order of all faces of…
A Hadamard matrix $H$ of order $n$ is a square matrix with entries $\pm 1$ satisfying $HH^T = nI_n$, where $I_n$ is the identity matrix of order $n$. A circulant Hadamard matrix is a Hadamard matrix whose rows are cyclic shifts of one…
Double circulant matrices are introduced and studied. A formula to compute the rank r of a double circulant matrix is exhibited; and it is shown that any consecutive r rows of the double circulant matrix are linearly independent. As a…
We study the problem of constructing mutually unbiased bases in dimension six. This approach is based on an efficient numerical method designed to find solutions to the quantum state reconstruction problem in finite dimensions. Our…
Random matrix models based on an integral over supermatrices are proposed as a natural extension of bosonic matrix models. The subtle nature of superspace integration allows these models to have very different properties from the analogous…
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…