Related papers: Almost Hadamard matrices: the case of arbitrary ex…

Building on the blueprint from Goemans and Williamson (1995) for the Max-Cut problem, we construct a polynomial-time approximation algorithm for orthogonally constrained quadratic optimization problems. First, we derive a semidefinite…

A $\{1,-1\}$-matrix $H$ of order $m$ is a Hadamard matrix if $HH^T=mI_m$, where $T$ is the transposition operator and $I_m$ the identity matrix of order $m$. J. Hadamard published his paper on Hadamard matrices in 1893. Five years later,…

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…

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 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 establish some Hadamard-type inequalities based on coordinated quasi-convexity. Also we define a new mapping associated to coordinated convexity and we prove some properties of this mapping.

It is proved the existence of entire solutions of the Laplace's and minimal hypersurface's PDEs on a Hadamard manifold $M$ under certain curvature conditions by investigating the asymptotic Dirichlet's problems for these PDEs. In the…

We study one-dimensional Schr\"odinger operators $\operatorname{H} = -\partial_x^2 + V$ with unbounded complex potentials $V$ and derive asymptotic estimates for the norm of the resolvent, $\Psi(\lambda) := \| (\operatorname{H} -…

There are two basic ways of weakening the definition of the well-known metric regularity property by fixing one of the points involved in the definition. The first resulting property is called metric subregularity and has attracted a lot of…

For weighted $L^1$ space on the unit sphere of $\RR^{d+1}$, in which the weight functions are invariant under finite reflection groups, a maximal function is introduced and used to prove the almost everywhere convergence of orthogonal…

Turyn prove that if a circulant Hadamard matrix of order $n$ exists then $n$ must be of the form $n=4m^{2}$ for some odd integer $m$. In this paper we use the structure constant of Schur ring of $\Z_{2}^{4m^{2}}$ to prove that there is no…

For $n \geq 3$, an asymptotic formula is derived for the number of representations of a sufficiently large natural number $N$ in the form $p_1+p_2+m^n=N$, where $p_1$, $p_2$ $-$ prime numbers, $m$ $-$ natural number satisfying the…

Approximate algebraic structures play a defining role in arithmetic combinatorics and have found remarkable applications to basic questions in number theory and pseudorandomness. Here we study approximate representations of finite groups:…

We study Hamamoto's expanding square argument towards a 1-D minimisation problem related to the sharp solenoidal uncertainty principle. Working in the right function space, we recast the involved interpolation type inequality into an exact…

In this paper, we study linearly constrained optimization problems (LCP). After applying Hadamard parametrization, the feasible set of the parametrized problem (LCPH) becomes an algebraic variety, with conducive geometric properties which…

For products $P_N$ of $N$ random matrices of size $d \times d$, there is a natural notion of finite $N$ Lyapunov exponents $\{\mu_i\}_{i=1}^d$. In the case of standard Gaussian random matrices with real, complex or real quaternion elements,…

We address combinatorial problems that can be formulated as minimization of a partially separable function of discrete variables (energy minimization in graphical models, weighted constraint satisfaction, pseudo-Boolean optimization, 0-1…

We prove tight bounds for the $\infty$-norm of the inverse of symmetric, diagonally dominant positive matrices. We also prove a new lower-bound form of Hadamard's inequality for the determinant of diagonally dominant positive matrices and…

The Hadamard maximal determinant problem asks for the largest n-by-n determinant with entries in {+1,-1}. When n is congruent to 1 (mod 4), the maximal excess construction of Farmakis & Kounias has been the most successful general method…

We investigate quasi-free Hadamard states defined via characteristic initial data on null cones centred at the axis of symmetry in spherically symmetric space-times. We characterize the necessary singular behaviour of null boundary…