English
Related papers

Related papers: Asymptotically optimal approximate Hadamard matric…

200 papers

Complex Hadamard matrices have received considerable attention in the past few years due to their appearance in quantum information theory. While a complete characterization is currently available only up to order 5 (in \cite{haagerup}),…

Classical Analysis and ODEs · Mathematics 2007-05-23 Máté Matolcsi , Ferenc Szöllősi

The problem of approximating a matrix by a low-rank one has been extensively studied. This problem assumes, however, that the whole matrix has a low-rank structure. This assumption is often false for real-world matrices. We consider the…

Data Structures and Algorithms · Computer Science 2025-11-05 Martino Ciaperoni , Aristides Gionis , Heikki Mannila

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…

Combinatorics · Mathematics 2019-02-05 Ondřej Turek , Dardo Goyeneche

The normal sequences NS(n) and near-normal sequences NN(n) play an important role in the construction of orthogonal designs and Hadamard matrices. They can be identified with certain base sequences (A;B;C;D), where A and B have length n+1…

Combinatorics · Mathematics 2010-06-18 Dragomir Z. Djokovic

We show that, for a fixed order $\gamma\geq 1$, each local minimizer of a rather general nonsmooth optimization problem in Euclidean spaces is either M-stationary in the classical sense (corresponding to stationarity of order $1$),…

Optimization and Control · Mathematics 2023-02-10 Matúš Benko , Patrick Mehlitz

We consider the extremal family of graphs of order $2^n$ in which no two vertices have identical neighbourhoods, yet the adjacency matrix has rank only $n$ over the field of two elements. A previous result from algebraic geometry shows that…

Combinatorics · Mathematics 2022-09-20 Gal Beniamini , Asaf Etgar , Yael Kirkpatrick

We prove explicit lower bounds for the smallest singular value and upper bounds for the condition number of rectangular, multivariate Vandermonde matrices with scattered nodes on the complex unit circle. Analogously to the Shannon-Nyquist…

Numerical Analysis · Mathematics 2021-03-16 Stefan Kunis , Dominik Nagel , Anna Strotmann

The approximation of matrices to the sum of tensor products of Hermitian matrices is studied. A minimum decomposition of matrices on tensor space $H_1\otimes H_2$ in terms of the sum of tensor products of Hermitian matrices on $H_1$ and…

Quantum Physics · Physics 2009-11-13 Shao-Ming Fei , Naihuan Jing , Bao-Zhi Sun

We introduce and study the problem of consistent low-rank approximation, in which rows of an input matrix $\mathbf{A}\in\mathbb{R}^{n\times d}$ arrive sequentially and the goal is to provide a sequence of subspaces that well-approximate the…

Data Structures and Algorithms · Computer Science 2026-03-03 David P. Woodruff , Samson Zhou

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…

Operator Algebras · Mathematics 2025-09-17 Keshab Chandra Bakshi , Satyajit Guin , Guruprasad

For nonexpansive fixed-point problems, Halpern's method with optimal parameters, its so-called H-dual algorithm, and in fact, an infinite family of algorithms containing them, all exhibit the exactly minimax optimal convergence rates. In…

Optimization and Control · Mathematics 2025-11-20 TaeHo Yoon , Ernest K. Ryu , Benjamin Grimmer

An important yet challenging problem in numerical linear algebra is finding a principal submatrix with maximum determinant from a given symmetric positive semidefinite matrix. This problem arises in experimental design, statistics, and…

Optimization and Control · Mathematics 2026-05-26 Hao Hu , Stefan Sremac , Hugo J. Woerdeman , Henry Wolkowicz

In this article, we introduce the notion of almost consecutive partitions. A partition is almost consecutive if every term is consecutive, with the possible exception of the smallest one. We find formulas relating to the smallest parts of…

Combinatorics · Mathematics 2024-03-26 Rajat Gupta , Noah Lebowitz-Lockard

For a nonsingular integer matrix A, we study the growth of the order of A modulo N. We say that a matrix is exceptional if it is diagonalizable, and a power of the matrix has all eigenvalues equal to powers of a single rational integer, or…

Number Theory · Mathematics 2009-11-10 Pietro Corvaja , Zeev Rudnick , Umberto Zannier

For $U\in O(N)$ we have $||U||_1\leq N\sqrt{N}$, with equality if and only if $U=H/\sqrt{N}$, with $H$ Hadamard matrix. Motivated by this remark, we discuss in this paper the algebraic and analytic aspects of the computation of the maximum…

Functional Analysis · Mathematics 2019-02-27 Teodor Banica , Benoit Collins , Jean-Marc Schlenker

In this paper, we consider the equilibrium problems and also their regularized problems under the setting of Hadamard spaces. The solution to the regularized problem is represented in terms of resolvent operators. As an essential machinery…

Optimization and Control · Mathematics 2018-07-31 Poom Kumam , Parin Chaipunya

For a given irrational number, we consider the properties of best rational approximations of given parities. There are three different kinds of rational numbers according to the parity of the numerator and denominator, say odd/odd, even/odd…

Number Theory · Mathematics 2024-03-20 Dong Han Kim , Seul Bee Lee , Lingmin Liao

In this paper, we obtain some new matrix inequalities involving Hadamard product. Also some Hadamard product inequalities for accretive matrices involving the matrix means, positive unital linear maps and matrix concave functions are…

Functional Analysis · Mathematics 2023-08-22 A. Sheikhhosseini , S. Malekinejad , M. Khosravi

We describe a construction of three-dimensional Hadamard matrices of even order $v$ such that $v-1$ is a prime power. The construction covers infinitely many orders for which the existence was previously open.

Combinatorics · Mathematics 2025-09-30 Vedran Krčadinac , Mario Osvin Pavčević , Kristijan Tabak

We systematically explore the new method of construction (known as the propus construction) of symmetric Hadamard matrices for small orders, $4v$. In particular we give the first examples of symmetric Hadamard matrices of order $156=4\cdot…

Combinatorics · Mathematics 2018-01-10 N. A. Balonin , Y. N. Balonin , D. Z. Djokovic , D. A. Karbovskiy , M. B. Sergeev