Closed classes in the functional system of polynomials with real coefficients
https://doi.org/10.22405/2226-8383-2023-24-1-5-14
Abstract
A functional system is a set of functions endowed with a set of operations on these functions.
The operations allow one to obtain new functions from the existing ones.
Functional systems are mathematical models of real and abstract control systems and thus
are one of the main objects of discrete mathematics and mathematical cybernetic.
The problems in the area of functional systems are extensive. One of the main problems is deciding completeness; this problem consists in the description of all subsets of functions that are complete, i.e. generate the whole set.
In our paper we consider the functional system of polynomials with real coefficients endowed with the superposition operation for this system we study the problem of closed classes (structure, basis, number of finite and infinite closed classes).
Importance of the problem of closed classes is ensured by the fact that completeness problem can frequently be solved with the help of (maximal) closed classes.
The main results concerning the functional system of polynomials with real coefficients presented in our paper are the following:
1. all finite closed classes are described explicitly ;
2. the number of finite closed classes, infinite closed classes and all closed classes is found ;
3. the problem of bases of closed classes is studied, namely, it is established that there exist
closed classes with a finite basis, there exist closed classes with an infinite basis, and there
exist closed classes without a basis; explicit examples of the corresponding closed classes
are given;
4. the number of closed classes with a finite basis, the number of closed classes with an infinite
basis and the number of closed classes without a basis are established.
Keywords
functional system,
completeness problem,
complete system,
closed class,
basis,
polynomial,
polynomial function.
Supporting agencies: The work was performed at Lomonosov Moscow State University
About the Author
Nikos Philipovich Aleksiadis
Lomonosov Moscow State University; National Research University “MPEI”
Russian Federation
Russian Federation
candidate of physical and mathematical sciences
References
1. Aleksiadis, N. Ph. 2022, “On closed classes in a functional system of polynomials with real
2. coefficients”, Proc. XXI Int. Conf. “Algebra, number theory and discrete geometry: modern
3. problems, applications and problems of history”, pp. 142-145.
4. Aleksiadis, N. Ph. 2015, “Algorithmic unsolvability of the completeness problem for polynomials
5. with integer coefficients” , Vestnik MPEI, no. 3, pp. 110-117.
6. Aleksiadis, N. Ph. 2019, “On the functional system of polynomials with rational coefficients”
7. Intelligent systems. Theory and applications, Vol. 23, № 4, с. 93-114.
8. Aleksiadis, N. Ph. 2022, “Rational A-functions with rational coefficients” // Chebyshevskii
9. sbornik, Vol. 23, № 4, pp. 11–19. DOI 10.22405/2226-8383-2022-23-4-11-19.
10. Babin, D. N. 2020, “On the completeness problem for automata”, Proc. Intelligent systems.
11. Theory and Applications, Vol. 23(4), pp. 82-83.
12. Gavrilov, G.P. 1965, “On functional completeness in countable logic”, Problems of cybernetics,
13. Vol. 15, pp. 5-64.
14. Kudryavtsev, V. B. 1965, “On the powers of sets of discrete sets of some functional systems
15. related to automata”, Problems of cybernetics, Vol. 13, pp. 45-74.
16. Kudryavtsev, V. B. 1982, “Functional systems”, Moscow: Publishing House of Mekh-mat. fac.
17. MSU., 157 p.
18. Maltsev, A. I. 1976, “Selected works”. Vol. II — Moscow: Publishing House “Nauka”, 388 p.
19. Salomaa, A. 1963, “Some completeness criteria for sets of functions over a finite domain”, II.
20. Ibid., Ser. A I 63, 19 pp.
21. Chasavskikh, A. A. 2018, “The problem of completeness in classes of linear automata”, Intelligent
22. systems. Theory and Applications, Vol. 22(2), pp. 151-154.
23. Yablonsky, S. V. 1986, “Introduction to discrete mathematics”, Moscow.:Science, 384 p.
24. Yablonsky, S. V. 1954, “On functional completeness in three-digit calculus”, DAN USSR, Vol.
25. (6), pp. 1153–1156.
26. Yablonsky, S. V. 1958, “Functional constructions in 𝑘-valued logic”, Proceedings of the Steklov
27. Institute of Mathematics, Vol.51, pp. 5–142.
28. Post, E. 1941,“Two-valued iterative sistems of mathematical logik”. — Prinston.
29. Rosenberg, Y.1970, “Uber die functionale Vollst¨andigkeit in den mehrwertigen Logiken”. Praha,
30. Rozpravi Ceskoslovenska Acodemie Ved., Vol. 80, № 4, p. 393.
31. Slupecki, J. 1939, Kriterium pelnosci wielowar — tosciowych systemow logiki zdan. Comptes
32. Rendus des Seances de la Societe des Sciences et des Lettres de Varsivie, cl. III, v. 32, pp.
33. -128.
Review
For citations:
Aleksiadis N.P. Closed classes in the functional system of polynomials with real coefficients. Chebyshevskii Sbornik. 2023;24(1):5-14. (In Russ.) https://doi.org/10.22405/2226-8383-2023-24-1-5-14
Views:
536
Email this article 