Bases of complete systems of rational functions with rational coefficients
https://doi.org/10.22405/2226-8383-2023-24-2-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 that 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 rational functions with rational coefficients endowed with the superposition operation. We investigate the problem of bases of complete systems, namely:
Does every complete system have a (finite) basis? ;
For any positive integer n, is there a basis of a complete system consisting of n functions?
a number of examples of basis consisting of n functions are presented explicitly
(𝑛 = 1, 2, 3, ...).
The answers to all these questions are positive, which is the main result of this article.
About the Author
Nikos Filippovich Aleksiadis
Lomonosov Moscow State University; National Research University “MPEI”
Russian Federation
Russian Federation
candidate of physical and mathematical sciences
References
1. N. Ph. Aleksiadis, 2021, “On the bases of rational functions with rational coefficients”, Proc. 20th Int. Conf. “Algebra, number theory and discrete geometry: modern problems, applications and problems of history”, pp. 80-83.
2. N. Ph. Aleksiadis, 2022, “Rational A-functions with rational co efficients”, Chebyshevskii sbornik, vol. 23, no. 4, pp. 11–19. (DOI 10.22405/2226-8383-2022-23-4-11-19)
3. N. Ph. Aleksiadis, 2023, “Closed classes in the functional system of polynomials with real Coefficients”, Chebyshevskii sbornik, vol. 24, № 1, pp. 5–14. DOI 10.22405/2226-8383-2023-24-1-5-14.
4. Gavrilov, G.P. 1965, “On functional completeness in countable logic”, Problems of cybernetics, vol. 15, pp. 5-64.
5. Gelfond, A. O. 1978, “Solving equations in integers”, Moscow.:Science, 63 p.
6. Kudryavtsev, V. B. 1965, “On the powers of sets of discrete sets of some functional systems related to automata”, Problems of cybernetics, vol. 13, pp. 45-74.
7. Kudryavtsev, V. B. 1982, “Functional systems ”, Moscow: Publishing House of Mekh-mat. fac. MSU., 157 p.
8. Maltsev, A. I. 1976, “Selected works”. vol. II — Moscow: Publishing House “Nauka”, 388 p.
9. Salomaa, A. 1963, “Some completeness criteria for sets of functions over a finite domain”, II. Ibid., Ser. A I 63, 19 pp.
10. Chasavskikh, A. A. 2018, “The problem of completeness in classes of linear automata”, Intelligent systems. Theory and Applications, vol. 22(2), pp. 151-154.
11. Yablonsky, S. V. 1986, “Introduction to discrete mathematics”, Moscow.:Science, 384 p.
12. Yablonsky, S. V. 1954, “On functional completeness in three-digit calculus”, DAN USSR, vol. 95(6), pp. 1153–1156.
13. Yablonsky, S. V. 1958, “Functional constructions in 𝑘-valued logic”, Proceedings of the Steklov Institute of Mathematics, vol.51, pp. 5–142.
14. Post, E. 1941,“Two-valued iterative sistems of mathematical logic”. — Prinston.
15. Rosenberg, Y.1970, “Uber die functionale Vollst¨andigkeit in den mehrwertigen Logiken”. Praha, Rozpravi Ceskoslovenska Acodemie Ved., v. 80, №4, p. 393.
16. Slupecki, J. 1939,“ Kriterium pelnosci wielowar — tosciowych systemow logiki zdan”. Comptes Rendus des Seances de la Societe des Sciences et des Lettres de Varsivie, cl. III, v. 32, pp. 102-128.
Review
For citations:
Aleksiadis N.F. Bases of complete systems of rational functions with rational coefficients. Chebyshevskii Sbornik. 2023;24(2):5-14. (In Russ.) https://doi.org/10.22405/2226-8383-2023-24-2-5-14
Views:
479
Email this article 