Page 1 Next

Displaying 1 – 20 of 940

Showing per page

± sign pattern matrices that allow orthogonality

Yan Ling Shao, Liang Sun, Yubin Gao (2006)

Czechoslovak Mathematical Journal

A sign pattern A is a ± sign pattern if A has no zero entries. A allows orthogonality if there exists a real orthogonal matrix B whose sign pattern equals A . Some sufficient conditions are given for a sign pattern matrix to allow orthogonality, and a complete characterization is given for ± sign patterns with n - 1 N - ( A ) n + 1 to allow orthogonality.

517.98

A.M. Вершик (1984)

Zapiski naucnych seminarov Leningradskogo

A canonical directly infinite ring

Mario Petrich, Pedro V. Silva (2001)

Czechoslovak Mathematical Journal

Let be the set of nonnegative integers and the ring of integers. Let be the ring of N × N matrices over generated by the following two matrices: one obtained from the identity matrix by shifting the ones one position to the right and the other one position down. This ring plays an important role in the study of directly finite rings. Calculation of invertible and idempotent elements of yields that the subrings generated by them coincide. This subring is the sum of the ideal consisting of...

A computation of positive one-peak posets that are Tits-sincere

Marcin Gąsiorek, Daniel Simson (2012)

Colloquium Mathematicae

A complete list of positive Tits-sincere one-peak posets is provided by applying combinatorial algorithms and computer calculations using Maple and Python. The problem whether any square integer matrix A ( ) is ℤ-congruent to its transpose A t r is also discussed. An affirmative answer is given for the incidence matrices C I and the Tits matrices C ̂ I of positive one-peak posets I.

A Fiedler-like theory for the perturbed Laplacian

Israel Rocha, Vilmar Trevisan (2016)

Czechoslovak Mathematical Journal

The perturbed Laplacian matrix of a graph G is defined as L D = D - A , where D is any diagonal matrix and A is a weighted adjacency matrix of G . We develop a Fiedler-like theory for this matrix, leading to results that are of the same type as those obtained with the algebraic connectivity of a graph. We show a monotonicity theorem for the harmonic eigenfunction corresponding to the second smallest eigenvalue of the perturbed Laplacian matrix over the points of articulation of a graph. Furthermore, we use...

A geometric construction for spectrally arbitrary sign pattern matrices and the 2 n -conjecture

Dipak Jadhav, Rajendra Deore (2023)

Czechoslovak Mathematical Journal

We develop a geometric method for studying the spectral arbitrariness of a given sign pattern matrix. The method also provides a computational way of computing matrix realizations for a given characteristic polynomial. We also provide a partial answer to 2 n -conjecture. We determine that the 2 n -conjecture holds for the class of spectrally arbitrary patterns that have a column or row with at least n - 1 nonzero entries.

Currently displaying 1 – 20 of 940

Page 1 Next