homomorphism

Covariant and Contrvariant Homomorphisms of Games with Preference Relations

We consider Nash equilibrium and some its modifications as principles of optimality for games with preference relations. For description of the optimal solutions of games with preferencerelations covariantly and contrvariantly complete families of homomorphisms are introduced.

On Homomorphisms of Endomorphism Semigroups of Hypergraphs

In the paper we describea structure of surjective homomorphisms of end omorphism semi groups of effective hypergraph swith p-definable edges.

Algebraic Properties of Abstract Neural Network

The modern level of neuroinformatics allows to use artificial neural networks for the solution of various applied problems. However many neural network methods put into practice have no strict formal mathematical substantiation, being heuristic algorithms. It imposes certain restrictions on development of neural network methods of the solution of problems. At the same time there is a wide class of mathematical models which are well studied within such disciplines as theory of abstract algebras, graph theory, automata theory.