Considered are linear algebraic systems of equations and/or inequalities involving linear dependencies between interval-valued parameters. The goal is to characterize weak and strong solvability of such systems. Since any parametric interval equation is equivalent to a system of parametric interval inequalities, the focus is on the latter. We discuss an algorithmic procedure for characterizing ...

Tropical differential equations are introduced and an algorithm is designed which tests solvability of a system of tropical linear differential equations within the complexity polynomial in the size of the system and in its coefficients. Moreover, we show that there exists a minimal solution, and the algorithm constructs it (in case of solvability). This extends a similar complexity bound estab...

We show a reduction of Hilbert’s tenth problem to the solvability of the matrix equation A1 1 A i2 2 · · ·A ik k = Z over non-commuting integral matrices, where Z is the zero matrix, thus proving that the solvability of the equation is undecidable. This is in contrast to the case whereby the matrix semigroup is commutative in which the solvability of the same equation was shown to be decidable ...

The paper aims at formulating an integrated approach for the selection of decentralized control structures using a number of structural criteria aiming at facilitating the design of decentralised control schemes. This requires the selection of decentralisation structure that will allow the generic solvability of a variety of decentralised control problems, such as pole assignment by decentralis...

Motivated by the quest for a logic for PTIME and recent insights that the descriptive complexity of problems from linear algebra is a crucial aspect of this problem, we study the solvability of linear equation systems over finite groups and rings from the viewpoint of logical (inter-)definability. All problems that we consider are decidable in polynomial time, but not expressible in fixedpoint ...

We introduce an alternative concept to determine the solvability of two-player games with perfect information. This concept — based on games currently solved — claims that the applicable solving procedures have a significant influence on the solvability of games. This contrasts with current views that suggest that solvability is related to state-space and game-tree complexity. Twenty articles o...

The classical approach of solvability using group theory is well known and one original motivation is to solve polynomials by radicals. Radicals are square, cube, square root, cube root etc of the original coefficients for the polynomial. A polynomial is solvable by radicals if the permutation group is solvable. This is exact solvability via group theory. With modern computers, we might need to...

In this paper, an attempt is made to present an extension of Darbo's theorem, and its applicationto study the solvability of a functional integral equation of Volterra type.

This paper studies the solvability and stability of a generalized saddle-point system in finiteand infinite-dimensional spaces. Sharp solvability conditions and stability estimates are derived.

Solvability conditions for linear differential equations are usually formulated in terms of orthogonality of the right-hand side to solutions of the homogeneous adjoint equation. However, if the corresponding operator does not satisfy the Fredholm property such solvability conditions may be not applicable. For this case, we obtain another type of solvability conditions, for ordinary differentia...