相关论文: A counterexample on spectra of zero patterns

An $n\times n$ matrix is said to have a self-interlacing spectrum if its eigenvalues $\lambda_k$, $k=1,\ldots,n$, are distributed as follows $$ \lambda_1>-\lambda_2>\lambda_3>\cdots>(-1)^{n-1}\lambda_n>0. $$ A method for constructing sign…

We realize many sharp spectral bounds of the spectral radius of a nonnegative square matrix $C$ by using the largest real eigenvalues of suitable matrices of smaller sizes related to $C$ that are very easy to find. As applications, we give…

Spectrahedra are sets defined by linear matrix inequalities. Projections of spectrahedra are called semidefinitely representable sets. Both kinds of sets are of practical use in polynomial optimization, since they occur as feasible sets in…

We present a formula for the trace of any symmetric power of a $n\times n$ matrix (with coefficients in a field) in terms of the ordinary powers of the matrix, an arbitrarily chosen linear function which vanishes on the identity matrix, and…

Spectrahedra are affine-linear sections of the cone $\mathcal{P}_n$ of positive semidefinite symmetric $n\times n$-matrices. We consider random spectrahedra that are obtained by intersecting~$\mathcal{P}_n$ with the affine-linear space…

A composition of a nonnegative integer (n) is a sequence of positive integers whose sum is (n). A composition is palindromic if it is unchanged when its terms are read in reverse order. We provide a generating function for the number of…

An invertible matrix is called a Perron similarity if it diagonalizes an irreducible, nonnegative matrix. Each Perron similarity gives a nontrivial polyhedral cone, called the spectracone, and polytope, called the spectratope, of realizable…

For a fixed quadratic polynomial $\mathfrak{p}$ in $n$ non-commuting variables, and $n$ independent $N\times N$ complex Ginibre matrices $X_1^N,\dots, X_n^N$, we establish the convergence of the empirical spectral distribution of $P^N…

Matrix spectral factorization is traditionally described as finding spectral factors having a fixed analytic pole configuration. The classification of spectral factors then involves studying the solutions of a certain algebraic Riccati…

The spectrum of a real and symmetric $N\times N$ matrix determines the matrix up to unitary equivalence. More spectral data is needed together with some sign indicators to remove the unitary ambiguities. In the first part of this work we…

We investigate the analytic structure of scattering amplitudes in theories in which Lorentz invariance is spontaneously broken. We do so by computing and studying the S-matrix for a simple example: a superfluid described by a complex scalar…

The set of associative and commutative hypercomplex numbers, called the perfect hypercomplex algebra (PHA) is investigated. Necessary and sufficient conditions for an algebra to be a PHA via semi-tensor product(STP) of matrices are…

In this paper we pursue the study of spectral categories initiated in [26]. More precisely, we construct the Universal matrix invariant of spectral categories, i.e. a functor U with values in an additive category Add, which inverts the…

We study the left-right action of $\operatorname{SL}_n \times \operatorname{SL}_n$ on $m$-tuples of $n \times n$ matrices with entries in an infinite field $K$. We show that invariants of degree $n^2- n$ define the null cone. Consequently,…

A self-adjoint element in a finite AW*-factor is spectrally symmetric, if its spectral measure under the quasitrace is invariant under the change of variables $t\longmapsto -t$. We show that if $\mathcal{A}$ is an AW*-factor of type II_1, a…

Consider a square random matrix with independent and identically distributed entries of mean zero and unit variance. We show that as the dimension tends to infinity, the spectral radius is equivalent to the square root of the dimension in…

Let $F$ be an algebraically closed field of characteristic zero. We consider the question which subsets of $M_n(F)$ can be images of noncommutative polynomials. We prove that a noncommutative polynomial $f$ has only finitely many similarity…

The pattern of a matrix M is a (0,1)-matrix which replaces all non-zero entries of M with a 1. There are several contexts in which studying the patterns of orthogonal matrices can be useful. One necessary condition for a matrix to be…

An n\times n matrix M is called a fooling-set matrix of size n, if its diagonal entries are nonzero, whereas for every k\ne \ell we have M_{k,\ell} M_{\ell,k} = 0. Dietzfelbinger, Hromkovi\v{c}, and Schnitger (1996) showed that n \le (\rk…

We compute spectra of symmetric random matrices defined on graphs exhibiting a modular structure. Modules are initially introduced as fully connected sub-units of a graph. By contrast, inter-module connectivity is taken to be incomplete.…