English
Related papers

Related papers: Real Schur norms and Hadamard matrices

200 papers

In this article M\"untz spaces $M_{\Lambda ,C}$ of continuous functions supplied with the absolute maximum norm are considered. An approximation of functions in M\"untz spaces $M_{\Lambda ,C}$ of continuous functions by Fourier series is…

Functional Analysis · Mathematics 2018-12-18 S. V. Ludkowski

The Schur-Horn theorem is a well-known result that characterizes the relationship between the diagonal elements and eigenvalues of a symmetric (Hermitian) matrix. In this paper, we extend this theorem by exploring the eigenvalue…

Numerical Analysis · Mathematics 2026-01-06 Hengzhun Chen , Yingzhou Li

Given a real matrix A with n columns, the problem is to approximate the Gram product AA^T by c << n weighted outer products of columns of A. Necessary and sufficient conditions for the exact computation of AA^T (in exact arithmetic) from c…

Numerical Analysis · Mathematics 2014-05-16 John T. Holodnak , Ilse C. F. Ipsen

We prove that there is no circulant Hadamard matrix $H$ with first row $[h_{1},\ldots,h_{n}]$ of order $n>4$, under a condition about a sum of scalar products of rows of two other circulant matrices of size $n/2$ associated to $H.$

Number Theory · Mathematics 2019-03-25 Luis H. Gallardo

We consider the following data perturbation model, where the covariates incur multiplicative errors. For two $n \times m$ random matrices $U, X$, we denote by $U \circ X$ the Hadamard or Schur product, which is defined as $(U \circ X)_{ij}…

Statistics Theory · Mathematics 2022-12-07 Shuheng Zhou

We obtain a new formula to relate the value of a Schur polynomial with variables $(x_1,\ldots,x_N)$ with values of Schur polynomials at $(1,\ldots,1)$. This allows to study the limit shape of perfect matchings on a square hexagon lattice…

Probability · Mathematics 2021-09-30 Zhongyang Li

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

Computing the permanent of a non-negative matrix is a computationally challenging, \#P-complete problem with wide-ranging applications. We introduce a novel permanental analogue of Schur's determinant formula, leveraging a newly defined…

Discrete Mathematics · Computer Science 2025-09-11 Aditi Laddha , Madhusudhan Reddy Pittu

A classical result by Schoenberg (1942) identifies all real-valued functions that preserve positive semidefiniteness (psd) when applied entrywise to matrices of arbitrary dimension. Schoenberg's work has continued to attract significant…

Combinatorics · Mathematics 2016-04-29 Alexander Belton , Dominique Guillot , Apoorva Khare , Mihai Putinar

We consider the gauged free fermionic matrix model, for a single fermionic matrix. In the large $N$ limit this system describes a $c=1/2$ chiral fermion in $1+1$ dimensions. The Gauss' law constraint implies that to obtain a physical state,…

High Energy Physics - Theory · Physics 2019-05-01 David Berenstein , Robert de Mello Koch

In this note we investigate the existence of flat orthogonal matrices, i.e. real orthogonal matrices with all entries having absolute value close to $\frac{1}{\sqrt{n}}$. Entries of $\pm \frac{1}{\sqrt{n}}$ correspond to Hadamard matrices,…

Combinatorics · Mathematics 2015-05-15 Philippe Jaming , Mate Matolcsi

A matrix $M$ over the finite field $ \mathbb{F}_q $ is called \emph{maximum distance separable} (MDS) if all of its square submatrices are non-singular. These MDS matrices are very important in cryptography and coding theory because they…

Information Theory · Computer Science 2026-02-11 Atif Ahmad Khan , Shakir Ali , Bhupendra Singh

If $c_1(Z) \geq ... \geq c_n(Z)$ denote the Euclidean lengths of the column vectors of any $n \times n$ matrix $Z,$ then a fundamental inequality related to Hadamard products states that $$ \sum_{i=1}^k \sigma_i(X^*Y \circ B) \leq…

Functional Analysis · Mathematics 2017-10-12 Zoltan Leka

In this paper, we study the problem of approximately computing the product of two real matrices. In particular, we analyze a dimensionality-reduction-based approximation algorithm due to Sarlos [1], introducing the notion of nuclear rank as…

Statistics Theory · Mathematics 2014-04-01 Anastasios Kyrillidis , Michail Vlachos , Anastasios Zouzias

Recently the Schur index of ${\cal N}=4$ SYM was evaluated in closed form to all orders including exponential corrections in the large $N$ expansion and for fixed finite $N$. This was achieved by identifying the matrix model which…

High Energy Physics - Theory · Physics 2016-01-27 Nadav Drukker

About last 70s, Haynsworth [6] used a result of the Schur complement to refine a determinant inequality for positive definite matrices. Haynsworth's result was improved by Hartfiel [5]. We extend their result to a larger class of matrices,…

Functional Analysis · Mathematics 2014-10-21 Minghua Lin

The Schur-Horn theorem is a classical result in matrix analysis which characterizes the existence of positive semidefinite matrices with a given diagonal and spectrum. In recent years, this theorem has been used to characterize the…

Functional Analysis · Mathematics 2015-04-03 Matthew Fickus , Justin Marks , Miriam J. Poteet

Let $A, B$ and $X$ be $n\times n$ matrices such that $A, B$ are positive semidefinite. We present some refinements of the matrix Cauchy-Schwarz inequality by using some integration techniques and various refinements of the Hermite--Hadamard…

Functional Analysis · Mathematics 2014-11-25 Mojtaba Bakherad

Understanding the singular value spectrum of a matrix $A \in \mathbb{R}^{n \times n}$ is a fundamental task in countless applications. In matrix multiplication time, it is possible to perform a full SVD and directly compute the singular…

Data Structures and Algorithms · Computer Science 2019-01-04 Cameron Musco , Praneeth Netrapalli , Aaron Sidford , Shashanka Ubaru , David P. Woodruff

Let $A$ be a square complex matrix and $z$ a complex number. The distance, with respect to the spectral norm, from $A$ to the set of matrices which have $z$ as an eigenvalue is less than or equal to the distance from $z$ to the spectrum of…

Spectral Theory · Mathematics 2021-06-03 Gorka Armentia , Juan-Miguel Gracia , Francisco-Enrique Velasco