Related papers: A Note on Approximate Hadamard Matrices
We provide exact and asymptotic formulae for the number of unrestricted, respectively indecomposable, $d$-dimensional matrices where the sum of all matrix entries with one coordinate fixed equals 2.
The McCarty Conjecture states that any McCarty Matrix (an $n\times n$ matrix $A$ with positive integer entries and each of the $2n$ row and column sums equal to $n$), can be additively decomposed into two other matrices, $B$ and $C$, such…
We prove that if $A$ and $B$ are Hadamard matrices which are both of size $4 \times 4$ or $5 \times 5$ and in dephased form, then $tr(A) = tr(B)$ implies that $A$ and $B$ have the same eigenvalues, including multiplicity. We calculate…
Consider a random matrix $H:\mathbb{R}^n\longrightarrow\mathbb{R}^m$. Let $D\geq2$ and let $\{W_l\}_{l=1}^{p}$ be a set of $k$-dimensional affine subspaces of $\mathbb{R}^n$. We ask what is the probability that for all $1\leq l\leq p$ and…
By analyzing the connection between complex Hadamard matrices and spectral sets we prove the direction ``spectral -> tile'' of the Sectral Set Conjecture for all sets A of size at most 5 in any finite Abelian group. This result is then…
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…
A question going back to Halmos asks when two approximately commuting matrices of a certain kind are close to exactly commuting matrices of the same kind. It has long been known that there is a winding number obstruction for approximately…
We study the maximum absolute value of the determinant of matrices with entries in the set of $\ell$-th roots of unity; this is a generalization of $D$-optimal designs and Hadamard's maximal determinant problem, which involves $\pm 1$…
Using reversible Hadamard difference sets, we construct symmetric Bush-type Hadamard matrices of order $4m^4$ for all odd integer $m$.
We consider random $n\times n$ matrices of the form $Y_n=\frac1{\sqrt{d}}A_n\circ X_n$, where $A_n$ is the adjacency matrix of a uniform random $d$-regular directed graph on $n$ vertices, with $d=\lfloor p n\rfloor$ for some fixed $p \in…
A matrix $H=[d_{ij}]$ is a generalized Hadamard matrix of order $u\lambda$ with entries from $U$ which is a finite group of order $u$ (for short $\mathrm{GH}(u,\,\lambda)$) such that whenever $i\neq \ell$ the set $\{d_{ij}d_{\ell…
Let $\Gamma$ denote an undirected, connected, regular graph with vertex set $X$, adjacency matrix $A$, and ${d+1}$ distinct eigenvalues. Let ${\mathcal A}={\mathcal A}(\Gamma)$ denote the subalgebra of Mat$_X({\mathbb C})$ generated by $A$.…
We present a class of lattices in R^d (d >= 2) which we call GL-lattices and conjecture that any lattice is such. This conjecture is referred to as GLC. Littlewood's conjecture amounts to saying that Z^2 is GL. We then prove existence of GL…
A combinatorial rectangle may be viewed as a matrix whose entries are all +-1. The discrepancy of an m by n matrix is the maximum among the absolute values of its m row sums and n column sums. In this paper, we investigate combinatorial…
Let $Q_n=[0,1]^n$ be the unit cube in ${\mathbb R}^n$, $n \in {\mathbb N}$. For a nondegenerate simplex $S\subset{\mathbb R}^n$, consider the value $\xi(S)=\min \{\sigma>0: Q_n\subset \sigma S\}$. Here $\sigma S$ is a homothetic image of…
Let $\a$ be a complex random variable with mean zero and bounded variance $\sigma^{2}$. Let $N_{n}$ be a random matrix of order $n$ with entries being i.i.d. copies of $\a$. Let $\lambda_{1}, ..., \lambda_{n}$ be the eigenvalues of…
Butson matrices are complex Hadamard matrices with entries in the complex roots of unity of given order. There is an interesting code in phase space related to this matrix (Armario et al. 2023). We study the covering radius of Butson…
A circulant weighing matrix $W = (w_{i,j})$ is a square matrix of order $n$ and entries $w_{i,j}$ in $\{0, \pm 1\}$ such that $WW^T=kI_n$. In his thesis, Strassler gave a table of existence results for such matrices with $n \leq 200$ and $k…
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…
We define a random commuting $d$-tuple of $n$-by-$n$ matrices to be a random variable that takes values in the set of commuting $d$-tuples and has a distribution that is a rapidly decaying continuous weight on this algebraic set. In the…