Sätze über Determinanten und Anwendung derselben zum Beweise der Sätze von Pascal und Brianchon.
Schatten norms of Toeplitz matrices with Fisher--Hartwig singularities.
Schur complements and Banachiewicz-Schur forms.
Schur complements of diagonally dominant matrices
Schur complements of generally diagonally dominant matrices and a criterion for irreducibility of matrices.
Schur complements of matrices with acyclic bipartite graphs.
Schur multiplier characterization of a class of infinite matrices
Let denote the space of infinite matrices for which for all with . We characterize the upper triangular positive matrices from , , by using a special kind of Schur multipliers and the G. Bennett factorization technique. Also some related results are stated and discussed.
Second order freeness and fluctuations of random matrices. III: Higher order freeness and free cumulants.
Self-correcting iterative methods for computing -inverses
In this paper we construct a few iterative processes for computing -inverses of a linear bounded operator. These algorithms are extensions of the corresponding algorithms introduced in [11] and a method from [8]. A few error estimates are derived.
Semiclassical asymptotics of orthogonal polynomials, Riemann-Hilbert problem, and universality in the matrix model.
Semigroups of finite matrices.
Semi-Symmetric Algebras: General Constructions. Part II
2000 Mathematics Subject Classification: 15A69, 15A78.In [3] we present the construction of the semi-symmetric algebra [χ](E) of a module E over a commutative ring K with unit, which generalizes the tensor algebra T(E), the symmetric algebra S(E), and the exterior algebra ∧(E), deduce some of its functorial properties, and prove a classification theorem. In the present paper we continue the study of the semi-symmetric algebra and discuss its graded dual, the corresponding canonical bilinear form,...
Sensor Location Problem for a Multigraph
MSC 2010: 05C50, 15A03, 15A06, 65K05, 90C08, 90C35We introduce sparse linear underdetermined systems with embedded network structure. Their structure is inherited from the non-homogeneous network ow programming problems with nodes of variable intensities. One of the new applications of the researched underdetermined systems is the sensor location problem (SLP) for a multigraph. That is the location of the minimum number of sensors in the nodes of the multigraph, in order to determine the arcs ow...
Separability of the characteristic polynomial
Separable characteristic polynomials of pencils and property .
Sequence enumeration.
Several matrix Euclidean norm inequalities involving Kantorovich inequality.
Several results on chordal bipartite graphs
The question of generalizing results involving chordal graphs to similar concepts for chordal bipartite graphs is addressed. First, it is found that the removal of a bisimplicial edge from a chordal bipartite graph produces a chordal bipartite graph. As consequence, occurance of arithmetic zeros will not terminate perfect Gaussian elimination on sparse matrices having associated a chordal bipartite graph. Next, a property concerning minimal edge separators is presented. Finally, it is shown that,...
Sharp lower bounds for the dimension of linearizations of matrix polynomials.
Sharp Upper Bounds on the Signless Laplacian Spectral Radius of Strongly Connected Digraphs
Let G = (V (G),E(G)) be a simple strongly connected digraph and q(G) be the signless Laplacian spectral radius of G. For any vertex vi ∈ V (G), let d+i denote the outdegree of vi, m+i denote the average 2-outdegree of vi, and N+i denote the set of out-neighbors of vi. In this paper, we prove that: (1) (1) q(G) = d+1 +d+2 , (d+1 ≠ d+2) if and only if G is a star digraph [...] ,where d+1, d+2 are the maximum and the second maximum outdegree, respectively [...] is the digraph on n vertices obtained...