*Research partially supported by INTAS grant 97-1644.Consider the Deligne-Simpson problem: give necessary and sufficient conditions for the choice of the conjugacy classes Cj ⊂ GL(n,C) (resp. cj ⊂ gl(n,C)) so that there exist irreducible (p+1)-tuples of matrices Mj ∈ Cj (resp. Aj ∈ cj) satisfying the equality M1 . . .Mp+1 = I (resp. A1+. . .+Ap+1 = 0). The matrices Mj and Aj are interpreted as monodromy operators and as matrices-residua of fuchsian systems on Riemann’s sphere. We give new examples...

We establish some criteria for a nonsingular square matrix depending on several parameters to be represented in the form of a matrix product of factors which depend on the single parameters.

Let $W_n=K_1\vee C_{n-1}$ be the wheel graph on $n$ vertices, and let $S(n,c,k)$ be the graph on $n$ vertices obtained by attaching $n-2c-2k-1$ pendant edges together with $k$ hanging paths of length two at vertex $v_0$, where $v_0$ is the unique common vertex of $c$ triangles. In this paper we show that $S(n,c,k)$ ($c\ge 1$, $k\ge 1$) and $W_n$ are determined by their signless Laplacian spectra, respectively. Moreover, we also prove that $S(n,c,k)$ and its complement graph are determined by their Laplacian spectra, respectively, for $c\ge 0$ and $k\ge 1$.

In this paper we consider the problem of finding upper bounds of certain matrix operators such as Hausdorff, Nörlund matrix, weighted mean and summability on sequence spaces $l_p\left(w\right)$ and Lorentz sequence spaces $d(w,p)$, which was recently considered in [9] and [10] and similarly to [14] by Josip Pecaric, Ivan Peric and Rajko Roki. Also, this study is an extension of some works by G. Bennett on $l_p$ spaces, see [1] and [2].

Some convergent sequences of the lower bounds of the minimum eigenvalue for the Hadamard product of a nonsingular M-matrix B and the inverse of a nonsingular M-matrix A are given by using Brauer’s theorem. It is proved that these sequences are monotone increasing, and numerical examples are given to show that these sequences could reach the true value of the minimum eigenvalue in some cases. These results in this paper improve some known results.

In this paper we firstly give majorization relations between the vectors Fn = {f0, f1, . . . , fn−1},Ln = {l0, l1, . . . , ln−1} and Pn = {p0, p1, . . . , pn−1} which constructed with fibonacci, lucas and pell numbers. Then we give upper and lower bounds for determinants, Euclidean norms and Spectral norms of Gram matrices GF=〈Fn,Fni〉, GL=〈Ln,Lni〉, GP=〈Pn,Pni〉, GFL=〈Fn,Lni〉, GFP=〈Fn,Pni〉.

Using Clifford analysis in a multidimensional space some elliptic, hyperbolic and parabolic systems of partial differential equations are constructed, which are related to the well-known classical equations. To obtain parabolic systems Clifford algebra is modified and some corresponding differential operator is constructed. For systems obtained the boundary and initial value problems are solved.

In this paper we derive new properties complementary to an $2n\times 2n$ Brualdi-Li tournament matrix $B_{2n}$. We show that $B_{2n}$ has exactly one positive real eigenvalue and one negative real eigenvalue and, as a by-product, reprove that every Brualdi-Li matrix has distinct eigenvalues. We then bound the partial sums of the real parts and the imaginary parts of its eigenvalues. The inverse of $B_{2n}$ is also determined. Related results obtained in previous articles are proven to be corollaries.

Let $G$ be a simple connected graph with vertex set $V\left(G\right)=\{v_1,v_2,\cdots ,v_n\}$ and edge set $E\left(G\right)$, and let $d_{v_i}$ be the degree of the vertex $v_i$. Let $D\left(G\right)$ be the distance matrix and let $T_r\left(G\right)$ be the diagonal matrix of the vertex transmissions of $G$. The generalized distance matrix of $G$ is defined as $D_{\alpha }\left(G\right)=\alpha T_r\left(G\right)+(1-\alpha )D\left(G\right)$, where $0\le \alpha \le 1$. Let ${\lambda }_1\left(D_{\alpha }\left(G\right)\right)\ge {\lambda }_2\left(D_{\alpha }\left(G\right)\right)\ge ...\ge {\lambda }_n\left(D_{\alpha }\left(G\right)\right)$ be the generalized distance eigenvalues of $G$, and let $k$ be an integer with $1\le k\le n$. We denote by $S_k\left(D_{\alpha }\left(G\right)\right)={\lambda }_1\left(D_{\alpha }\left(G\right)\right)+{\lambda }_2\left(D_{\alpha }\left(G\right)\right)+...+{\lambda }_k\left(D_{\alpha }\left(G\right)\right)$ the sum of the $k$ largest generalized distance eigenvalues. The generalized distance spread of a graph $G$ is defined as $D_{\alpha }S\left(G\right)={\lambda }_1\left(D_{\alpha }\left(G\right)\right)-{\lambda }_n\left(D_{\alpha }\left(G\right)\right)$. We obtain some...