Description of stability for linear time-invariant systems based on the first curvature

This paper focuses on using the first curvature κ(t) of trajectory to describe the stability of linear time-invariant system. We extend the results for two and three-dimensional systems (Wang, Sun, Song et al, arXiv:1808.00290) to n-dimensional systems. We prove that for a system $\text{◂=▸}\dot{r}(t)=\text{◂⋅▸}Ar(t)$, (a) if there exists a measurable set whose Lebesgue measure is greater than zero, such that $\text{◂≠▸}\underset{t\to +\infty }{\lim }\kappa (t)\ne 0$ or $\underset{t\to +\infty }{\lim }\kappa (t)$ does not exist for any initial value in this set, then the zero solution of the system is stable; (b) if the matrix A is invertible, and there exists a measurable set whose Lebesgue measure is greater than zero, such that $\text{◂=▸}\underset{t\to +\infty }{\lim }\kappa (t)=+\infty$ for any initial value in this set, then the zero solution of the system is asymptotically stable.     

Algebraic techniques for least squares problems in commutative quaternionic theory

Due to the rise of commutative quaternion in Hopfield neural networks, digital signal, and image processing, one encounters the approximate solution problems of the commutative quaternion linear equations $AX\approx B$ and $AXC\approx B$. This paper, by means of real representation and complex representation of commutative quaternion matrices, introduces concepts of norms of commutative quaternion matrices and derives two algebraic techniques for finding solutions of least squares problems in commutative quaternionic theory.     

Computability of graphs

We consider topological pairs $(A,B)$, $B\subseteq A$, which have computable type, which means that they have the following property: if X is a computable topological space and $f:A\to X$ a topological imbedding such that $f(A)$ and $f(B)$ are semicomputable sets in X, then $f(A)$ is a computable set in X. It is known, e.g., that $(M,\partial M)$ has computable type if M is a compact manifold with boundary. In this paper we examine topological spaces called graphs and we show that we can in a natural way associate to each graph G a discrete subspace E so that $(G,E)$ has computable type. Furthermore, we use this result to conclude that certain noncompact semicomputable graphs in computable metric spaces are computable.