Related papers: Spectrum nonincreasing maps on matrices

Let $S_{n}$ denote the space of all $n \times n$ real symmetric matrices. For n=2 or n>2 we characterize maps F from $S_{n}$ to $S_{m}$ which preserve adjacency, i.e. if rank(A-B)=1, then rank(F(A)-F(B))=1.

We study the spectral properties of certain non-self-adjoint matrices associated with large directed graphs. Asymptotically the eigenvalues converge to certain curves, apart from a finite number that have limits not on these curves.

Let $A$ and $B$ be unital complex Banach algebras having no quotients isomorphic to $\mathbb{C}$ or $M_2(\mathbb{C})$. Assume additionally that $B$ is semisimple. If a surjective additive mapping $\Phi\colon A\to B$ satisfies…

We study the equivalence between bipartiteness and symmetry of spectra of mixed graphs, for $\theta$-Hermitian adjacency matrices defined by an angle $\theta \in (0, \pi]$. We show that this equivalence holds when, for example, an angle…

Let H be a complex Hilbert space, B(H) and S(H) be the spaces of all bounded operators and all self-adjoint operators on H, respectively. We give the concrete forms of the maps on B(H) and also S(H) which preserve the spectrum of certain…

We study the behavior of $h$-vectors associated to matroid complexes under weak maps, or inclusions of matroid polytopes. Specifically, we show that the $h$-vector of the order complex of the lattice of flats of a matroid is component-wise…

We classify all $\pi_1$-injective proper maps between non-compact surfaces up to proper homotopy.

The finite spectrum of a first-order sentence is the set of positive integers that are the sizes of its models. The class of finite spectra is known to be the same as the complexity class NE. We consider the spectra obtained by limiting…

We give upper and lower bounds for the spectral radius of a nonnegative matrix by using its average 2-row sums, and characterize the equality cases if the matrix is irreducible. We also apply these bounds to various nonnegative matrices…

We prove that there is a structure, indeed a linear ordering, whose degree spectrum is the set of all non-hyperarithmetic degrees. We also show that degree spectra can distinguish measure from category.

We define extension maps as maps that extend a system (through adding ancillary systems) without changing the state in the original system. We show, using extension maps, why a completely positive operation on an initially entangled system…

Switching is an operation on a graph that does not change the spectrum of the adjacency matrix, thus producing cospectral graphs. An important activity in the field of spectral graph theory is the characterization of graphs by their…

For each object in a tensor triangulated category, we construct a natural continuous map from the object's support---a closed subset of the category's triangular spectrum---to the Zariski spectrum of a certain commutative ring of…

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.…

Let $\mathcal{A}$ and $\mathcal{B}$ be two unital complex $\ast $-algebras such that $\mathcal{A}$ has a nontrivial projection. In this paper, we study the structure of bijective mappings $\Phi :\mathcal{A}\rightarrow \mathcal{B}$…

We study linear maps preserving the higher numerical ranges of tensor product of matrices.

We completely determine the spectrum of an $I$-graph, that is, the eigenvalues of its adjacency matrix. We apply our result to prove known characterizations of connectedness and bipartiteness in $I$-graphs by using an spectral approach.…

A spectral characterization of the matching number (the size of a maximum matching) of a graph is given. More precisely, it is shown that the graphs G of order n whose matching number is k are precisely those graphs with the maximum skew…

Graph matrices are a type of matrix which has played a crucial role in analyzing the sum of squares hierarchy on average case problems. However, except for rough norm bounds, little is known about graph matrices. In this paper, we take a…

This study explores the relationship between hypergraph automorphisms and the spectral properties of matrices associated with hypergraphs. For an automorphism $f$, an \( f \)-compatible matrices capture aspects of the symmetry, represented…