Publicado 12 números por año
ISSN Imprimir: 1064-2315
ISSN En Línea: 2163-9337
Indexed in
Methods of Solving the Problems of Mathematical Safe on Elementary Graphs
Get access
SINOPSIS
The problem of mathematical safe consisting of a certain system of interrelated locks with given initial states is under consideration. Such system can be represented in the form of oriented or non-oriented graph, which vertexes are locks. In this paper, we consider graphs of sufficiently simple structures, such as path, contour, chain, cycle, fantail, stairs with a prescribed quantity of steps, and complicated stairs. In the general case, solution of this problem is reduced to solving a system of linear equations in the class of subtracts in absolute value, which is equal to the number of states of every safe lock. In fact, this number equals to the number of key turns in each lock for reaching finally transition of the safe in the state when all locks are open. To solve this problem, two original methods are suggested, namely, the method of separation of variables and the method of summary representations. The essence of first method consists in the following. For some elementary graphs there is a potential of singling out some equations for their immediate solving relative to one arbitrary variable. Further, substituting successively the obtained solutions into the corresponding equations, we obtain the solution of the system. This method was used for solving the problem for the graph of a cycle type. The essence of the second method consists in the introduction of a special parameter called the sum of unknowns. Some graphs make possible to present the system variables by this parameter. Summing these variables we obtain the equation relative to this parameter. Having solved this equation we obtain the value of this parameter as well as the values of all variables. This method was used for solving the problem for the graphs of window and stairs types. Every problem for the prescribed types of safe is shown by examples and is supplemented by verification of the solution.
-
D o n e t s G . A . , S o l u t i o n o f s a f e p r o b l e m o n ( 0 , l ) - m a t r i c e s , C y b e r n e t i c s a n d S y s t e m s A n a l y s i s , 2 0 0 2 , N o . 1 , 9 8 - 1 0 5 . .
-
A g a i A h G a r n i s h Y a k u b , D o n e t s G . A . , P r o b l e m o f m a t h e m a t i c a l s a f e o n m a t r i x e s , T e o r i y a o p t i m a l n y k h r e s h e n i y , 2 0 1 3 , 1 2 4 - 1 3 0 . .
-
K r y v y i S . L . , A l g o r i t h m s f o r s o l u t i o n o f s y s t e m s o f l i n e a r D i o p h a n t i n e e q u a t i o n s i n r e s i d u e f i e l d s , C y b e r n e t i c s a n d S y s t e m s A n a l y s i s , 2 0 0 7 , 4 3 , N o . 2 , 1 7 1 - 1 7 8 . .
-
D o n e t s G . A . , G u r i n A . L . , P r o b l e m a b o u t m a t h e m a t i c a l s a f e o f l o c k s w i t h t w o s t a t e s , M e z h d u n a r o d n y i n a u c h n o - t e k h n i c h e s k i y z h u r n a l " P r o b l e m y u p r a v l e n i y a i i n f o r m a t i k i " , 2 0 1 8 , N o . 5 , 3 3 - 4 1 . .
-
K r y v y i S . L . , S o l u t i o n a l g o r i t h m s f o r s y s t e m s o f l i n e a r e q u a t i o n s o v e r r e s i d u e r i n g s , C y b e r n e t i c s a n d S y s t e m s A n a l y s i s , 2 0 1 6 , 5 2 , N o . 5 , 1 4 9 - 1 6 0 . .