Axiomatization of the degree of Fitzpatrick, Pejsachowicz and Rabier

In this paper, we prove an analogue of the uniqueness theorems of Führer [15] and Amann and Weiss [1] to cover the degree of Fredholm operators of index zero constructed by Fitzpatrick, Pejsachowicz and Rabier [13], whose range of applicability is substantially wider than for the most classical degrees of Brouwer [5] and Leray–Schauder [22]. A crucial step towards the axiomatization of this degree is provided by the generalized algebraic multiplicity of Esquinas and López-Gómez [8, 9, 25], $$\chi $$ χ , and the axiomatization theorem of Mora-Corral [28, 32]. The latest result facilitates the axiomatization of the parity of Fitzpatrick and Pejsachowicz [12], $$\sigma (\cdot ,[a,b])$$ σ ( · , [ a , b ] ) , which provides the key step for establishing the uniqueness of the degree for Fredholm maps.

Graph energy and nullity

The energy of a graph is the sum of absolute values of its eigenvalues. The nullity of a graph is the algebraic multiplicity of number zero in its spectrum. Empirical facts indicate that graph energy decreases with increasing nullity, but proving this property is difficult. In this paper, a method is elaborated by means of which the effect of nullity on graph energy can be quantitatively estimated.

On similarity of an arbitrary matrix to a block diagonal matrix

Let an n x n -matrix A have m < n (m ? 2) different eigenvalues ?j of the algebraic multiplicity ?j (j = 1,..., m). It is proved that there are ?j x ?j-matrices Aj, each of which has a unique eigenvalue ?j, such that A is similar to the block-diagonal matrix ?D = diag (A1,A2,..., Am). I.e. there is an invertible matrix T, such that T-1AT = ?D. Besides, a sharp bound for the number kT := ||T||||T-1|| is derived. As applications of these results we obtain norm estimates for matrix functions non-regular on the convex hull of the spectra. These estimates generalize and refine the previously published results. In addition, a new bound for the spectral variation of matrices is derived. In the appropriate situations it refines the well known bounds.

Optimal networks for exact controllability

The exact controllability can be mapped to the problem of maximum algebraic multiplicity of all eigenvalues. In this paper, we focus on the exact controllability of deterministic complex networks. First, we explore the eigenvalues of two famous networks, i.e. the comb-of-comb network and the Farey graph. Due to their special structure, we find that the eigenvalues of each network are mutually distinct, showing that these two networks are optimal networks with respect to exact controllability. Second, we study how to optimize the exact controllability of a deterministic network. Based on the spectral graph theory, we find that reducing the order of duplicate sets or co-duplicate sets which are two special vertex subsets can decrease greatly the exact controllability. This result provides an answer to an open problem of Li et al. [X. F. Li, Z. M. Lu and H. Li, Int. J. Mod. Phys. C 26, 1550028 (2015)]. Finally, we discuss the relation between the topological structure and the multiplicity of two special eigenvalues and the computational complexity of our method.

MULTIPLICITIES OF EIGENVALUES OF THE DIFFUSION OPERATOR WITH RANDOM JUMPS FROM THE BOUNDARY

This paper deals with a non-self-adjoint differential operator which is associated with a diffusion process with random jumps from the boundary. Our main result is that the algebraic multiplicity of an eigenvalue is equal to its order as a zero of the characteristic function $\unicode[STIX]{x1D6E5}(\unicode[STIX]{x1D706})$. This is a new criterion for determining the multiplicities of eigenvalues for concrete operators.