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 …

Following the spectral Coxeter analysis of matrix morsifications for Dynkin diagrams, the
spectral graph theory, a graph coloring technique, and algebraic methods in graph theory …

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 …

By applying symbolic and numerical computation and the spectral Coxeter analysis
technique of matrix morsifications introduced in our previous paper [Fund. Inform. 124 …

Electronic cash systems are used as payment tools of e-commerce. They should be
equipped with independence, transferability, and dividability, which are requirements of …

We construct a horizontal mesh algorithm for a study of a special type of mesh root systems
of connected positive loop-free edge-bipartite graphs Δ, with n≥ 2 vertices, in the sense of …

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 …

We review our recent results concerning several computer algebra aspects of determining
canonical forms, performing a decomposition and deciding the isomorphism question for …

We explicitly describe tree representations of the canonically oriented quiver $\widetilde
{\mathbb {E}} _ {6} $. Recall that tree representations can be exhibited using matrices …