Displaying 1641 – 1660 of 3007

Showing per page

On Gaussian conditional independence structures

Radim Lněnička, František Matúš (2007)

Kybernetika

The simultaneous occurrence of conditional independences among subvectors of a regular Gaussian vector is examined. All configurations of the conditional independences within four jointly regular Gaussian variables are found and completely characterized in terms of implications involving conditional independence statements. The statements induced by the separation in any simple graph are shown to correspond to such a configuration within a regular Gaussian vector.

On generalized inverses of singular matrix pencils

Klaus Röbenack, Kurt Reinschke (2011)

International Journal of Applied Mathematics and Computer Science

Linear time-invariant networks are modelled by linear differential-algebraic equations with constant coefficients. These equations can be represented by a matrix pencil. Many publications on this subject are restricted to regular matrix pencils. In particular, the influence of the Weierstrass structure of a regular pencil on the poles of its inverse is well known. In this paper we investigate singular matrix pencils. The relations between the Kronecker structure of a singular matrix pencil and the...

On graphs with the largest Laplacian index

Bo Lian Liu, Zhibo Chen, Muhuo Liu (2008)

Czechoslovak Mathematical Journal

Let G be a connected simple graph on n vertices. The Laplacian index of G , namely, the greatest Laplacian eigenvalue of G , is well known to be bounded above by n . In this paper, we give structural characterizations for graphs G with the largest Laplacian index n . Regular graphs, Hamiltonian graphs and planar graphs with the largest Laplacian index are investigated. We present a necessary and sufficient condition on n and k for the existence of a k -regular graph G of order n with the largest Laplacian...

On hardly linearly provable systems

Jaroslav Morávek (1984)

Aplikace matematiky

A well-known theorem of Rabin yields a dimensional lower bound on the width of complete polynomial proofs of a system of linear algebraic inequalities. In this note we investigate a practically motivated class of systems where the same lower bound can be obtained on the width of almost all (noncomplete) linear proofs. The proof of our result is based on the Helly Theorem.

On Hermite-Hermite matrix polynomials

M. S. Metwally, M. T. Mohamed, A. Shehata (2008)

Mathematica Bohemica

In this paper the definition of Hermite-Hermite matrix polynomials is introduced starting from the Hermite matrix polynomials. An explicit representation, a matrix recurrence relation for the Hermite-Hermite matrix polynomials are given and differential equations satisfied by them is presented. A new expansion of the matrix exponential for a wide class of matrices in terms of Hermite-Hermite matrix polynomials is proposed.

Currently displaying 1641 – 1660 of 3007