GENERAL PRINCIPLES OF CONSTRUCTION OF SYSTEMS OF INDEXATION OF ELEMENTS OF FINITE SETS
https://doi.org/10.21822/2073-6185-2019-46-2-81-88
Abstract
Objectives Definition of general principles for constructing indexing systems for elements of finite sets.
Method. Building a model of the indexing process. Definition of general rules for assigning attributes - indices to elements of sets.
Result. The general principle of constructing indexing systems for elements of sets and their aggregates is proposed. The basis of the proposed indexing principle is the mandatory presence of functional relationships between the values of the element indices. The main sign of differences in indexing systems is the difference in functional dependencies between the values of the indices of the environment elements. Indexing systems determine the structural properties of sets and their aggregates. A change in indexing systems predetermines a change in structure. This allows one to form sets, sets with different structures from elements of the initial configurations, and change their structural properties.
Conclusion. A general principle is proposed for constructing systems for indexing elements of sets and their aggregates, based on which are functional dependencies between element indices. Changes in the used functional dependencies between the element indices, as shown in the work, allows one to form combinatorial configurations with different structural properties. The indexing system is a set of rules for assigning to the elements sets of attributes - indices, ensuring their visibility and communication with the environment and determining their structural properties. At the heart of the construction of any structures and indexing systems are some common basic principles for their construction. They are illustrated based on the indexing systems used in classical algebra. Based on the results of a study of the principles of constructing indexing systems, a generalized model of indexing systems is proposed. As a general principle, which is a general principle of constructing indexing systems, a system of functional dependencies between the values of the indices of an element of sets and the values of the indices of the elements of its environment is proposed as a model.
About the Author
I. P. Kadiev
Branch - National Bank for the Republic of Daghestan Southern Central Administration of the Central Bank of the Russian Federation
Russian Federation
Russian Federation
Leading specialist of the information and analytical department of the Inspectorate of Credit Organizations,
29 Danialova Str., Makhachkala 367000
References
1. Vilenkin N. YA. Kombinatorika. – M.: Nauka, 1969. - 328 s. [Vilenkin N. Ya. Combinatorics. M .: Nauka, 1969. 328 p.(In Russ.)]
2. Tarakanov V.Ye., Aygner M.A. Kombinatornaya teoriya. – M.: Mir, 1982. 362 s. [Tarakanov V.E., Aigner M.A. Combinatorial Theory - M .: Mir, 1982. 362 p. .(In Russ.)]
3. Gnedenko B.V., Zhurbenko I.G. Teoriya veroyatnostey i kombinatorika // Matematika v shkole. 2007. №6. S. 49 – 58. [Gnedenko B.V., Zhurbenko I.G. Probability Theory and Combinatorics // Mathematics at School. 2007. No. 6. рр. 49 - 58. .(In Russ.)]
4. Yezhov I.I., Skorokhod A.V., Yadrenko M.I. Elementy kombinatoriki. –M.: Nauka. 1977. 80 s. [Yezhov I.I., Skorohod A.V., Yadrenko M.I. Elements of combinatorics. –M .: Science. 1977. 80 p. (In Russ.)]
5. Kholl M. Kombinatorika / Pod red. A.O. Gel'fanda, V.Ye. Tarakanova V.Ye. / Perevod s angliyskogo S.A. Shirokova. - M.: Mir, 1970. 424 s. [Hall M. Combinatorics / Ed. A.O. Gelfand, V.E. Tarakanova V.E. / Translation from English S.A. Shirokova. M.: Mir, 1970.442 р. (In Russ.)]
6. Stenli R. Perechislitel'naya kombinatorika. – M.: Mir, 1990. 440 s. [Stanley R. Enumeration combinatorics. M .: Mir, 1990.440 р. (In Russ.)]
7. Rybnikov K.A. Vvedeniye v kombinatornyy analiz. – M.: MGU, 1994. 308 s. [Rybnikov K.A. Introduction to combinatorial analysis. - M.: Moscow State University, 1994.308 р.(In Russ.)]
8. Skachkov V.N. Kombinatornyye metody diskretnoy matematiki. – M.: Nauka, 1977. 320 s. [Skachkov V.N. Combinatorial methods of discrete mathematics. M .: Nauka, 1977.320 р. (In Russ.)]
9. Leont'yev V.K. Izbrannyye zadachi kombinatornogo analiza. – M.: MGTU im. N.E. Baumana, 2001. 179 s. [Leontiev V.K. Selected tasks of combinatorial analysis. M.: MSTU. N.E. Bauman, 2001.179 р. .(In Russ.)]
10. Soboleva T.S., Chechkin A.V. Diskretnaya matematika. Universitetskiy uchebnik. – M.: Akademiya. 2006. 160 s. [Soboleva T.S., Chechkin A.V. Discrete Math. University textbook. - M.: Academy. 2006.160 р. (In Russ.)]
11. Volkova V.N., Denisov A.A. Teoriya sistem i sistemnyy analiz. – M.: Yurayt, 2015. 615s. [Volkova V.N., Denisov A.A. Theory of systems and systems analysis. M .: Yurayt, 2015.615р. (In Russ.)]
12. Dénes J. H., Keedwell A. D. Latin squares: New developments in the theory and applications. Annals of Discrete Mathematics. Vol. 46. Academic Press. Amsterdam. 1991.469 p.
13. Rybnikov K. A. Kombinatornyy analiz. Ocherki istorii. – M.: MGU, 1996. 124 s. [Rybnikov K. A. Combinatorial analysis. Essays on the story. M.: Moscow State University, 1996.124 р. (In Russ.)]
14. Andersen J.A. Discrete mathematics and combinatorics. / Per. from English M.: Williams, 2003.957 р.
15. Kadiyev I.P., Kadiyev P.A. Ob odnom klasse kombinatornykh konfiguratsiy. // Vestnik Dagestan-skogo gosudarstvennogo tekhnicheskogo universiteta. 2013. № 4. S. 45 – 49 [Kadiev I.P., Kadiev P.A. On a class of combinatorial configurations. // Herald of the Daghestan State Technical University. Technical Sciences. 2013. No. 4. рр. 45 - 49. .(In Russ.)]
16. J. Clark, J. Kane Coding with error correction in digital communication systems. Per. from English S.I. Gelfanda.- M.: “Radio and Communications”, 1987. 390p.
17. Babash A.V., Shankin G.P. Kriptografiya. M.: Solon R, 2002.-511s. [Babash A.V., Shankin G.P. Cryptography. M .: Solon R, 2002. 511p.(In Russ.)]
18. Kadiyev I.P. Kadiyev P.A. Osnovy indeksnoy strukturizatsii nxn –kombinatornykh konfiguratsiy // Vestnik Dagestanskogo gosudarstvennogo tekhnicheskogo universiteta. 2013.T.45 №1, 2018g.- s.139-146 [Kadiev I.P. Kadiev P.A. Fundamentals of index structuring of nxn-combinatorial configurations // Bulletin of the Daghestan State Technical University. 2018.T. 45 No. 1, pp. 139-146.(In Russ.)]
19. Kadiyev I.P., Melekhin V.B. Sistema indeksnoy strukturizatsii kombinatornykh konfiguratsiy meto-dom rekurrentnykh funktsional'nykh sootnosheniy. Pribory i sistemy: upravleniye, kontrol', diagnostika №2, 2019 s.– 43-47 [Kadiev I.P., Melekhin V.B. The system of index structuring of combinatorial configurations by the method of recurrent functional relations. g. Devices and systems: management, control, diagnostic-stick. No. 2, 2019 pp. 43-47.(In Russ.)]
Review
For citations:
Kadiev I.P. GENERAL PRINCIPLES OF CONSTRUCTION OF SYSTEMS OF INDEXATION OF ELEMENTS OF FINITE SETS. Herald of Dagestan State Technical University. Technical Sciences. 2019;46(2):81-88. (In Russ.) https://doi.org/10.21822/2073-6185-2019-46-2-81-88
Views:
568
Email this article 
