Related papers: Hadamard Matrix Torsion

A complex Hadamard matrix is a square matrix W with complex entries of absolute value 1 satisfying WW*=nI, where * stands for the Hermitian transpose and I is the identity matrix of order n. In this paper, we give constructions of complex…

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 show that computing the Tutte polynomial of a linear matroid of dimension $k$ on $k^{O(1)}$ points over a field of $k^{O(1)}$ elements requires $k^{\Omega(k)}$ time unless the \#ETH---a counting extension of the Exponential Time…

In this paper, we study $\Delta$- convergence of iterations for a sequence of strongly quasi-nonexpansive mappings as well as the strong convergence of the Halpern type regularization of them in Hadamard spaces. Then, we give some their…

We give a new explicit construction of $n\times N$ matrices satisfying the Restricted Isometry Property (RIP). Namely, for some c>0, large N and any n satisfying N^{1-c} < n < N, we construct RIP matrices of order k^{1/2+c}. This overcomes…

Necessary and sufficient conditions for the existence of a hyper-parahermitian connection with totally skew-symmetric torsion (HPKT-structure) are presented. It is shown that any HPKT-structure is locally generated by a real (potential)…

We generalize to $n$-torsion a result of Kempf's describing $2$-torsion points lying on a theta divisor. This is accomplished by means of certain semihomogeneous vector bundles introduced and studied by Mukai and Oprea. As an application,…

It is shown that an HKT-space with closed parallel potential 1-form has $D(2,1;-1)$-symmetry. Every locally conformally hyperk\"ahler manifold generates this type of geometry. The HKT-spaces with closed parallel potential 1-form arising in…

A tower for a (2+1)-dimensional Toda type system is constructed in terms of a series expansion of operators which can be interpreted as generalized Bessel coefficients; the result is formulated as an analog of the Baker-Campbell-Hausdorff…

Let $X$ be an $(n-2)$-connected $2n$-dimensional Poincar\'e complex with torsion-free homology, where $n\geq 4$. We prove that $X$ can be decomposed into a connected sum of two Poincar\'e complexes: one being $(n-1)$-connected, while the…

We give a simple explicit construction of the Grassmannian n-logarithm, which is a multivalued analytic function on the quotient of the Grassmannian of generic n-dimensional subspaces in 2n-dimensional coordinate complex vector space by the…

We study the automorphic theta representation $\Theta_{2n}^{(r)}$ on the $r$-fold cover of the symplectic group $Sp_{2n}$. This representation is obtained from the residues of Eisenstein series on this group. If $r$ is odd, $n\le r <2n$,…

Given a set $\Sigma$ of spheres in $\mathbb{E}^d$, with $d\ge{}3$ and $d$ odd, having a fixed number of $m$ distinct radii $\rho_1,\rho_2,...,\rho_m$, we show that the worst-case combinatorial complexity of the convex hull $CH_d(\Sigma)$ of…

In our previous work, we introduced the following relaxation of the Hadamard property: a square matrix $H\in M_N(\mathbb R)$ is called "almost Hadamard" if $U=H/\sqrt{N}$ is orthogonal, and locally maximizes the 1-norm on O(N). We review…

We study $m \times n$ matrices whose columns are of the form \[\{(a_{1j},\ldots, a_{nj}): \quad a_{1j} = \lambda_j,\ a_{ij} = \pm\lambda_j\ , \ \lambda_j >0 ,\ j=1,2,\ldots,n\}.\] We explicitly construct for all $a = (a_1,\ldots,…

We show that the hafnian of a symmetric $2n\times 2n$ matrix of $\operatorname{poly}(n)$-bit integers (which counts the number of perfect matchings of a $2n$-vertex graph) and the number of Hamiltonian cycles of an $n$-vertex directed graph…

We show that 138 odd values of n less than 10000 for which one knows how to construct a Hadamard matrix of order 4n have been overlooked in the recent handbook of combinatorial designs. There are four additional odd n, namely 191, 5767,…

Divide-and-conquer is a central paradigm for the design of algorithms, through which some fundamental computational problems, such as sorting arrays and computing convex hulls, are solved in optimal time within $\Theta(n\log{n})$ in the…

A $2n\times 2n$ real matrix $A$ is said to be a Hamiltonian matrix if $A^{T}J+JA=0$, where $J=\left( \begin{array}{cc} 0 & I_{n} \\ -I_{n} & 0\\ \end{array} \right)$. Hamiltonian matrices appear in many areas of applications, such as linear…

Quaternary unit Hadamard (QUH) matrices were introduced by Fender, Kharagani and Suda along with a method to construct them at prime power orders. We present a novel construction of real Hadamard matrices from QUH matrices. Our construction…