<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">mais</journal-id><journal-title-group><journal-title xml:lang="ru">Моделирование и анализ информационных систем</journal-title><trans-title-group xml:lang="en"><trans-title>Modeling and Analysis of Information Systems</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1818-1015</issn><issn pub-type="epub">2313-5417</issn><publisher><publisher-name>Yaroslavl State University</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.18255/1818-1015-2023-2-106-127</article-id><article-id custom-type="edn" pub-id-type="custom">KPRFVJ</article-id><article-id custom-type="elpub" pub-id-type="custom">mais-1774</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>Discrete Mathematics in Relation to Computer Science</subject></subj-group></article-categories><title-group><article-title>Полином Жегалкина многоместного самодостаточного оператора</article-title><trans-title-group xml:lang="en"><trans-title>The Zhegalkin Polynomial of Multiseat Sole Sufficient Operator</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0002-0610-5466</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Быстров</surname><given-names>Леонид Юрьевич</given-names></name><name name-style="western" xml:lang="en"><surname>Bystrov</surname><given-names>Leonid Y.</given-names></name></name-alternatives><email xlink:type="simple">bystrovl0306@mail.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0003-0500-306X</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Кузьмин</surname><given-names>Егор Владимирович</given-names></name><name name-style="western" xml:lang="en"><surname>Kuzmin</surname><given-names>Egor V.</given-names></name></name-alternatives><email xlink:type="simple">kuzmin@uniyar.ac.ru</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Ярославский государственный университет им. П.Г. Демидова</institution><country>Россия</country></aff><aff xml:lang="en"><institution>P.G. Demidov Yaroslavl State University</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2023</year></pub-date><pub-date pub-type="epub"><day>14</day><month>06</month><year>2023</year></pub-date><volume>30</volume><issue>2</issue><fpage>106</fpage><lpage>127</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Быстров Л.Ю., Кузьмин Е.В., 2023</copyright-statement><copyright-year>2023</copyright-year><copyright-holder xml:lang="ru">Быстров Л.Ю., Кузьмин Е.В.</copyright-holder><copyright-holder xml:lang="en">Bystrov L.Y., Kuzmin E.V.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://www.mais-journal.ru/jour/article/view/1774">https://www.mais-journal.ru/jour/article/view/1774</self-uri><abstract><p>Среди полных систем булевых функций особый интерес представляют самодостаточные операторы. Они обладают широкой областью применимости и не ограничиваются двухместным случаем. В данной работе формулируются условия, накладываемые на коэффициенты полинома Жегалкина, необходимые и достаточные для того, чтобы полином соответствовал самодостаточному оператору. Рассмотрено полиномиальное представление булевых функций, сохраняющих константу. Показано, что свойства монотонности и линейности не требуют специального рассмотрения при описании самодостаточного оператора. Вводится понятие полинома двойственного остатка, значение которого позволяет определить самодвойственность булевой функции. Доказано, что сохраняющая 0 и 1 или не сохраняющая ни 0, ни 1 булева функция является самодвойственной тогда и только тогда, когда двойственный остаток соответствующего ей полинома Жегалкина равен 0 для любых наборов значений переменных функции. На основании этого факта получена система ведущих коэффициентов. Решение данной системы позволило сформулировать критерий самодвойственности булевой функции, представленной полиномом Жегалкина, накладывающий необходимые и достаточные условия на коэффициенты полинома. Таким образом, показано, что полиномы Жегалкина являются достаточно удобным инструментом при исследовании предполных классов булевых функций.</p></abstract><trans-abstract xml:lang="en"><p>Among functionally complete sets of Boolean functions, sole sufficient operators are of particular interest. They have a wide range of applicability and are not limited to the two-seat case. In this paper, the conditions, imposed on the Zhegalkin polynomial coefficients, are formulated. The conditions 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 monotone and linearity do not require special consideration in 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 proved that the preserving 0 and 1 or preserving neither 0 nor 1 Boolean function is self-dual if and only if the dual remainder of its corresponding Zhegalkin polynomial is equal to 0 for any sets of function variable values. Based on this fact, a system of leading coefficients is obtained. The solution of the system made it possible to formulate the criterion for the self-duality of the Boolean function represented by the Zhegalkin polynomial. It 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></trans-abstract><kwd-group xml:lang="ru"><kwd>полином Жегалкина</kwd><kwd>самодостаточный оператор</kwd><kwd>функция Шеффера</kwd><kwd>предполные классы</kwd><kwd>булевы функции</kwd><kwd>сохраняющие константу</kwd><kwd>самодвойственные булевы функции</kwd><kwd>полином двойственного остатка</kwd><kwd>ведущий коэффициент</kwd></kwd-group><kwd-group xml:lang="en"><kwd>Zhegalkin polynomial</kwd><kwd>sole sufficient operator</kwd><kwd>Sheffer function</kwd><kwd>precomplete classes</kwd><kwd>constant-preserving Boolean functions</kwd><kwd>self-dual Boolean functions</kwd><kwd>dual remainder polynomial</kwd><kwd>leading coefficient</kwd></kwd-group><funding-group><funding-statement xml:lang="ru">ЯрГУ (проект VIP-016)</funding-statement><funding-statement xml:lang="en">ЯрГУ (проект VIP-016)</funding-statement></funding-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">S. V. Yablonskiy, Introduction into discrete mathematics, 5th ed. HSE, 2008.</mixed-citation><mixed-citation xml:lang="en">S. V. Yablonskiy, Introduction into discrete mathematics, 5th ed. HSE, 2008.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">N. M. Martin, Systems of Logic. Cambridge University Press, 1989.</mixed-citation><mixed-citation xml:lang="en">N. M. Martin, Systems of Logic. Cambridge University Press, 1989.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">R. L. Graham, “On n-Valued Functionally Complete Truth Functions,” The Journal of Symbolic Logic, vol. 32, no. 2, pp. 190–195, 1967.</mixed-citation><mixed-citation xml:lang="en">R. L. Graham, “On n-Valued Functionally Complete Truth Functions,” The Journal of Symbolic Logic, vol. 32, no. 2, pp. 190–195, 1967.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">T. C. Wesselkamper, “A sole sufficient operator,” NDJFAM, vol. 16, no. 1, pp. 86–88, 1975.</mixed-citation><mixed-citation xml:lang="en">T. C. Wesselkamper, “A sole sufficient operator,” NDJFAM, vol. 16, no. 1, pp. 86–88, 1975.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">S. N. Selezneva, “O slozhnosti raspoznavaniya polnoty mnozhestv bulevyh funkcij, realizovannyh polinomami Zhegalkina,” DMA, vol. 9, no. 4, pp. 24–31, 1997.</mixed-citation><mixed-citation xml:lang="en">S. N. Selezneva, “O slozhnosti raspoznavaniya polnoty mnozhestv bulevyh funkcij, realizovannyh polinomami Zhegalkina,” DMA, vol. 9, no. 4, pp. 24–31, 1997.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">S. S. Marchenkov, Zamknutye klassy bulevyh funkcij. Fizmatlit, 2000.</mixed-citation><mixed-citation xml:lang="en">S. S. Marchenkov, Zamknutye klassy bulevyh funkcij. Fizmatlit, 2000.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">V. P. Barashev and S. A. Unuchek, Diskretnaya matematika. RTU MIREA, 2012.</mixed-citation><mixed-citation xml:lang="en">V. P. Barashev and S. A. Unuchek, Diskretnaya matematika. RTU MIREA, 2012.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">G. P. Gavrilov and A. A. Sapozhenko, Zadachi i uprazhneniya po diskretnoj matematike. Fizmatlit, 2005.</mixed-citation><mixed-citation xml:lang="en">G. P. Gavrilov and A. A. Sapozhenko, Zadachi i uprazhneniya po diskretnoj matematike. Fizmatlit, 2005.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">N. V. Nikonov, “O svyazyah i otlichiyah poluzapretov I, II-go roda i zapretov K-znachnyh funkcij,” Forestry bulletin, no. 1, pp. 124–133, 2006.</mixed-citation><mixed-citation xml:lang="en">N. V. Nikonov, “O svyazyah i otlichiyah poluzapretov I, II-go roda i zapretov K-znachnyh funkcij,” Forestry bulletin, no. 1, pp. 124–133, 2006.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">S. S. Marchenkov, Osnovy teorii bulevyh funkcij. Fizmatlit, 2014.</mixed-citation><mixed-citation xml:lang="en">S. S. Marchenkov, Osnovy teorii bulevyh funkcij. Fizmatlit, 2014.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">L. Y. Bystrov and V. S. Rublev, “Bulevy funkcii, ne prinadlezhashchie predpolnym klassam,” in Zametki po informatike i matematike, vol. 13, Yaroslavl: P.G. Demidov Yaroslavl State University, 2021, pp. 22–26.</mixed-citation><mixed-citation xml:lang="en">L. Y. Bystrov and V. S. Rublev, “Bulevy funkcii, ne prinadlezhashchie predpolnym klassam,” in Zametki po informatike i matematike, vol. 13, Yaroslavl: P.G. Demidov Yaroslavl State University, 2021, pp. 22–26.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">A. I. Kostrikin, Vvedenie v algebpu. Chast' 1. Osnovy algebpy. Fizmatlit, 2000.</mixed-citation><mixed-citation xml:lang="en">A. I. Kostrikin, Vvedenie v algebpu. Chast' 1. Osnovy algebpy. Fizmatlit, 2000.</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
