Development of an Algorithm for Constructing Multioperation Lattices Based on Indecomposable Algebras
The theory discussed in the article refers to the theory of functional systems. This branch of mathematics explores functions defined on finite sets, as well as the composition of these functions. Such functions are used in mathematical logic and in universal algebra, and in particular, in the clone...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | Russian |
| Published: |
The Fund for Promotion of Internet media, IT education, human development «League Internet Media»
2021-04-01
|
| Series: | Современные информационные технологии и IT-образование |
| Subjects: | |
| Online Access: | http://sitito.cs.msu.ru/index.php/SITITO/article/view/674 |
| _version_ | 1818914573297647616 |
|---|---|
| author | Dmitriy Eremenko |
| author_facet | Dmitriy Eremenko |
| author_sort | Dmitriy Eremenko |
| collection | DOAJ |
| description | The theory discussed in the article refers to the theory of functional systems. This branch of mathematics explores functions defined on finite sets, as well as the composition of these functions. Such functions are used in mathematical logic and in universal algebra, and in particular, in the clone theory.
The traditional research objects in universal algebra are the algebras of operations and multioperations. One of the main problems in the theory of multioperations is the classification of algebras. To solve this problem, it is necessary to construct a lattice of algebras. The article presents an algorithm for constructing lattices of multioperations based on indecomposable algebras. To implement this algorithm, all indecomposable algebras of unary multioperations of rank 3 were found; they were presented in the form of an inclusion graph. The vertices of the graph are indecomposable algebras, and the edges of the graph reflect the connection between the inclusion algebras. If there is a path between two vertices of the graph, then one algebra is a subalgebra for the other. Using the resulting graph, an algorithm for constructing a lattice of unary multioperations of rank 3 was implemented. The results obtained agree with the results described in the article "Algebras of unary multioperations". This algorithm can be used to construct lattices of multioperations of higher ranks or large areas. |
| first_indexed | 2024-12-19T23:48:32Z |
| format | Article |
| id | doaj.art-5ca23545a6f84ea9ac180f1752f3200e |
| institution | Directory Open Access Journal |
| issn | 2411-1473 |
| language | Russian |
| last_indexed | 2024-12-19T23:48:32Z |
| publishDate | 2021-04-01 |
| publisher | The Fund for Promotion of Internet media, IT education, human development «League Internet Media» |
| record_format | Article |
| series | Современные информационные технологии и IT-образование |
| spelling | doaj.art-5ca23545a6f84ea9ac180f1752f3200e2022-12-21T20:01:13ZrusThe Fund for Promotion of Internet media, IT education, human development «League Internet Media»Современные информационные технологии и IT-образование2411-14732021-04-0117110.25559/SITITO.17.202101.674Development of an Algorithm for Constructing Multioperation Lattices Based on Indecomposable AlgebrasDmitriy Eremenko0https://orcid.org/0000-0001-5974-1485Saint Petersburg Electrotechnical University "LETI"The theory discussed in the article refers to the theory of functional systems. This branch of mathematics explores functions defined on finite sets, as well as the composition of these functions. Such functions are used in mathematical logic and in universal algebra, and in particular, in the clone theory. The traditional research objects in universal algebra are the algebras of operations and multioperations. One of the main problems in the theory of multioperations is the classification of algebras. To solve this problem, it is necessary to construct a lattice of algebras. The article presents an algorithm for constructing lattices of multioperations based on indecomposable algebras. To implement this algorithm, all indecomposable algebras of unary multioperations of rank 3 were found; they were presented in the form of an inclusion graph. The vertices of the graph are indecomposable algebras, and the edges of the graph reflect the connection between the inclusion algebras. If there is a path between two vertices of the graph, then one algebra is a subalgebra for the other. Using the resulting graph, an algorithm for constructing a lattice of unary multioperations of rank 3 was implemented. The results obtained agree with the results described in the article "Algebras of unary multioperations". This algorithm can be used to construct lattices of multioperations of higher ranks or large areas.http://sitito.cs.msu.ru/index.php/SITITO/article/view/674operationsmultioperationslattice of algebras of multioperationsindecomposable algebras of operations |
| spellingShingle | Dmitriy Eremenko Development of an Algorithm for Constructing Multioperation Lattices Based on Indecomposable Algebras Современные информационные технологии и IT-образование operations multioperations lattice of algebras of multioperations indecomposable algebras of operations |
| title | Development of an Algorithm for Constructing Multioperation Lattices Based on Indecomposable Algebras |
| title_full | Development of an Algorithm for Constructing Multioperation Lattices Based on Indecomposable Algebras |
| title_fullStr | Development of an Algorithm for Constructing Multioperation Lattices Based on Indecomposable Algebras |
| title_full_unstemmed | Development of an Algorithm for Constructing Multioperation Lattices Based on Indecomposable Algebras |
| title_short | Development of an Algorithm for Constructing Multioperation Lattices Based on Indecomposable Algebras |
| title_sort | development of an algorithm for constructing multioperation lattices based on indecomposable algebras |
| topic | operations multioperations lattice of algebras of multioperations indecomposable algebras of operations |
| url | http://sitito.cs.msu.ru/index.php/SITITO/article/view/674 |
| work_keys_str_mv | AT dmitriyeremenko developmentofanalgorithmforconstructingmultioperationlatticesbasedonindecomposablealgebras |