?
КОМБИНАТОРНЫЙ АНАЛИЗ СХЕМЫ ПЕРЕСТАНОВОК ОПРЕДЕЛЕННОГО ВИДА СЕРИЙ
Труды Карельского научного центра РАН. Серия 10: Математическое моделирование и информационные технологии. 2021. № 6. С. 85–90.
Enatskaya N.
The article deals with a permutation scheme of size n with r successive series of
increasing elements. I solve the problems of finding the number of outcomes of the
scheme, and design the procedure for their enumeration using r successive schemes
of combinations of an array of different compositions of series of increasing serial
numbers of permutation elements. The numbering problem for outcomes of the
scheme is solved, and their simulation is discussed.
Keywords: permutation scheme; combination scheme; series of increasing serial
numbers of elements.
Prokofev V., Zabrodin A., Proceedings of the Steklov Institute of Mathematics 2020 Vol. 309 P. 225–239
We consider solutions of the matrix Kadomtsev-Petviashvili (KP) hierarchy that are trigonometric functions of the first hierarchical time t1 = x and establish the correspondence with the spin generalization of the trigonometric Calogero-Moser system at the level of hierarchies. Namely, the evolution of poles xi and matrix residues at the poles aαibβi of the solutions with respect to the kth hierarchical time of the ...
Added: July 14, 2026
Prokofev V., Zabrodin A., Journal of Physics A: Mathematical and Theoretical 2021 Vol. 54
We consider solutions of the Kadomtsev–Petviashvili hierarchy which are elliptic functions of x = t1. It is known that their poles as functions of t2 move as particles of the elliptic Calogero–Moser model. We extend this correspondence to the level of hierarchies and find the Hamiltonian Hk of the elliptic Calogero–Moser model which governs the dynamics of poles with respect to the kth ...
Added: July 14, 2026
Prokofev V., Zabrodin A., Theoretical and Mathematical Physics 2021 Vol. 208 P. 1093–115
We consider solutions of the 2D Toda lattice hierarchy which are elliptic functions of the zeroth time t_0=x. It is known that their poles as functions of t_1 move as particles of the elliptic Ruijsenaars-Schneider model. The goal of this paper is to extend this correspondence to the level of hierarchies. We show that the ...
Added: July 14, 2026
Prokofev V., Zabrodin A., Теоретическая и математическая физика 2023 Т. 217 № 2 С. 299–316
We continue the study of the B-Toda hierarchy (the Toda lattice with the constraint of type B), which can be regarded as a discretization of the BKP hierarchy. We introduce the tau function of the B-Toda hierarchy and obtain bilinear equations for it. Examples of soliton tau functions are presented in explicit form. ...
Added: July 14, 2026
Шиманогов И. Н., Vyalyi M., Дискретный анализ и исследование операций 2025 Т. 32 № 4 С. 213–230
A well-studied class of algorithmic problems is that of regular realizability: checking the non-emptiness of the intersection of a regular language with a given language. This problem has a natural algebraic interpretation: verifying whether an element of a Boolean algebra belongs to the kernel of a certain homomorphism. This motivates the consideration of an analogous ...
Added: July 12, 2026
Rybakov M., Annals of Pure and Applied Logic 2026 Vol. 177 Article 103811
The paper presents a solution to the question about the decidability of the two-variable fragment of the superintuitionistic predicate logic QLC defined by the class of linear Kripke frames, which is also the ‘superintuitionistic’ fragment of the modal predicate logic QS4.3, under the Gödel translation. We prove that the fragment is undecidable. The result remains true for the ...
Added: July 11, 2026
Panov V., Ryabchenko A., / Series arXiv "stat.ME". 2026. No. 2607.05048.
This paper investigates the problem of statistical inference for a mixture distribution consisting of a discrete and a continuous component, with a particular focus on the class of rational-infinitely divisible distributions. We consider non-parametric estimation of both components of the mixture as well as the quasi-L{é}vy measure, assuming that the mixture belongs to the class ...
Added: July 9, 2026
Springer, 2027.
The series Lecture Notes in Computer Science (LNCS), including its subseries Lecture Notes in Artificial Intelligence (LNAI) and Lecture Notes in Bioinformatics (LNBI), has established itself as a medium for the publication of new developments in computer science and information technology research, teaching, and education. LNCS enjoys close cooperation with the computer science R & ...
Added: July 8, 2026
Маликов М. А., Монахова Э. А., Rzaev E. et al., Ученые записки Казанского университета. Серия: Физико-математические науки 2026 Т. 168 № 2 С. 269–286
This article examines series of families of two-dimensional circulant networks with rectangular
L -shapes, optimal in diameter, as network-on-chip topologies with a minimal number of crossings
between the links and a bounded length of the maximum link that does not depend on the network
size. New network-on-chip routing algorithms, which use the coordinates of three adjacent zeros in
the ...
Added: July 8, 2026
Pilé I., Deng Y., Shchur L., Physical Review B: Condensed Matter and Materials Physics 2026 Vol. 114 No. 1 Article 014101
We investigate the spatial overlap of successive spin configurations in Markov chain Monte Carlo simulations using the local Metropolis algorithm and the Swendsen-Wang and Wolff cluster algorithms. We examine the dynamics of these algorithms for models in different universality classes: Ising model, Potts model with three components, and four-state Potts model. The overlap of two ...
Added: July 6, 2026
Irkutsk: ISDCT SB RAS, 2026.
We study a model problem on the filtration of a conducting fluid through a
porous layer. A porous medium is presented as an assemblage of identical spherical
cells. Each cell consists of a porous core and liquid shell. We derive apriori estimates
for flow characteristics which show the specific behavior of the fluid. Our estimates
are validated numerically. ...
Added: July 5, 2026
М.: Наука и технологии, 2026.
«Телекоммуникации» ежемесячный рецензируемый производственный, информационно-аналитический и учебно-методический журнал выходит в свет с июля 2000 г.
Для руководителей и работников промышленности, научно-исследовательских и проектно-конструкторских институтов, высших учебных заведений, аспирантов и студентов, а также для специалистов, разрабатывающих, выпускающих и эксплуатирующих средства телекоммуникаций.
Новости разработок и производства, прогнозы развития, защита информации, Нормативные, справочные, аналитические и учебно-методические материалы.
Переход к глобальному информационному ...
Added: July 4, 2026
МФТИ, 2025.
абота редакции научного журнала «Труды Московского физико-технического института» (кратко «Труды МФТИ»), редакционной коллегии и редакционного совета осуществляется в соответствии с Положением, утвержденным ректором института. В состав редакционной коллегии входят руководители института, факультетов, институтских и факультетских кафедр. Главный редактор журнала —президент МФТИ, член-корр. РАН Кудрявцев Н.Н.
Журнал «Труды МФТИ» входит в базу данных РИНЦ (Российский Индекс Научного Цитирования) и доступен в электронной ...
Added: July 4, 2026
Springer, 2026.
This book presents established and new research on the close connections between graph games and systems of logic, particularly existing and newly designed modal logics. The volume utilizes two graph games – the sabotage game and the hide-and-seek game – to demonstrate the natural interplay between designing new graph games and exploring new kinds of ...
Added: June 30, 2026
Pochinka O., Barinova M., Journal of Geometry and Physics 2026 Vol. 228 P. 1–8
In the present paper we consider an Ω-stable 3-diffeomorphism with a solid or thickened surfaced non-trivial basic set. Such basic sets include, for instance, all one-dimensional expanding attractors and those two-dimensional basic sets that are not expanding. We prove that the chain recurrent set of every such a diffeomorphism necessarily contains at least two non-trivial ...
Added: June 30, 2026
German O., Illarionov A., Известия РАН. Серия математическая 2026 Т. 90 № 3 С. 3–18
Пусть симплекс с целочисленными вершинами - содержащий ровно одну целочисленную точку, отличную от своих вершин. В работе доказывается, что если точка находится во внутренности симплекса или в относительной внутренности некоторой гиперграни симплекса, то объем симплекса ограничен величиной, зависящей только от размерности, в противном случае объем симплекса может быть сколь угодно большим. Этот результат применяется для вывода асимптотической формулы для среднего числа вершин полиэдров ...
Added: June 29, 2026
Enatskaya N., Труды Карельского научного центра РАН. Серия 10: Математическое моделирование и информационные технологии 2024 № 4 С. 55–60
A given range of fixed elements of a permutation means a certain number of elements between the elements located at the extremes in the permutation in each sequence. The proposed scheme is analyzed in the pre-asymptotic region of feasible parameter values using the enumerative method designed by the author, i. e., the enumerative combinatorics problems ...
Added: October 27, 2024
Enatskaya N., Труды Карельского научного центра РАН 2023 № 4 С. 71–76
Problems of enumerative combinatorics are solved for the proposed scheme, i. e. the number of its outcomes is determined, their direct listing is constructed, the numbering problem is solved, the probability distribution of the scheme outcomes is found, and a procedure for their modeling is proposed. ...
Added: August 3, 2023
Enatskaya N., , in: APPLICATIONS OF MATHEMATICS IN ENGINEERING AND ECONOMICS (AMEE’20): Proceedings of the 46th International Conference “Applications of Mathematics in Engineering and Economics”Vol. 2333. Issue 3.: AIP Publishing LLC, 2021. Ch. 2333 P. 150012-1–150012-7.
Added: October 15, 2021
AIP Publishing LLC, 2021.
Added: October 15, 2021
Enatskaya N., Труды Карельского научного центра Российской академии наук 2020 № 7 С. 120–126
The problems of the scheme analysis here consist in arranging the procedure
for enumerating the outcomes of the scheme, determining their number, solving
the problem of numbering these outcomes, and their modelling using the results
obtained here through similar studies of the same scheme but without restrictions.
Keywords: distinguishable particles; combination scheme; minimal elements in
cells. ...
Added: October 17, 2020
Enatskaya N., Промышленные АСУ и контроллеры 2018 № 1 С. 58–61
The direct enumeration of the outcomes by the graph method fulfils and their number is find, the probability of outcomes of the scheme in the general combination scheme. The enumeration is solved for outcomes of the scheme and on this base the algorithm of their quick modelling is suggested. ...
Added: February 8, 2018
Enatskaya N., Труды Карельского научного центра Российской академии наук 2016 № 8 С. 136–140
Outputs of thecircuit are enumerated directly by the graph method, their number and probability in the general combinations circuit are determined, the problem of enumeration of outputs is solved and the algorithm of their rapid modeling is suggestrd on this basis. ...
Added: September 19, 2016
Н.Ю.Энатская, Промышленные АСУ и контроллеры 2015 № 8 С. 33–38
We consider procedures to numbers all outcomes of a combination scheme, establish a one-to-one correspondence between the outcomes and its numbers generated in numbering procedure, and give some methods to simulate the outcomes. ...
Added: November 9, 2015