Abstract
One of the problems of modern discrete mathematics is Dedekind’s problem on the number of monotone Boolean functions. For other precomplete classes, general formulas for the number of functions of the classes had been found, but it has not been found so far for the class of monotone Boolean functions. Within the framework of this problem, there are problems of a lower level. One of them is the absence of a general formula for the number of Boolean functions of intersection \(MS\) of two classes—the class of monotone functions and the class of self-dual functions. In the paper, new lower bounds are proposed for estimating the cardinality of the intersection for both an even and an odd number of variables. It is shown that the majority voting function of an odd number of variables is monotone and self-dual. The majority voting function of an even number of variables is determined. Free voting functions, which are functions with fictitious variables similar in properties to majority voting functions, are introduced. Then the union of a set of majority voting functions and a set of free voting functions is considered, and the cardinality of this union is calculated. The resulting value of the cardinality is proposed as a lower bound for \(\left| {MS} \right|\). For the class \(MS\) of monotone self-dual functions of an even number of variables, the lower bound is improved over the bounds proposed earlier, and for functions of an odd number of variables, the lower bound for \(\left| {MS} \right|\) is presented for the first time.
REFERENCES
Kleitman, D.J., On Dedekind’s problem: The number of monotone Boolean functions, Proc. Am. Math. Soc., 1969, vol. 21, no. 3, pp. 677–677. https://doi.org/10.1090/s0002-9939-1969-0241334-6
Bystrov, L.Yu. and Rublev, V.S., Boolean functions not belonging to the precomplete classes, Zametki po informatike i matematike (Notes on Informatics and Mathematics), Paramonov, I.V., Bondarenko, V.A., Vasil’chikov, V.V., Glyzin, S.D., Sokolov, V.A., and Chalyi, D.Yu., Eds., Yaroslavl: Yaroslavl. Gos. Univ. im. P.G. Demidov, 2021, vol. 13, pp. 22–26.
Haviarova, L. and Toman, E., The number of monotone and self-dual Boolean functions, J. Appl. Math., Stat. Inf., 2014, vol. 10, no. 2, pp. 93–111. https://doi.org/10.2478/jamsi-2014-0016
Yablonskiy, S.V., Vvedenie v diskretnuyu matematiku (Introduction into Discrete Mathematics), Moscow: Vyssh. Shkola, 2008, 5th ed.
Gavrilov, G.P. and Sapozhenko, A.A., Zadachi i uprazhneniya po diskretnoi matematike (Problems and Exercises on Discrete Mathematics), Moscow: Fizmatlit, 2005.
Rubchinskiy, A.A., Diskretnye matematicheskie modeli. Nachal’nye ponyatiya i standartnye zadachi. Uchebnoe posobie (Discrete Mathematical Models: Initial Concepts and Standard Problems: Textbook), Moscow: Direct-Media, 2014.
Zhuk, D., From two-valued logic to k-valued logic, Intellektual’nye Sist. Teor. Pril., 2018, vol. 22, no. 1, pp. 131–149.
Semenchuk, V.N., Diskretnaya matematika. Kurs lektsii (Discrete Mathematics: Lecture Course), Gomel: Gomel’sk. Gos. Univ. im. Frantsiska Skoriny, 2007.
Korshunov, A.D., Solution of Dedekind’s problem on the number of monotonic Boolean functions, Sov. Math., Dokl., 1977, vol. 18, no. 4, pp. 442–445.
Funding
This work was supported by P.G. Demidov Yaroslavl State University, project no. VIP-016.
Author information
Authors and Affiliations
Corresponding authors
Ethics declarations
The authors of this work declare that they have no conflicts of interest.
Additional information
Translated by K. Gumerov
Publisher’s Note.
Allerton Press remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
About this article
Cite this article
Bystrov, L.Y., Kuzmin, E.V. The Application of Majority Voting Functions to Estimate the Number of Monotone Self-Dual Boolean Functions. Aut. Control Comp. Sci. 57, 706–717 (2023). https://doi.org/10.3103/S0146411623070027
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S0146411623070027