Displaying 41 – 60 of 97

Showing per page

On the angles between certain arithmetically defined subspaces of 𝐂 n

Robert Brooks (1987)

Annales de l'institut Fourier

If { v i } and { w j } are two families of unitary bases for C n , and θ is a fixed number, let V n and W n be subspaces of C n spanned by [ θ · n ] vectors in { v i } and { w j } respectively. We study the angle between V n and W n as n goes to infinity. We show that when { v i } and { w j } arise in certain arithmetically defined families, the angles between V n and W n may either tend to 0 or be bounded away from zero, depending on the behavior of an associated eigenvalue problem.

On the automorphisms of the spectral unit ball

Jérémie Rostand (2003)

Studia Mathematica

Let Ω be the spectral unit ball of Mₙ(ℂ), that is, the set of n × n matrices with spectral radius less than 1. We are interested in classifying the automorphisms of Ω. We know that it is enough to consider the normalized automorphisms of Ω, that is, the automorphisms F satisfying F(0) = 0 and F'(0) = I, where I is the identity map on Mₙ(ℂ). The known normalized automorphisms are conjugations. Is every normalized automorphism a conjugation? We show that locally, in a neighborhood of a matrix with...

On the bounds of Laplacian eigenvalues of k -connected graphs

Xiaodan Chen, Yaoping Hou (2015)

Czechoslovak Mathematical Journal

Let μ n - 1 ( G ) be the algebraic connectivity, and let μ 1 ( G ) be the Laplacian spectral radius of a k -connected graph G with n vertices and m edges. In this paper, we prove that μ n - 1 ( G ) 2 n k 2 ( n ( n - 1 ) - 2 m ) ( n + k - 2 ) + 2 k 2 , with equality if and only if G is the complete graph K n or K n - e . Moreover, if G is non-regular, then μ 1 ( G ) < 2 Δ - 2 ( n Δ - 2 m ) k 2 2 ( n Δ - 2 m ) ( n 2 - 2 n + 2 k ) + n k 2 , where Δ stands for the maximum degree of G . Remark that in some cases, these two inequalities improve some previously known results.

On The Determinant of q-Distance Matrix of a Graph

Hong-Hai Li, Li Su, Jing Zhang (2014)

Discussiones Mathematicae Graph Theory

In this note, we show how the determinant of the q-distance matrix Dq(T) of a weighted directed graph G can be expressed in terms of the corresponding determinants for the blocks of G, and thus generalize the results obtained by Graham et al. [R.L. Graham, A.J. Hoffman and H. Hosoya, On the distance matrix of a directed graph, J. Graph Theory 1 (1977) 85-88]. Further, by means of the result, we determine the determinant of the q-distance matrix of the graph obtained from a connected weighted graph...

Currently displaying 41 – 60 of 97