<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE root>
<article 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" xmlns:ali="http://www.niso.org/schemas/ali/1.0/" article-type="research-article" dtd-version="1.2" xml:lang="en"><front><journal-meta><journal-id journal-id-type="publisher-id">Discrete and Continuous Models and Applied Computational Science</journal-id><journal-title-group><journal-title xml:lang="en">Discrete and Continuous Models and Applied Computational Science</journal-title><trans-title-group xml:lang="ru"><trans-title>Discrete and Continuous Models and Applied Computational Science</trans-title></trans-title-group></journal-title-group><issn publication-format="print">2658-4670</issn><issn publication-format="electronic">2658-7149</issn><publisher><publisher-name xml:lang="en">Peoples' Friendship University of Russia named after Patrice Lumumba (RUDN University)</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="publisher-id">29430</article-id><article-id pub-id-type="doi">10.22363/2658-4670-2021-29-4-387-398</article-id><article-categories><subj-group subj-group-type="toc-heading" xml:lang="en"><subject>Articles</subject></subj-group><subj-group subj-group-type="toc-heading" xml:lang="ru"><subject>Статьи</subject></subj-group><subj-group subj-group-type="article-type"><subject>Research Article</subject></subj-group></article-categories><title-group><article-title xml:lang="en">On involutive division on monoids</article-title><trans-title-group xml:lang="ru"><trans-title>Об инволютивном делении на моноидах</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0002-5691-7331</contrib-id><name-alternatives><name xml:lang="en"><surname>Kroytor</surname><given-names>Oleg K.</given-names></name><name xml:lang="ru"><surname>Кройтор</surname><given-names>О. К.</given-names></name></name-alternatives><bio xml:lang="en"><p>PhD student of Department of Applied Probability and Informatics</p></bio><email>kroytor_ok@pfur.ru</email><xref ref-type="aff" rid="aff1"/></contrib><contrib contrib-type="author"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0001-6541-6603</contrib-id><name-alternatives><name xml:lang="en"><surname>Malykh</surname><given-names>Mikhail D.</given-names></name><name xml:lang="ru"><surname>Малых</surname><given-names>М. Д.</given-names></name></name-alternatives><bio xml:lang="en"><p>Doctor of Physical and Mathematical Sciences, Assistant professor of Department of Applied Probability and Informatics of Peoples’ Friendship University of Russia (RUDN University); Researcher in Meshcheryakov Laboratory of Information Technologies, Joint Institute for Nuclear Research</p></bio><email>malykh_md@pfur.ru</email><xref ref-type="aff" rid="aff1"/><xref ref-type="aff" rid="aff2"/></contrib></contrib-group><aff-alternatives id="aff1"><aff><institution xml:lang="en">Peoples’ Friendship University of Russia (RUDN University)</institution></aff><aff><institution xml:lang="ru">Российский университет дружбы народов</institution></aff></aff-alternatives><aff-alternatives id="aff2"><aff><institution xml:lang="en">Joint Institute for Nuclear Research</institution></aff><aff><institution xml:lang="ru">Объединённый институт ядерных исследований</institution></aff></aff-alternatives><pub-date date-type="pub" iso-8601-date="2021-11-12" publication-format="electronic"><day>12</day><month>11</month><year>2021</year></pub-date><volume>29</volume><issue>4</issue><issue-title xml:lang="en">VOL 29, NO4 (2021)</issue-title><issue-title xml:lang="ru">ТОМ 29, №4 (2021)</issue-title><fpage>387</fpage><lpage>398</lpage><history><date date-type="received" iso-8601-date="2021-11-12"><day>12</day><month>11</month><year>2021</year></date></history><permissions><copyright-statement xml:lang="en">Copyright ©; 2021, Kroytor O.K., Malykh M.D.</copyright-statement><copyright-statement xml:lang="ru">Copyright ©; 2021, Кройтор О.К., Малых М.Д.</copyright-statement><copyright-year>2021</copyright-year><copyright-holder xml:lang="en">Kroytor O.K., Malykh M.D.</copyright-holder><copyright-holder xml:lang="ru">Кройтор О.К., Малых М.Д.</copyright-holder><ali:free_to_read xmlns:ali="http://www.niso.org/schemas/ali/1.0/"/><license><ali:license_ref xmlns:ali="http://www.niso.org/schemas/ali/1.0/">http://creativecommons.org/licenses/by/4.0</ali:license_ref></license></permissions><self-uri xlink:href="https://journals.rudn.ru/miph/article/view/29430">https://journals.rudn.ru/miph/article/view/29430</self-uri><abstract xml:lang="en"><p style="text-align: justify;">We consider an arbitrary monoid <math xmlns:mml="http://www.w3.org/1998/Math/MathML"><semantics><mi>M</mi><annotation encoding="LaTeX">M</annotation></semantics></math>, on which an involutive division is introduced, and the set of all its finite subsets Set<math xmlns:mml="http://www.w3.org/1998/Math/MathML"><semantics><mi>M</mi><annotation encoding="LaTeX">M</annotation></semantics></math>. Division is considered as a mapping <math xmlns:mml="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>d</mi><mo>:</mo><mi>S</mi><mi>e</mi><mi>t</mi><mi>M</mi><mo>×</mo><mi>M</mi></mrow><annotation encoding="LaTeX">{d:SetM \times M}</annotation></semantics></math>, whose image <math xmlns:mml="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>d</mi><mo>(</mo><mi>U</mi><mo>,</mo><mi>m</mi><mo>)</mo></mrow><annotation encoding="LaTeX">{d(U,m)}</annotation></semantics></math> is the set of divisors of <math xmlns:mml="http://www.w3.org/1998/Math/MathML"><semantics><mi>m</mi><annotation encoding="LaTeX">m</annotation></semantics></math> in <math xmlns:mml="http://www.w3.org/1998/Math/MathML"><semantics><mi>U</mi><annotation encoding="LaTeX">U</annotation></semantics></math>. The properties of division and involutive division are defined axiomatically. Involutive division was introduced in accordance with the definition of involutive monomial division, introduced by V.P. Gerdt and Yu.A. Blinkov. New notation is proposed that provides brief but explicit allowance for the dependence of division on the Set<math xmlns:mml="http://www.w3.org/1998/Math/MathML"><semantics><mi>M</mi><annotation encoding="LaTeX">M</annotation></semantics></math> element. The theory of involutive completion (closures) of sets is presented for arbitrary monoids, necessary and sufficient conditions for completeness (closedness) - for monoids generated by a finite set <math xmlns:mml="http://www.w3.org/1998/Math/MathML"><semantics><mi>X</mi><annotation encoding="LaTeX">X</annotation></semantics></math>. The analogy between this theory and the theory of completely continuous operators is emphasized. In the last section, we discuss the possibility of solving the problem of replenishing a given set by successively expanding the original domain and its connection with the axioms used in the definition of division. All results are illustrated with examples of Thomas monomial division.</p></abstract><trans-abstract xml:lang="ru"><p style="text-align: justify;">Рассматривается произвольный моноид <math xmlns:mml="http://www.w3.org/1998/Math/MathML"><semantics><mi>M</mi><annotation encoding="LaTeX">M</annotation></semantics></math>, на котором введено инволютивное деление, и множество всех его конечных подмножеств Set<math xmlns:mml="http://www.w3.org/1998/Math/MathML"><semantics><mi>M</mi><annotation encoding="LaTeX">M</annotation></semantics></math>. Деление рассматривается как отображение <math xmlns:mml="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>d</mi><mo>:</mo><mi>S</mi><mi>e</mi><mi>t</mi><mi>M</mi><mo>×</mo><mi>M</mi></mrow><annotation encoding="LaTeX">{d:SetM \times M}</annotation></semantics></math>, образ которого <math xmlns:mml="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>d</mi><mo>(</mo><mi>U</mi><mo>,</mo><mi>m</mi><mo>)</mo></mrow><annotation encoding="LaTeX">{d(U,m)}</annotation></semantics></math> - множество делителей <math xmlns:mml="http://www.w3.org/1998/Math/MathML"><semantics><mi>m</mi><annotation encoding="LaTeX">m</annotation></semantics></math> в <math xmlns:mml="http://www.w3.org/1998/Math/MathML"><semantics><mi>U</mi><annotation encoding="LaTeX">U</annotation></semantics></math>. Свойства деления и инволютивного деления задаются аксиоматически. Понятия инволютивного деления введено в соответствии с определением инволютивного мономиального деления, введённым В.П. Гердтом и Ю.А. Блинковым. Предложен ряд новых обозначений, позволяющих коротко, но явно учитывать зависимость деления от элемента Set<math xmlns:mml="http://www.w3.org/1998/Math/MathML"><semantics><mi>M</mi><annotation encoding="LaTeX">M</annotation></semantics></math>. Теория инволютивного пополнения (замыкания) множеств изложена для произвольных моноидов, необходимые и достаточные условия полноты (замкнутости) - для моноидов, порождённых конечным множеством <math xmlns:mml="http://www.w3.org/1998/Math/MathML"><semantics><mi>X</mi><annotation encoding="LaTeX">X</annotation></semantics></math>. Подчёркнута аналогия между этой теорией и теорией вполне непрерывных операторов. В последнем разделе обсуждена возможность решения задачи о пополнении заданного множества путём последовательного расширения исходной области и её связь с аксиомами, используемыми в определении деления. Все результаты проиллюстрированы примерами о мономиальном делении Томаса.</p></trans-abstract><kwd-group xml:lang="en"><kwd>involutive monomial division</kwd><kwd>Gröbner basis</kwd></kwd-group><kwd-group xml:lang="ru"><kwd>инволютивное мономиальное деление</kwd><kwd>базис Грёбнера</kwd></kwd-group><funding-group/></article-meta></front><body></body><back><ref-list><ref id="B1"><label>1.</label><mixed-citation>C. Riquier, Les Systèmes d’Equations aux Dérivées Partielles. Paris: Gauthier-Villars, 1910.</mixed-citation></ref><ref id="B2"><label>2.</label><mixed-citation>M. Janet, “Systèmes d’équations aux dérivées partielles,” Journals de mathématiques, 8e série, vol. 3, pp. 65-151, 1920.</mixed-citation></ref><ref id="B3"><label>3.</label><mixed-citation>J. Thomas, Differential systems. New York: American Mathematical Society, 1937.</mixed-citation></ref><ref id="B4"><label>4.</label><mixed-citation>A. Y. Zharkov, “Involutive polynomial bases: general case,” in Preprint JINR E5-94-224. Dubna, 1994.</mixed-citation></ref><ref id="B5"><label>5.</label><mixed-citation>A. Y. Zharkov and Y. A. Blinkov, “Involutive bases of zero-dimensional ideals,” in Preprint JINR E5-94-318. Dubna, 1994.</mixed-citation></ref><ref id="B6"><label>6.</label><mixed-citation>A. Y. Zharkov and Y. A. Blinkov, “Solving zero-dimensional involutive systems,” in Progress in Mathematics. Basel: Birkhauser, 1996, vol. 143, pp. 389-399. DOI: 10.1007/978-3-0348-9104-2_20.</mixed-citation></ref><ref id="B7"><label>7.</label><mixed-citation>A. Y. Zharkov and Y. A. Blinkov, “Involution approach to investigating polynomial systems,” Mathematics and Computers in Simulation, vol. 42, pp. 323-332, 1996. DOI: 10.1016/S0378-4754(96)00006-7.</mixed-citation></ref><ref id="B8"><label>8.</label><mixed-citation>V. P. Gerdt and Y. A. Blinkov, “Involutive bases of polynomial ideals,” Mathematics and Computers in Simulation, vol. 45, no. 5-6, pp. 519- 541, 1998. DOI: 10.1016/s0378-4754(97)00127-4.</mixed-citation></ref><ref id="B9"><label>9.</label><mixed-citation>V. P. Gerdt, “Gröbner bases and involutive methods for algebraic and differential equations,” Mathematical and computer modelling, vol. 25, no. 8-9, pp. 75-90, 1997. DOI: 10.1016/S0895-7177(97)00060-5.</mixed-citation></ref><ref id="B10"><label>10.</label><mixed-citation>V. P. Gerdt and Y. A. Blinkov, “Involutive divisions of monomials,” Programming and Computer Software, vol. 24, no. 6, pp. 283-285, 1998.</mixed-citation></ref><ref id="B11"><label>11.</label><mixed-citation>Y. A. Blinkov, “Division and algorithms in the ideal membership problem [Deleniye i algoritmy v zadache o prinadlezhnosti k idealu],” Izvestija Saratovskogo universiteta, vol. 1, no. 2, pp. 156-167, 2001, in Russian.</mixed-citation></ref><ref id="B12"><label>12.</label><mixed-citation>V. P. Gerdt. “Compact involutive monomial bases.” (2020), [Online]. Available: https://events.rudn.ru/event/102.</mixed-citation></ref><ref id="B13"><label>13.</label><mixed-citation>Y. A. Blinkov, “Involutive methods applied to models described by systems of algebraic and differential equations [Involyutivnyye metody issledovaniya modeley, opisyvayemykh sistemami algebraicheskikh i differentsial’nykh uravneniy],” in Russian, Ph.D. dissertation, Saratov State University, Saratov, 2009.</mixed-citation></ref><ref id="B14"><label>14.</label><mixed-citation>J. Apel, “A Gröbner approach to involutive bases,” Journal of Symbolic Computation, vol. 19, no. 5, pp. 441-458, 1995. DOI: 10.1006/jsco. 1995.1026.</mixed-citation></ref><ref id="B15"><label>15.</label><mixed-citation>A. Y. Zharkov and Y. A. Blinkov, “Involution approach to solving systems of algebraic equations,” in Proceedings of the 1993 International IMACS Symposium on Symbolic Computation. Laboratoire d’Informatique Fondamentale de Lille, France, 1993, pp. 11-16.</mixed-citation></ref></ref-list></back></article>
