<?xml version='1.0' encoding='utf-8'?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.2 20190208//EN" "http://jats.nlm.nih.gov/publishing/1.2/JATS-journalpublishing1.dtd">
<article article-type="research-article" dtd-version="1.2" xml:lang="ru" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><front><journal-meta><journal-id journal-id-type="issn">2518-1092</journal-id><journal-title-group><journal-title>Research result. Information technologies</journal-title></journal-title-group><issn pub-type="epub">2518-1092</issn></journal-meta><article-meta><article-id pub-id-type="doi">10.18413/2518-1092-2026-11-3-0-9</article-id><article-id pub-id-type="publisher-id">4362</article-id><article-categories><subj-group subj-group-type="heading"><subject>COMPUTER SIMULATION</subject></subj-group></article-categories><title-group><article-title>&lt;strong&gt;DESCRIPTION OF A COMBINATORIAL ALGORITHM FOR ENUMERATING ORDERED MULTIPLICATIVE FACTORIZATIONS&lt;/strong&gt;</article-title><trans-title-group xml:lang="en"><trans-title>&lt;strong&gt;DESCRIPTION OF A COMBINATORIAL ALGORITHM FOR ENUMERATING ORDERED MULTIPLICATIVE FACTORIZATIONS&lt;/strong&gt;</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author"><name-alternatives><name xml:lang="ru"><surname>Rumbesht</surname><given-names>Vadim Валерьевич</given-names></name><name xml:lang="en"><surname>Rumbesht</surname><given-names>Vadim Валерьевич</given-names></name></name-alternatives><email>rumbesht@bsuedu.ru</email></contrib><contrib contrib-type="author"><name-alternatives><name xml:lang="ru"><surname>Burdanova</surname><given-names>Ekaterina Vasilyevna</given-names></name><name xml:lang="en"><surname>Burdanova</surname><given-names>Ekaterina Vasilyevna</given-names></name></name-alternatives><email>burdanova@bsuedu.ru</email></contrib></contrib-group><pub-date pub-type="epub"><year>2026</year></pub-date><volume>11</volume><issue>3</issue><fpage>0</fpage><lpage>0</lpage><self-uri content-type="pdf" xlink:href="/media/information/2026/3/ИТ_НР_11_3_9.pdf" /><abstract xml:lang="ru"><p>The article is devoted to solving a typical combinatorial problem &amp;ndash; a systematic enumeration of all objects of a certain type. The decomposition of an integer  &amp;nbsp;into an ordered product of integer multipliers (the so-called   -profile of number  ) is accepted as an object for enumeration. The purpose of the article is to create a combinatorial algorithm for the systematic enumeration of all   -profiles of number  . To achieve this goal, a formal formulation of the problem was carried out, its analysis was carried out, in which the concept of a characteristic matrix of   -profile  &amp;nbsp;was introduced and a one-to-one correspondence between profiles and characteristic matrices was established, which made it possible to move from enumerating profiles to enumerating characteristic matrices, followed by their transformation into profiles. An  -equivalence relation is introduced on the set of characteristic matrices, which makes it possible to divide it into classes and list the elements of the selected  -equivalence class independently of the rest of the characteristic matrices. It is shown that the generation of an  -equivalent characteristic matrix is the process of determining its elements by distributing units of multiplicities of prime factors in the canonical expansion of a number  , and this process is considered in detail. At the synthesis stage, the results of the task analysis are translated into the desired algorithm. An example of enumeration   -profiles of number  &amp;nbsp;using this algorithm is given.</p></abstract><trans-abstract xml:lang="en"><p>The article is devoted to solving a typical combinatorial problem &amp;ndash; a systematic enumeration of all objects of a certain type. The decomposition of an integer  &amp;nbsp;into an ordered product of integer multipliers (the so-called   -profile of number  ) is accepted as an object for enumeration. The purpose of the article is to create a combinatorial algorithm for the systematic enumeration of all   -profiles of number  . To achieve this goal, a formal formulation of the problem was carried out, its analysis was carried out, in which the concept of a characteristic matrix of   -profile  &amp;nbsp;was introduced and a one-to-one correspondence between profiles and characteristic matrices was established, which made it possible to move from enumerating profiles to enumerating characteristic matrices, followed by their transformation into profiles. An  -equivalence relation is introduced on the set of characteristic matrices, which makes it possible to divide it into classes and list the elements of the selected  -equivalence class independently of the rest of the characteristic matrices. It is shown that the generation of an  -equivalent characteristic matrix is the process of determining its elements by distributing units of multiplicities of prime factors in the canonical expansion of a number  , and this process is considered in detail. At the synthesis stage, the results of the task analysis are translated into the desired algorithm. An example of enumeration   -profiles of number  &amp;nbsp;using this algorithm is given.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>ordered multiplicative decomposition</kwd><kwd>n-profile of number r</kwd><kwd>combinatorial algorithm</kwd><kwd>systematic enumeration</kwd><kwd>characteristic matrix of n-profile of  r</kwd><kwd>distribution process</kwd></kwd-group><kwd-group xml:lang="en"><kwd>ordered multiplicative decomposition</kwd><kwd>n-profile of number r</kwd><kwd>combinatorial algorithm</kwd><kwd>systematic enumeration</kwd><kwd>characteristic matrix of n-profile of  r</kwd><kwd>distribution process</kwd></kwd-group></article-meta></front><back><ref-list><title>Список литературы</title><ref id="B1"><mixed-citation>1.&amp;nbsp; Vinogradov I.M. Fundamentals of Number Theory. Moscow, GITTL, 1952. &amp;ndash; 180 p.</mixed-citation></ref><ref id="B2"><mixed-citation>2.&amp;nbsp; Giyasi A., Mikhailov I.P., Chubarikov V.N. On the uniform distribution of remainders in the expansion of real numbers according to a multiplicative number system. // Chebyshevskii Sbornik. 2022. No. 23(5). pp. 38-44.</mixed-citation></ref><ref id="B3"><mixed-citation>3.&amp;nbsp; Danilov A.V., Makarychev P.P. Combinatorial algorithm for target assignment // Izvestiya Vysshikh Uchebnykh Zavedenii. Povolzhsky Region. Technical Sciences. 2025. No. 3 (75). pp. 86-99.</mixed-citation></ref><ref id="B4"><mixed-citation>4.&amp;nbsp; Ivanov B.N. Discrete Mathematics: Algorithms and Programs. 2001. Moscow: Laboratoriya Bazovykh Znaniy. 288 p.</mixed-citation></ref><ref id="B5"><mixed-citation>5.&amp;nbsp; Inyutin S.A. Computational Tools for Modular Algorithms: Monograph. Moscow, 2024.</mixed-citation></ref><ref id="B6"><mixed-citation>6. Study of approaches to detecting moving objects in noisy images / Abramov K.V., Alexandrov K.S., Balabanova T.N., Babenko A.A., Burdanova E.V. &amp;nbsp;// Research result. Information technologies. &amp;ndash; Т. 10, №1, 2025.&amp;nbsp;&amp;ndash; P. 47-57.&amp;nbsp;</mixed-citation></ref><ref id="B7"><mixed-citation>7. Kaygorodov E.V., Krylov P.A., Tuganbaev A.A. On some linear maps of incidence coalgebras // Applied Mathematics &amp;amp; Physics. &amp;ndash; 2024. &amp;ndash; T. 56. No. 4. &amp;ndash; P. 273-285.</mixed-citation></ref><ref id="B8"><mixed-citation>8. Method of System-Object Modeling of Document Flow / Najajra M.H., Bobyshev P.P., Fedorov V.I., Lozovaya S.Y., Babenko A.A. // Economics. Information Technologies. &amp;ndash; 2026. &amp;ndash; 53(1) &amp;ndash; P. 122-135.</mixed-citation></ref><ref id="B9"><mixed-citation>9.&amp;nbsp; Chernomorets D.A., Bolgova E.V., Chernomorets A.A., Petina M.A. On estimating the size of informative fragments in the sea surface images // Research result. Information technologies. &amp;ndash; Т.9, №2, 2024. &amp;ndash; P. 3-11.</mixed-citation></ref><ref id="B10"><mixed-citation>10. Polyuga V.A., Shablya Yu.V. Investigation of the Performance of Software Implementations of Combinatorial Generation Algorithms Based on Data Representation Approaches // Applied Mathematics and Informatics: Modern Research in Natural and Technical Sciences. Proceedings of the IX International Scientific and Practical Conference (Workshop-Seminar) of Young Scientists. Tolyatti. &amp;ndash; 2023. &amp;ndash; P. 60-66.</mixed-citation></ref><ref id="B11"><mixed-citation>11. Rumbesht V.V., Burdanova E.V. Combinatorics of ordered multiplicative factorizations. // Scientific Bulletin of Belgorod State University: Economics. Informatics. 2020. &amp;ndash; No. 47 (1). &amp;ndash; P. 126-134.</mixed-citation></ref><ref id="B12"><mixed-citation>12. Ryzhenko K.V., Khachay M.Yu., Neznakhina E.D. Approximation algorithms with constant accuracy bounds for certain asymmetric combinatorial routing problems // Modern Problems of Mathematics and Its Applications. Abstracts of the International (54th All-Russian) Youth School-Conference. Yekaterinburg. &amp;ndash; 2023. &amp;ndash; P. 56.</mixed-citation></ref><ref id="B13"><mixed-citation>13. Sohrabi M., Fathollahi-Fard A.M., Gromov V.A. Genetic Engineering Algorithm (GEA): An Efficient Metaheuristic Algorithm for Solving Combinatorial Optimization Problems // Automation and Remote Control. &amp;ndash; 2024. &amp;ndash; No. 3. &amp;ndash; P. 23-37.</mixed-citation></ref><ref id="B14"><mixed-citation>14. Tokareva A.V., Kruchinin D.V. On the Applicability of Combinatorial Generation Algorithms to the Inventory Process // Reshetnev Readings: Proceedings of the XXVII International Scientific and Practical Conference Dedicated to the Memory of Academician M.F. Reshetnev, General Designer of Rocket and Space Systems: in 2 parts. Krasnoyarsk. &amp;ndash; 2023. &amp;ndash; P. 171-173.</mixed-citation></ref><ref id="B15"><mixed-citation>15. Adams S. Locally free actions on lorentz manifolds // Geometric And Functional Analysis. &amp;ndash; 2000. &amp;ndash; Т.&amp;nbsp;10. №&amp;nbsp;3. &amp;ndash; P. 453-515.</mixed-citation></ref><ref id="B16"><mixed-citation>16. Antinucci G., Giuliani A., Greenblatt R.L. Non-integrable ising models in cylindrical geometry: grassmann representation and infinite volume limit // Annales Henri Poincare. &amp;ndash; 2022. &amp;ndash; Т. 23. №&amp;nbsp;3. &amp;ndash; P. 1061-1139.</mixed-citation></ref><ref id="B17"><mixed-citation>17. Holroyd A.E., Janson S., W&amp;auml;stlund J. Minimal matchings of point processes // Probability Theory and Related Fields. &amp;ndash; 2022. &amp;ndash; Т. 184. №&amp;nbsp;1. &amp;ndash; P. 571-611.</mixed-citation></ref><ref id="B18"><mixed-citation>18. Isaev A.P. Quantum groups and yang-baxter equations // Natural Science Review. &amp;ndash; 2025. &amp;ndash; Т. 2. №&amp;nbsp;2. &amp;ndash; P. 1-192.</mixed-citation></ref><ref id="B19"><mixed-citation>19. Mar&amp;ograve; S., Bonanno C. Asymptotic behaviour of orbit determination for hyperbolic maps // Celestial Mechanics and Dynamical Astronomy. &amp;ndash; 2021. Т. 133. &amp;ndash; №&amp;nbsp;6.</mixed-citation></ref><ref id="B20"><mixed-citation>20. Jiang H., Benzaria S., Alsadun N., Jia J., Czaban-J&amp;oacute;źwiak Ju., Guillerm V., Shkurenko A., Thiam Z., Bonneau M., Maka V.K., Chen Zh., Ameuhhr Z.O., O&amp;rsquo;Keeffe M., Eddaoudi M. Merged-nets enumeration for the systematic design of multicomponent reticular structures // Science. &amp;ndash; 2024. &amp;ndash; Т. 386. &amp;ndash; №&amp;nbsp;6722. &amp;ndash; P. 659-666.</mixed-citation></ref></ref-list></back></article>