In his paper mentioned in the title, which appears in the same issue of this journal, Mehdi Radjabalipour derives the cyclic decomposition of an algebraic linear transformation. A more general structure theory for linear transformations appears in Irving Kaplansky's lovely 1954 book on infinite abelian groups. We present a translation of Kaplansky's results for abelian groups into the terminolo...

In the present contribution anisotropic structure of two-dimensional linear Cosserat elasticity is investigated. The symmetry classes this model are derived and detailed in a synthetic way. Particular attention paid to specific features Elasticity which sensitivity non-centrosymmetry as well chirality. These aspects important for application continuum theory mechanical modelling lattices metama...

Abstract A graph is said to be ‐ ubiquitous , where the minor relation between graphs, if whenever a with for all then one also has disjoint union of many copies . well‐known conjecture Andreae that every locally finite connected ‐ubiquitous. In this paper we give sufficient condition on structure ends which implies particular full‐grid

‎Linear semi-infinite programming problem is an important class of optimization problems which deals with infinite constraints‎. ‎In this paper‎, ‎to solve this problem‎, ‎we combine a discretization method and a neural network method‎. ‎By a simple discretization of the infinite constraints,we convert the linear semi-infinite programming problem into linear programming problem‎. ‎Then‎, ‎we use...