Geodesic
On finding an estimate of the complexity of discrete k-valued functions
News of the Kabardin-Balkar scientific center of RAS, no. 6 (2023), pp. 142-151.

Voir la notice de l'article provenant de la source Math-Net.Ru

. In this paper the concept of derivative and integral of discrete k-valued functions is introduced, taking into account the properties of the operations of addition and multiplication modulo k. Based on the property of completeness of the integral expansion of k-valued functions, a universal method is proposed for estimating the complexity of k-valued fully defined functions, including not having an analytical representation, but specified only in a tabular way, or representable using other tabular functions. The structure of the “primitive – derivative” relation is studied depending on the properties of the number k. A model in the form of a directed graph of this relationship is proposed. Three main types of introduced relations are identified.
Keywords: k-valued function, differentiation operator, integration operator, completeness property,integral basis functions, directed graph 
@article{IZKAB_2023_6_a14,
     author = {D. P. Dimitrichenko},
     title = {On finding an estimate of the complexity of discrete k-valued functions},
     journal = {News of the Kabardin-Balkar scientific center of RAS},
     pages = {142--151},
     publisher = {mathdoc},
     number = {6},
     year = {2023},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IZKAB_2023_6_a14/}
}
TY  - JOUR
AU  - D. P. Dimitrichenko
TI  - On finding an estimate of the complexity of discrete k-valued functions
JO  - News of the Kabardin-Balkar scientific center of RAS
PY  - 2023
SP  - 142
EP  - 151
IS  - 6
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/IZKAB_2023_6_a14/
LA  - ru
ID  - IZKAB_2023_6_a14
ER  - 
%0 Journal Article
%A D. P. Dimitrichenko
%T On finding an estimate of the complexity of discrete k-valued functions
%J News of the Kabardin-Balkar scientific center of RAS
%D 2023
%P 142-151
%N 6
%I mathdoc
%U http://geodesic.mathdoc.fr/item/IZKAB_2023_6_a14/
%G ru
%F IZKAB_2023_6_a14
D. P. Dimitrichenko. On finding an estimate of the complexity of discrete k-valued functions. News of the Kabardin-Balkar scientific center of RAS, no. 6 (2023), pp. 142-151. http://geodesic.mathdoc.fr/item/IZKAB_2023_6_a14/

[1] V. A. Gorbatov, Fundamental foundations of discrete mathematics, Nauka, Moscow, 2000, 544 pp. (In Russian) | MR

[2] V. I. Panteleev, “Polynomial decomposition of K-valued functions by Differentiation and normalization operators”, News of higher educational institutions: Mathematics, 1998, no. 1, 82–103 (In Russian)

[3] L. A. Lyutikova, “Using a Boolean derivative to evaluate the significance of properties of recognized objects”, E3S Web of Conferences, 224 (2020), 01021 | DOI

[4] A. I. Kostrykin, Introduction to algebra, Nauka, Moscow, 1977, 320 pp. (In Russian)

[5] D. P. Dimitrichenko, “On one way of differentiating logical functions”, Proceedings of the international conference of young scientists «Mathematical modeling of fractal processes, related problems of analysis and computer science», Nalchik, 2011, 103–105 pp. (In Russian)

[6] D. P. Dimitrichenko, “On the representation of a logical function through its derivatives”, Materials of the II International Russian-Uzbek Symposium «Equations of mixed type and related problems of analysis and computer science», Nalchik, 2012, 92–94 pp. (In Russian)