Every Matrix is a Product of Toeplitz Matrices

We show that every \(n\,\times \,n\) matrix is generically a product of \(\lfloor n/2 \rfloor + 1\) Toeplitz matrices and always a product of at most \(2n+5\) Toeplitz matrices. The same result holds true if the word ‘Toeplitz’ is replaced by ‘Hankel,’ and the generic bound \(\lfloor n/2 \rfloor + 1\) is sharp. We will see that these decompositions into Toeplitz or Hankel factors are unusual: We may not, in general, replace the subspace of Toeplitz or Hankel matrices by an arbitrary \((2n-1)\)-dimensional subspace of \({n\,\times \,n}\) matrices. Furthermore, such decompositions do not exist if we require the factors to be symmetric Toeplitz or persymmetric Hankel, even if we allow an infinite number of factors.     

Robust Hadamard Matrices,Unistochastic Rays in Birkhoff Polytope and Equi-Entangled Bases in Composite Spaces

We study a special class of (real or complex) robust Hadamard matrices, distinguished by the property that their projection onto a 2-dimensional subspace forms a Hadamard matrix. It is shown that such a matrix of order n exists, if there exists a skew Hadamard matrix or a symmetric conference matrix of this size. This is the case for any even \(n\le 20\), and for these dimensions we demonstrate that a bistochastic matrix B located at any ray of the Birkhoff polytope, (which joins the center of this body with any permutation matrix), is unistochastic. An explicit form of the corresponding unitary matrix U, such that \(B_{ij}=|U_{ij}|^2\), is determined by a robust Hadamard matrix. These unitary matrices allow us to construct a family of orthogonal bases in the composed Hilbert space of order \(n \times n\). Each basis consists of vectors with the same degree of entanglement and the constructed family interpolates between the product basis and the maximally entangled basis. In the case \(n=4\) we study geometry of the set \({\mathcal U}_4\) of unistochastic matrices, conjecture that this set is star-shaped and estimate its relative volume in the Birkhoff polytope \({\mathcal B}_4\).     

Computing the Permanent of (Some) Complex Matrices

We present a deterministic algorithm, which, for any given \(0< \epsilon < 1\) and an \(n \times n\) real or complex matrix \(A=\left( a_{ij}\right) \) such that \(\left| a_{ij}-1 \right| \le 0.19\) for all \(i, j\) computes the permanent of \(A\) within relative error \(\epsilon \) in \(n^{O\left( \ln n -\ln \epsilon \right) }\) time. The method can be extended to computing hafnians and multidimensional permanents.     

Relative Difference Sets and Hadamard Matrices from Perfect Quaternionic Arrays

Let \(G=\mathbf{C}_{n_1}\times \cdots \times \mathbf{C}_{n_m}\) be an abelian group of order \(n=n_1\dots n_m\), where each \(\mathbf{C}_{n_t}\) is cyclic of order \(n_t\). We present a correspondence between the (4n, 2, 4n, 2n)-relative difference sets in \(G\times Q_8\) relative to the centre \(Z(Q_8)\) and the perfect arrays of size \(n_1\times \dots \times n_m\) over the quaternionic alphabet \(Q_8\cup qQ_8\), where \(q=(1+i+j+k)/2\). In view of this connection, for \(m=2\) we introduce new families of relative difference sets in \(G\times Q_8\), as well as new families of Williamson and Ito Hadamard matrices with G-invariant components.     

Singular Values Distribution of Squares of Elliptic Random Matrices and Type B Narayana Polynomials

We consider Gaussian elliptic random matrices X of a size \(N \times N\) with parameter \(\rho \), i.e., matrices whose pairs of entries \((X_{ij}, X_{ji})\) are mutually independent Gaussian vectors with \(\mathbb {E}\,X_{ij} = 0\), \(\mathbb {E}\,X^2_{ij} = 1\) and \(\mathbb {E}\,X_{ij} X_{ji} = \rho \). We are interested in the asymptotic distribution of eigenvalues of the matrix \(W =\frac{1}{N^2} X^2 X^{*2}\). We show that this distribution is determined by its moments, and we provide a recurrence relation for these moments. We prove that the (symmetrized) asymptotic distribution is determined by its free cumulants, which are Narayana polynomials of type B:

$$\begin{aligned} c_{2n} = \sum _{k=0}^n {\left( {\begin{array}{c}n\\ k\end{array}}\right) }^2 \rho ^{2k}. \end{aligned}$$

     

Central Limit Theorem for Linear Eigenvalue Statistics for a Tensor Product Version of Sample Covariance Matrices

For \(k,m,n\in {\mathbb {N}}\), we consider \(n^k\times n^k\) random matrices of the form

$$\begin{aligned} {\mathcal {M}}_{n,m,k}({\mathbf {y}})=\sum _{\alpha =1}^m\tau _\alpha {Y_\alpha }Y_\alpha ^T,\quad {Y}_\alpha ={\mathbf {y}}_\alpha ^{(1)}\otimes \cdots \otimes {\mathbf {y}}_\alpha ^{(k)}, \end{aligned}$$

where \(\tau _{\alpha }\), \(\alpha \in [m]\), are real numbers and \({\mathbf {y}}_\alpha ^{(j)}\), \(\alpha \in [m]\), \(j\in [k]\), are i.i.d. copies of a normalized isotropic random vector \({\mathbf {y}}\in {\mathbb {R}}^n\). For every fixed \(k\ge 1\), if the Normalized Counting Measures of \(\{\tau _{\alpha }\}_{\alpha }\) converge weakly as \(m,n\rightarrow \infty \), \(m/n^k\rightarrow c\in [0,\infty )\) and \({\mathbf {y}}\) is a good vector in the sense of Definition 1.1, then the Normalized Counting Measures of eigenvalues of \({\mathcal {M}}_{n,m,k}({\mathbf {y}})\) converge weakly in probability to a nonrandom limit found in Marchenko and Pastur (Math USSR Sb 1:457–483, 1967). For \(k=2\), we define a subclass of good vectors \({\mathbf {y}}\) for which the centered linear eigenvalue statistics \(n^{-1/2}{{\mathrm{Tr}}}\varphi ({\mathcal {M}}_{n,m,2}({\mathbf {y}}))^\circ \) converge in distribution to a Gaussian random variable, i.e., the Central Limit Theorem is valid.

     

Hyperinvariant Subspace Problem for Some Classes of Operators

An n-normal operator may be defined as an \(n \times n\) operator matrix with entries that are mutually commuting normal operators and an operator \(T \in \mathcal {B(H)}\) is quasi-nM-hyponormal (for \(n \in \mathbb {N}\)) if it is unitarily equivalent to an \(n \times n\) upper triangular operator matrix \((T_{ij})\) acting on \(\mathcal {K}^{(n)}\), where \(\mathcal {K}\) is a separable complex Hilbert space and the diagonal entries \(T_{jj}\) \((j = 1,2,\ldots , n)\) are M-hyponormal operators in \(\mathcal {B(K)}\). This is an extended notion of n-normal operators. We prove a necessary and sufficient condition for an \(n \times n\) triangular operator matrix to have Bishop’s property \((\beta )\). This leads us to study the hyperinvariant subspace problem for an \(n \times n\) triangular operator matrix.     

Euclidean Distance Between Haar Orthogonal and Gaussian Matrices

In this work, we study a version of the general question of how well a Haar-distributed orthogonal matrix can be approximated by a random Gaussian matrix. Here, we consider a Gaussian random matrix \(Y_n\) of order n and apply to it the Gram–Schmidt orthonormalization procedure by columns to obtain a Haar-distributed orthogonal matrix \(U_n\). If \(F_i^m\) denotes the vector formed by the first m-coordinates of the ith row of \(Y_n-\sqrt{n}U_n\) and \(\alpha \,=\,\frac{m}{n}\), our main result shows that the Euclidean norm of \(F_i^m\) converges exponentially fast to \(\sqrt{ \big (2-\frac{4}{3} \frac{(1-(1 -\alpha )^{3/2})}{\alpha }\big )m}\), up to negligible terms. To show the extent of this result, we use it to study the convergence of the supremum norm \(\epsilon _n(m)\,=\,\sup _{1\le i \le n, 1\le j \le m} |y_{i,j}- \sqrt{n}u_{i,j}|\) and we find a coupling that improves by a factor \(\sqrt{2}\) the recently proved best known upper bound on \(\epsilon _n(m)\). Our main result also has applications in Quantum Information Theory.     

Matrix Gegenbauer Polynomials: The $$2\times 2$$ Fundamental Cases

In this paper, we exhibit explicitly a sequence of \(2 \times 2\) matrix valued orthogonal polynomials with respect to a weight \(W_{p,n}\), for any pair of real numbers p and n such that \(0<p<n\). The entries of these polynomiales are expressed in terms of the Gegenbauer polynomials \(C_k^\lambda \). The corresponding three-term recursion relations are also given, and we make some studies of the algebra of differential operators associated with the weight \(W_{p,n}\).     

New constructions of permutation polynomials of the form $$x^rh\left( x^{q-1}\right) $$ over $${\mathbb F}_{q^2}$$Fq2

Permutation polynomials over finite fields have been studied extensively recently due to their wide applications in cryptography, coding theory, communication theory, among others. Recently, several authors have studied permutation trinomials of the form \(x^rh\left( x^{q-1}\right) \) over \({\mathbb F}_{q^2}\), where \(q=2^k\), \(h(x)=1+x^s+x^t\) and \(r, k>0, s, t\) are integers. Their methods are essentially usage of a multiplicative version of AGW Criterion because they all transformed the problem of proving permutation polynomials over \({\mathbb F}_{q^2}\) into that of showing the corresponding fractional polynomials permute a smaller set \(\mu _{q+1}\), where \(\mu _{q+1}:=\{x\in \mathbb {F}_{q^2} : x^{q+1}=1\}\). Motivated by these results, we characterize the permutation polynomials of the form \(x^rh\left( x^{q-1}\right) \) over \({\mathbb F}_{q^2}\) such that \(h(x)\in {\mathbb F}_q[x]\) is arbitrary and q is also an arbitrary prime power. Using AGW Criterion twice, one is multiplicative and the other is additive, we reduce the problem of proving permutation polynomials over \({\mathbb F}_{q^2}\) into that of showing permutations over a small subset S of a proper subfield \({\mathbb F}_{q}\), which is significantly different from previously known methods. In particular, we demonstrate our method by constructing many new explicit classes of permutation polynomials of the form \(x^rh\left( x^{q-1}\right) \) over \({\mathbb F}_{q^2}\). Moreover, we can explain most of the known permutation trinomials, which are in Ding et al. (SIAM J Discret Math 29:79–92, 2015), Gupta and Sharma (Finite Fields Appl 41:89–96, 2016), Li and Helleseth (Cryptogr Commun 9:693–705, 2017), Li et al. (New permutation trinomials constructed from fractional polynomials, arXiv: 1605.06216v1, 2016), Li et al. (Finite Fields Appl 43:69–85, 2017) and Zha et al. (Finite Fields Appl 45:43–52, 2017) over finite field with even characteristic.     

On the Almost Sure Location of the Singular Values of Certain Gaussian Block-Hankel Large Random Matrices

This paper studies the almost sure location of the eigenvalues of matrices \({\mathbf{W}}_N {\mathbf{W}}_N^{*}\), where \({\mathbf{W}}_N = ({\mathbf{W}}_N^{(1)T}, \ldots , {\mathbf{W}}_N^{(M)T})^{T}\) is a \({\textit{ML}} \times N\) block-line matrix whose block-lines \(({\mathbf{W}}_N^{(m)})_{m=1, \ldots , M}\) are independent identically distributed \(L \times N\) Hankel matrices built from i.i.d. standard complex Gaussian sequences. It is shown that if \(M \rightarrow +\infty \) and \(\frac{{\textit{ML}}}{N} \rightarrow c_* (c_* \in (0, \infty ))\), then the empirical eigenvalue distribution of \({\mathbf{W}}_N {\mathbf{W}}_N^{*}\) converges almost surely towards the Marcenko–Pastur distribution. More importantly, it is established using the Haagerup–Schultz–Thorbjornsen ideas that if \(L = O(N^{\alpha })\) with \(\alpha < 2/3\), then, almost surely, for \(N\) large enough, the eigenvalues of \({\mathbf{W}}_N {\mathbf{W}}_N^{*}\) are located in the neighbourhood of the Marcenko–Pastur distribution. It is conjectured that the condition \(\alpha < 2/3\) is optimal.     

The finite basis problem for infinite involution semigroups of triangular 2 $$\times $$ 2 matrices

Let \(T_n(\mathbb {F})\) and \(UT_n(\mathbb {F})\) be the semigroups of all upper triangular \(n\times n\) matrices and all upper triangular \(n\times n\) matrices with 0s and/or 1s on the main diagonal over a field \(\mathbb {F}\) with \(\mathsf {char}(\mathbb {F})=0\), respectively. In this paper, we address the finite basis problem for \(T_2(\mathbb {F})\) and \(UT_2(\mathbb {F})\) as involution semigroups under the skew transposition. By giving a sufficient condition under which an involution semigroup is nonfinitely based, we show that both \(T_2(\mathbb {F})\) and \(UT_2(\mathbb {F})\) are nonfinitely based, and that there is a continuum of nonfinitely based involution monoid varieties between the involution monoid variety \(\mathsf {var} UT_2(\mathbb {F})\) generated by \(UT_2(\mathbb {F})\) and the involution monoid variety \(\mathsf {var} T_2(\mathbb {F})\) generated by \(T_2(\mathbb {F})\). Moreover, \(\mathsf {var} UT_2(\mathbb {F})\) cannot be defined within \(\mathsf {var} T_2(\mathbb {F})\) by any finite set of identities.     

No Outliers in the Spectrum of the Product of Independent Non-Hermitian Random Matrices with Independent Entries

We consider products of independent square random non-Hermitian matrices. More precisely, let \(n\ge 2\) and let \(X_1,\ldots ,X_n\) be independent \(N\times N\) random matrices with independent centered entries (either real or complex with independent real and imaginary parts) with variance \(N^{-1}\). In Götze and Tikhomirov (On the asymptotic spectrum of products of independent random matrices, 2011. arXiv:1012.2710) and O’Rourke and Soshnikov (Electron J Probab 16(81):2219–2245, 2011) it was shown that the limit of the empirical spectral distribution of the product \(X_1\cdots X_n\) is supported in the unit disk. We prove that if the entries of the matrices \(X_1,\ldots ,X_n\) satisfy uniform subexponential decay condition, then the spectral radius of \(X_1\cdots X_n\) converges to 1 almost surely as \(N\rightarrow \infty \).     

Extremal eigenvalues and eigenvectors of deformed Wigner matrices

We consider random matrices of the form \(H = W + \lambda V, \lambda \in {\mathbb {R}}^+\), where \(W\) is a real symmetric or complex Hermitian Wigner matrix of size \(N\) and \(V\) is a real bounded diagonal random matrix of size \(N\) with i.i.d. entries that are independent of \(W\). We assume subexponential decay of the distribution of the matrix entries of \(W\) and we choose \(\lambda \sim 1\), so that the eigenvalues of \(W\) and \(\lambda V\) are typically of the same order. Further, we assume that the density of the entries of \(V\) is supported on a single interval and is convex near the edges of its support. In this paper we prove that there is \(\lambda _+\in {\mathbb {R}}^+\) such that the largest eigenvalues of \(H\) are in the limit of large \(N\) determined by the order statistics of \(V\) for \(\lambda >\lambda _+\). In particular, the largest eigenvalue of \(H\) has a Weibull distribution in the limit \(N\rightarrow \infty \) if \(\lambda >\lambda _+\). Moreover, for \(N\) sufficiently large, we show that the eigenvectors associated to the largest eigenvalues are partially localized for \(\lambda >\lambda _+\), while they are completely delocalized for \(\lambda <\lambda _+\). Similar results hold for the lowest eigenvalues.     

A Perron-Frobenius-type Theorem for Positive Matrix Semigroups

One consequence of the Perron–Frobenius Theorem on indecomposable positive matrices is that whenever an \(n\times n\) matrix A dominates a non-singular positive matrix, there is an integer k dividing n such that, after a permutation of basis, A is block-monomial with \(k\times k\) blocks. Furthermore, for suitably large exponents, the nonzero blocks of \(A^m\) are strictly positive. We present an extension of this result for indecomposable semigroups of positive matrices.     

Map determined by rank-$$\varvec{}$$ matrice for relatively mall $$\varvec{}$$

Let n and s be integers such that \(1\le s<\frac{n}{2}\), and let \(M_n(\mathbb {K})\) be the ring of all \(n\times n\) matrices over a field \(\mathbb {K}\). Denote by \([\frac{n}{s}]\) the least integer m with \(m\ge \frac{n}{s}\). In this short note, it is proved that if \(g:M_n(\mathbb {K})\rightarrow M_n(\mathbb {K})\) is a map such that \(g\left( \sum _{i=1}^{[\frac{n}{s}]}A_i\right) =\sum _{i=1}^{[\frac{n}{s}]}g(A_i)\) holds for any \([\frac{n}{s}]\) rank-s matrices \(A_1,\ldots ,A_{[\frac{n}{s}]}\in M_n(\mathbb {K})\), then \(g(x)=f(x)+g(0)\), \(x\in M_n(\mathbb {K})\), for some additive map \(f:M_n(\mathbb {K})\rightarrow M_n(\mathbb {K})\). Particularly, g is additive if \(char\mathbb {K}\not \mid \left( [\frac{n}{s}]-1\right) \).     

Explicit factorizations of cyclotomic polynomials over finite fields

Let q be a prime power and let \({\mathbb {F}}_q\) be a finite field with q elements. This paper discusses the explicit factorizations of cyclotomic polynomials over \(\mathbb {F}_q\). Previously, it has been shown that to obtain the factorizations of the \(2^{n}r\)th cyclotomic polynomials, one only need to solve the factorizations of a finite number of cyclotomic polynomials. This paper shows that with an additional condition that \(q\equiv 1 \pmod p\), the result can be generalized to the \(p^{n}r\)th cyclotomic polynomials, where p is an arbitrary odd prime. Applying this result we discuss the factorization of cyclotomic polynomials over finite fields. As examples we give the explicit factorizations of the \(3^{n}\)th, \(3^{n}5\)th and \(3^{n}7\)th cyclotomic polynomials.     

On limit theorems for Banach-space-valued linear processes

Let \( {\left( {{\epsilon_i}} \right)_{i \in \mathbb{Z}}} \) be i.i.d. random elements in a separable Banach space \( \mathbb{E} \), and let \( \mathop {\left( {{a_i}} \right)}\nolimits_{i \in \mathbb{Z}} \) be continuous linear operators from \( \mathbb{E} \) to a Banach space \( \mathbb{F} \) such that \( \sum\nolimits_{i \in \mathbb{Z}} {\left\| {{a_i}} \right\|} \) is finite. We prove that the linear process \( \mathop {\left( {{X_n}} \right)}\nolimits_{n \in \mathbb{Z}} \) defined by \( {X_n}: = \sum\nolimits_{i \in \mathbb{Z}} {{a_i}} \left( {{\epsilon_{n - i}}} \right) \) inherits from \( \mathop {\left( {{\epsilon_i}} \right)}\nolimits_{i \in \mathbb{Z}} \) the central limit theorem and functional central limit theorems in various Banach spaces of \( \mathbb{F} \)-valued functions, including Hölder spaces.     

Semigroups of rectangular matrices under a sandwich operation

Let \({\mathcal {M}}_{mn}={\mathcal {M}}_{mn}({\mathbb {F}})\) denote the set of all \(m\times n\) matrices over a field \({\mathbb {F}}\), and fix some \(n\times m\) matrix \(A\in {\mathcal {M}}_{nm}\). An associative operation \(\star \) may be defined on \({\mathcal {M}}_{mn}\) by \(X\star Y=XAY\) for all \(X,Y\in {\mathcal {M}}_{mn}\), and the resulting sandwich semigroup is denoted \({\mathcal {M}}_{mn}^A={\mathcal {M}}_{mn}^A({\mathbb {F}})\). These semigroups are closely related to Munn rings, which are fundamental tools in the representation theory of finite semigroups. We study \({\mathcal {M}}_{mn}^A\) as well as its subsemigroups \(\hbox {Reg}({\mathcal {M}}_{mn}^A)\) and \({\mathcal {E}}_{mn}^A\) (consisting of all regular elements and products of idempotents, respectively), and the ideals of \(\hbox {Reg}({\mathcal {M}}_{mn}^A)\). Among other results, we characterise the regular elements; determine Green’s relations and preorders; calculate the minimal number of matrices (or idempotent matrices, if applicable) required to generate each semigroup we consider; and classify the isomorphisms between finite sandwich semigroups \({\mathcal {M}}_{mn}^A({\mathbb {F}}_1)\) and \({\mathcal {M}}_{kl}^B({\mathbb {F}}_2)\). Along the way, we develop a general theory of sandwich semigroups in a suitably defined class of partial semigroups related to Ehresmann-style “arrows only” categories; we hope this framework will be useful in studies of sandwich semigroups in other categories. We note that all our results have applications to the variants \({\mathcal {M}}_n^A\) of the full linear monoid \({\mathcal {M}}_n\) (in the case \(m=n\)), and to certain semigroups of linear transformations of restricted range or kernel (in the case that \(\hbox {rank}(A)\) is equal to one of m, n).     

Permutation polynomials of the type $$x^rg(x^{s})$$ over $${\mathbb {F}}_{q^{2n}}$$Fq2n

We provide some new families of permutation polynomials of \({\mathbb {F}}_{q^{2n}}\) of the type \(x^rg(x^{s})\), where the integers r, s and the polynomial \(g \in {\mathbb {F}}_q[x]\) satisfy particular restrictions. Some generalizations of known permutation binomials and trinomials that involve a sort of symmetric polynomials are given. Other constructions are based on the study of algebraic curves associated to certain polynomials. In particular we generalize families of permutation polynomials constructed by Gupta–Sharma, Li–Helleseth, Li–Qu–Li–Fu.