The Development of Suitable Inequalities and Their Application to Systems of Logical Equations

Dostonjon Numonjonovich Barotov, Ruziboy Numonjonovich Barotov, Vladimir Soloviev, Vadim Feklin, Dilshod Muzafarov, Trusunboy Ergashboev and Khudoyberdi Egamov
Additional contact information
Dostonjon Numonjonovich Barotov: Department of Data Analysis and Machine Learning, Financial University under the Government of the Russian Federation, 109456 Moscow, Russia
Ruziboy Numonjonovich Barotov: Department of Mathematical Analysis, Khujand State University, 1 Mavlonbekova, Khujand 735700, Tajikistan
Vladimir Soloviev: Department of Data Analysis and Machine Learning, Financial University under the Government of the Russian Federation, 109456 Moscow, Russia
Dilshod Muzafarov: Department of Mathematical Analysis, Khujand State University, 1 Mavlonbekova, Khujand 735700, Tajikistan
Trusunboy Ergashboev: Department of Mathematical Analysis, Khujand State University, 1 Mavlonbekova, Khujand 735700, Tajikistan
Khudoyberdi Egamov: Department of Higher and Applied Mathematics, Khujand State University, 1 Mavlonbekova, Khujand 735700, Tajikistan

Mathematics, 2022, vol. 10, issue 11, 1-9

Abstract: In this paper, two not-difficult inequalities are invented and proved in detail, which adequately describe the behavior of discrete logical functions x o r ( x 1 , x 2 , … , x n ) and a n d ( x 1 , x 2 , … , x n ) . Based on these proven inequalities, infinitely differentiable extensions of the logical functions x o r ( x 1 , x 2 , … , x n ) and a n d ( x 1 , x 2 , … , x n ) were defined for the entire ℝ n . These suitable extensions were applied to systems of logical equations. Specifically, the system of m logical equations in a constructive way without adding any equations (not field equations and no others) is transformed in ℝ n first into an equivalent system of m smooth rational equations ( S m S R E ) so that the solution of S m S R E can be reduced to the problem minimization of the objective function, and any numerical optimization methods can be applied since the objective function will be infinitely differentiable. Again, we transformed S m S R E into an equivalent system of m polynomial equations ( S m P E ) . This means that any symbolic methods for solving polynomial systems can be used to solve and analyze an equivalent S m P E . The equivalence of these systems has been proved in detail. Based on these proofs and results, in the next paper, we plan to study the practical applicability of numerical optimization methods for S m S R E and symbolic methods for S m P E .

Keywords: inequalities; proof of inequalities; application of inequalities; Zhegalkin polynomials; logical operations; systems of logical equations; algebraic cryptanalysis; approximation; numerical optimization; system of polynomial equations (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/10/11/1851/pdf (application/pdf)
https://www.mdpi.com/2227-7390/10/11/1851/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:10:y:2022:i:11:p:1851-:d:826255

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().