We continue the Coxeter spectral study of the category 𝒰ℬigr m of loop-free edge-bipartite
(signed) graphs Δ, with m≥ 2 vertices, we started in [SIAM J. Discr. Math. 27 (2013), 827 …

We study edge-bipartite graphs (bigraphs), a class of signed graphs, by means of the
inflation algorithm which relies on performing certain elementary transformations on a given …

We continue the study of finite connected edge-bipartite graphs Δ, with m≥ 2 vertices (a
class of signed graphs), started in [SIAM J. Discrete Math. 27 (2013), 827-854] and …

We continue the study of finite connected loop-free edge-bipartite graphs Δ, with m≥ 3
vertices (a class of signed graphs), we started in Simson (2013)[48] and M. Gąsiorek et …

We study the complexity of Bongartz's algorithm for determining a maximal common direct
summand of a pair of modules M, N over k-algebra Λ; in particular, we estimate its …

We present combinatorial algorithms for solving three problems that appear in the study of
the degeneration order≤ deg for the variety of finite-dimensional modules over a k-algebra …

For standard algorithms verifying positive definiteness of a matrix A∈ Mn (R) based on
Sylvester's criterion, the computationally pessimistic case is this when A is positive definite …

Jordan decomposition is a special form of matrix decomposition. As a method applicable to
general square matrix, Jordan decomposition is capable of finding a similar matrix that is …

For standard algorithms verifying positive definiteness of a matrix $ A\in\mathbb {M} _n
(\mathbb {R}) $ based on Sylvester's criterion, the computationally pessimistic case is this …