English
Related papers

Related papers: Constructions and restrictions for balanced splitt…

200 papers

A real symmetric matrix $M$ is completely positive semidefinite if it admits a Gram representation by (Hermitian) positive semidefinite matrices of any size $d$. The smallest such $d$ is called the (complex) completely positive semidefinite…

Optimization and Control · Mathematics 2016-10-27 Sander Gribling , David de Laat , Monique Laurent

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

Very recently, Bai [Linear Algebra Appl., 681:150-186, 2024 \& Appl. Math. Lett., 166:109510, 2025] studied some concrete structures, and obtained essential algebraic and computational properties of the one-dimensional, two-dimensional and…

Rings and Algebras · Mathematics 2025-06-19 Aaisha Be , Nachiketa Mishra , Debasisha Mishra

The concepts of differentiation and integration for matrices are known. As far as each matrix is differentiable, it is not clear a priori whether a given matrix is integrable or not. Recently some progress was obtained for diagonalizable…

Combinatorics · Mathematics 2023-09-08 Suren Danielyan , Alexander Guterman , Elena Kreines , Fedor Pakovich

We introduce a construction that, given a pair (u,v) of complex Hadamard matrices of the same order, generates infinitely many biunitary matrices of varying (and distinct) orders. As a key application, this framework yields nested sequences…

Operator Algebras · Mathematics 2026-01-16 Keshab Chandra Bakshi , Satyajit Guin , Guruprasad

This paper is devoted to introduce and investigate the notion of monotone sets in Hadamard spaces. First, flat Hadamard spaces are introduced and investigated. It is shown that an Hadamard space $X$ is flat if and only if $X\times…

Functional Analysis · Mathematics 2022-07-05 Ali Moslemipour , Mehdi Roohi

We discuss an extension of the almost Hadamard matrix formalism, to the case of complex matrices. Quite surprisingly, the situation here is very different from the one in the real case, and our conjectural conclusion is that there should be…

Combinatorics · Mathematics 2017-05-15 Teodor Banica , Ion Nechita

The definition of balanced metrics was originally given by Donaldson in the case of a compact polarized K\"{a}hler manifold in 2001, who also established the existence of such metrics on any compact projective K\"{a}hler manifold with…

Complex Variables · Mathematics 2014-12-15 Zhiming Feng , Zhenhan Tu

In [8] a notion of generalized Hadamard product was introduced. We show that when certain kinds of tensors interact with the eigenvalues of symmetric matrices the resulting formulae can be nicely expressed using the generalized Hadamard…

Optimization and Control · Mathematics 2007-05-23 Hristo S. Sendov

Although Hadamard matrices have been investigated since the nineteenth century, relatively little is known about their higher-dimensional analogues. In this paper, we introduce two constructions of Hadamard hypercubes. The first…

Combinatorics · Mathematics 2026-05-19 Amin Bahmanian , Sho Suda

We study the partial Hadamard matrices $H\in M_{M\times N}(\mathbb C)$ which are regular, in the sense that the scalar products between pairs of distinct rows decompose as sums of cycles (rotated sums of roots of unity). The simplest…

Combinatorics · Mathematics 2017-06-07 Teodor Banica , Lorenzo Pittau

We study the mathematical structures and relations among some quantities in the theory of quantum entanglement, such as separability, weak Schmidt decompositions, Hadamard matrices etc.. We provide an operational method to identify the…

Quantum Physics · Physics 2014-02-26 Bobo Hua , Shaoming Fei , Juergen Jost , Xianqing Li-Jost

The concept of matrix rigidity was introduced by Valiant(independently by Grigoriev) in the context of computing linear transformations. A matrix is rigid if it is far(in terms of Hamming distance) from any matrix of low rank. Although we…

Computational Complexity · Computer Science 2020-09-22 C. Ramya

We provide a combinatorial study of split matroids, a class that was motivated by the study of matroid polytopes from a tropical geometry point of view. A nice feature of split matroids is that they generalize paving matroids, while being…

Combinatorics · Mathematics 2022-02-10 Kristóf Bérczi , Tamás Király , Tamás Schwarcz , Yutaro Yamaguchi , Yu Yokoi

We construct orthogonal arrays OA$_{\lambda} (k,n)$ (of strength two) having a row that is repeated $m$ times, where $m$ is as large as possible. In particular, we consider OAs where the ratio $m / \lambda$ is as large as possible; these…

Combinatorics · Mathematics 2018-12-14 Charles J. Colbourn , Douglas R. Stinson , Shannon Veitch

A set of vectors of equal norm in $\mathbb{C}^d$ represents equiangular lines if the magnitudes of the inner product of every pair of distinct vectors in the set are equal. The maximum size of such a set is $d^2$, and it is conjectured that…

Combinatorics · Mathematics 2015-01-13 Jonathan Jedwab , Amy Wiebe

We present a new method for constructing affine families of complex Hadamard matrices in every even dimension. This method has an intersection with the Di\c{t}\u{a} construction and it generalizes the Sz\"oll\H{o}si's method. We reproduce…

Quantum Physics · Physics 2013-04-24 D. Goyeneche

The complete classification of all 6x6 complex Hadamard matrices is an open problem. The 3-parameter Karlsson family encapsulates all Hadamards that have been parametrised explicitly. We prove that such matrices satisfy a non-trivial…

Quantum Physics · Physics 2014-10-30 Andrew Maxwell , Stephen Brierley

We will show that in a space of dimension $m$, any family of $2^{m-1}$ distinct Hadamard vectors (where you can choose x or -x but not both) can be partitioned into Hadamard matrices if and only if $m=2^n$ for some n. We will solve this…

Combinatorics · Mathematics 2016-03-02 Peter G. Casazza , Janet C. Tremain

The rigidity of a matrix measures how many of its entries need to be changed in order to reduce its rank to some value. Good lower bounds on the rigidity of an explicit matrix would imply good lower bounds for arithmetic circuits as well as…

Quantum Physics · Physics 2007-05-23 Ronald de Wolf