Related papers: A Result for Orthogonal Plus Rank-1 Matrices
We give necessary and sufficient conditions for a family of inner products in a finite-dimensional vector space $V$ over an arbitrary field $\mathbb{K}$ to have an orthogonal basis relative to all the inner products. Some applications to…
We verify a conjecture on the structure of higher-rank numerical ranges for a wide class of unitary and normal matrices. Using analytic and geometric techniques, we show precisely how the higher-rank numerical ranges for a generic unitary…
Matrices can be decomposed via rank-one approximations: the best rank-one approximation is a singular vector pair, and the singular value decomposition writes a matrix as a sum of singular vector pairs. The singular vector tuples of a…
In this paper, we give estimates for both upper and lower bounds of eigenvalues of a simple matrix. The estimates are shaper than the known results.
A sum of a large-dimensional random matrix polynomial and a fixed low-rank matrix polynomial is considered. The main assumption is that the resolvent of the random polynomial converges to some deterministic limit. A formula for the limit of…
Multiple orthogonal polynomials are a generalization of orthogonal polynomials in which the orthogonality is distributed among a number of orthogonality weights. They appear in random matrix theory in the form of special determinantal point…
Hadamard matrices are square $n\times n$ matrices whose entries are ones and minus ones and whose rows are orthogonal to each other with respect to the standard scalar product in $\Bbb R^n$. Each Hadamard matrix can be transformed to a…
Recently there has been several works estimating the number of $n\times n$ matrices with elements from some finite sets $\mathcal X$ of arithmetic interest and of a given determinant. Typically such results are compared with the trivial…
This note simplifies the proof of a recent result on the oscillation of the prime product in Martens Theorem, and provides a quantitative expression for the error term. In addition, the corresponding oscillation results for the finite sums…
A result on the structure of expansive matrices in an indefinite inner product space is derived, which exhibits the largest unitary compression of the matrix.
We introduce an algebra model to study higher order sum rules for orthogonal polynomials on the unit circle. We build the relation between the algebra model and sum rules, and prove an equivalent expression on the algebra side for the sum…
We elaborate on a connection between the $SU(2)$-valued nonlinear Fourier series and sequences of left and right orthogonal polynomials for complex measures on the unit circle. We show a convergence result for the associated reproducing…
Orthogonal rational functions (ORF) on the unit circle generalize orthogonal polynomials (poles at infinity) and Laurent polynomials (poles at zero and infinity). In this paper we investigate the properties of and the relation between these…
In this paper we study matrix valued orthogonal polynomials of one variable associated with a compact connected Gelfand pair (G,K) of rank one, as a generalization of earlier work by Koornwinder and subsequently by Koelink, van Pruijssen…
In the present paper a new mean value theorem for polynomials of special form is obtained. The case of sums on vertices of a regular polygon is studied. A criterion for a certain equation to be satisfied is obtained.
We determine the structure of linear maps on complex (real) square matrices sending unitary (orthogonal) matrices to multiples of unitary (orthogonal) matrices. The result is used to determine the linear preservers of matrix pairs…
For two matrices $A$ and $B$, and large $n$, we show that most products of $n$ factors of $e^{A/n}$ and $n$ factors of $e^{B/n}$ are close to $e^{A + B}$. This extends the Lie-Trotter formula. The elementary proof is based on the relation…
We present new infinite arctangent sums and infinite sums of products of arctangents. Many previously known evaluations appear as special cases of the general results derived in this paper.
Define the weight of a matrix to be the number of non-zero entries. One would like to count $m$ by $n$ matrices over a finite field by their weight and rank. This is equivalent to determining the probability distribution of the weight while…
We give a proof of the Universality Conjecture for orthogonal and symplectic ensembles of random matrices in the scaling limit for a class of weights w(x)=exp(-V(x)) where V is a polynomial, V(x)=kappa_{2m}x^{2m}+..., kappa_{2m}>0. For such…