多元唯一充分算子的Zhegalkin多项式

IF 0.6 Q4 AUTOMATION & CONTROL SYSTEMS
L. Y. Bystrov, E. V. Kuzmin
{"title":"多元唯一充分算子的Zhegalkin多项式","authors":"L. Y. Bystrov,&nbsp;E. V. Kuzmin","doi":"10.3103/S0146411624700275","DOIUrl":null,"url":null,"abstract":"<p>Sole sufficient operators are of particular interest among functionally complete sets of Boolean functions. They have a wide range of applicability and are not limited to the binarity case. In this paper, we formulate conditions imposed on the Zhegalkin polynomial coefficients that are necessary and sufficient for the polynomial to correspond to a sole sufficient operator. The polynomial representation of constant-preserving Boolean functions is considered. It is shown that the properties of monotonicity and linearity do not need to be specifically considered when describing a sole sufficient operator. The concept of a dual remainder polynomial is introduced; the value of it allows one to determine the self-duality of a Boolean function. It is proven that a Boolean function preserving 0 and 1 or preserving neither 0 nor 1 is self-dual if and only if the dual remainder of the corresponding Zhegalkin polynomial is 0 for any sets of values of the function variables. The system of leading coefficients is obtained based on this fact. The solution of the system makes it possible to formulate a criterion for the self-duality of a Boolean function represented by a Zhegalkin polynomial, which imposes necessary and sufficient conditions on the polynomial coefficients. Thus, it is shown that Zhegalkin polynomials are a rather convenient tool for studying precomplete classes of Boolean functions.</p>","PeriodicalId":46238,"journal":{"name":"AUTOMATIC CONTROL AND COMPUTER SCIENCES","volume":"58 7","pages":"808 - 826"},"PeriodicalIF":0.6000,"publicationDate":"2025-02-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Zhegalkin Polynomial of a Multiary Sole Sufficient Operator\",\"authors\":\"L. Y. Bystrov,&nbsp;E. V. Kuzmin\",\"doi\":\"10.3103/S0146411624700275\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Sole sufficient operators are of particular interest among functionally complete sets of Boolean functions. They have a wide range of applicability and are not limited to the binarity case. In this paper, we formulate conditions imposed on the Zhegalkin polynomial coefficients that are necessary and sufficient for the polynomial to correspond to a sole sufficient operator. The polynomial representation of constant-preserving Boolean functions is considered. It is shown that the properties of monotonicity and linearity do not need to be specifically considered when describing a sole sufficient operator. The concept of a dual remainder polynomial is introduced; the value of it allows one to determine the self-duality of a Boolean function. It is proven that a Boolean function preserving 0 and 1 or preserving neither 0 nor 1 is self-dual if and only if the dual remainder of the corresponding Zhegalkin polynomial is 0 for any sets of values of the function variables. The system of leading coefficients is obtained based on this fact. The solution of the system makes it possible to formulate a criterion for the self-duality of a Boolean function represented by a Zhegalkin polynomial, which imposes necessary and sufficient conditions on the polynomial coefficients. Thus, it is shown that Zhegalkin polynomials are a rather convenient tool for studying precomplete classes of Boolean functions.</p>\",\"PeriodicalId\":46238,\"journal\":{\"name\":\"AUTOMATIC CONTROL AND COMPUTER SCIENCES\",\"volume\":\"58 7\",\"pages\":\"808 - 826\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2025-02-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"AUTOMATIC CONTROL AND COMPUTER SCIENCES\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://link.springer.com/article/10.3103/S0146411624700275\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"AUTOMATION & CONTROL SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"AUTOMATIC CONTROL AND COMPUTER SCIENCES","FirstCategoryId":"1085","ListUrlMain":"https://link.springer.com/article/10.3103/S0146411624700275","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

唯一充分算子在布尔函数的功能完备集中具有特殊的意义。它们具有广泛的适用性,并不局限于二进制情况。本文给出了Zhegalkin多项式系数的充分必要条件,这些条件是多项式对应于唯一充分算子的充分必要条件。研究了保常布尔函数的多项式表示。结果表明,在描述唯一充分算子时,不需要特别考虑单调性和线性性。引入对偶剩余多项式的概念;它的值允许我们确定布尔函数的自对偶性。证明了保0、保1或不保0、不保1的布尔函数是自对偶的当且仅当对应的Zhegalkin多项式对任意函数变量的值集的对偶余数为0。根据这一事实,得到了导系数系统。该系统的解使得用Zhegalkin多项式表示的布尔函数的自对偶性的判据成为可能,该判据对多项式系数施加了充分必要条件。从而证明了Zhegalkin多项式是研究布尔函数预完备类的一种相当方便的工具。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Zhegalkin Polynomial of a Multiary Sole Sufficient Operator

Sole sufficient operators are of particular interest among functionally complete sets of Boolean functions. They have a wide range of applicability and are not limited to the binarity case. In this paper, we formulate conditions imposed on the Zhegalkin polynomial coefficients that are necessary and sufficient for the polynomial to correspond to a sole sufficient operator. The polynomial representation of constant-preserving Boolean functions is considered. It is shown that the properties of monotonicity and linearity do not need to be specifically considered when describing a sole sufficient operator. The concept of a dual remainder polynomial is introduced; the value of it allows one to determine the self-duality of a Boolean function. It is proven that a Boolean function preserving 0 and 1 or preserving neither 0 nor 1 is self-dual if and only if the dual remainder of the corresponding Zhegalkin polynomial is 0 for any sets of values of the function variables. The system of leading coefficients is obtained based on this fact. The solution of the system makes it possible to formulate a criterion for the self-duality of a Boolean function represented by a Zhegalkin polynomial, which imposes necessary and sufficient conditions on the polynomial coefficients. Thus, it is shown that Zhegalkin polynomials are a rather convenient tool for studying precomplete classes of Boolean functions.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
AUTOMATIC CONTROL AND COMPUTER SCIENCES
AUTOMATIC CONTROL AND COMPUTER SCIENCES AUTOMATION & CONTROL SYSTEMS-
CiteScore
1.70
自引率
22.20%
发文量
47
期刊介绍: Automatic Control and Computer Sciences is a peer reviewed journal that publishes articles on• Control systems, cyber-physical system, real-time systems, robotics, smart sensors, embedded intelligence • Network information technologies, information security, statistical methods of data processing, distributed artificial intelligence, complex systems modeling, knowledge representation, processing and management • Signal and image processing, machine learning, machine perception, computer vision
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信