Geodesic
Globalization of the analysis of particle placement models by cells
Journal of Samara State Technical University, Ser. Physical and Mathematical Sciences, Tome 25 (2021) no. 3, pp. 571-587.

Voir la notice de l'article provenant de la source Math-Net.Ru

The title of the paper means that its goal is a general approach to the pre-asmptotic analysis of schemes with different qualities in all combinations of their distinguishability of their constituent elements (cells and particles). To do this, in each group of such schemes with general restrictions, instead of directly studying them based on the specificity of each scheme, a certain general set of algorithmic procedures for recalculating the results of their pre-asymptotic analysis in the scheme is proposed, starting with the scheme with the greatest differentiation of their outcomes, sequentially for other schemes of the group with differences as one item. The analysis of each scheme is carried out according to the traditional and in a number of new following directions: constructing a random process of formation and numbered non-repeated enumeration of the outcomes of the scheme in the order of their receipt, finding their number, solving the numbering problem for the outcomes of the scheme, which consists in establishing a one-to-one correspondence between their types and numbers, setting their probabilistic distribution and modeling the outcomes of the scheme with this probabilistic distribution. In particular, the cases of groups of schemes without restrictions on the placement of particles and with a restriction of at most one particle in a cell are studied separately, which lead to some well-known analytical results. Under any restrictions in the considered group of circuits, their analysis is carried out by implementing algorithmic procedures for sequential transformation of the results of the analysis of one circuit of the group for another. Combinations into such pairs of schemes are made on the basis of the difference in the quality of one of their elements.
Keywords: placement of particles into cells, pre-asymptotic analysis. 
@article{VSGTU_2021_25_3_a10,
     author = {N. Yu. Enatskaya},
     title = {Globalization of the analysis of particle placement models by cells},
     journal = {Journal of Samara State Technical University, Ser. Physical and Mathematical Sciences},
     pages = {571--587},
     publisher = {mathdoc},
     volume = {25},
     number = {3},
     year = {2021},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VSGTU_2021_25_3_a10/}
}
TY  - JOUR
AU  - N. Yu. Enatskaya
TI  - Globalization of the analysis of particle placement models by cells
JO  - Journal of Samara State Technical University, Ser. Physical and Mathematical Sciences
PY  - 2021
SP  - 571
EP  - 587
VL  - 25
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/VSGTU_2021_25_3_a10/
LA  - ru
ID  - VSGTU_2021_25_3_a10
ER  - 
%0 Journal Article
%A N. Yu. Enatskaya
%T Globalization of the analysis of particle placement models by cells
%J Journal of Samara State Technical University, Ser. Physical and Mathematical Sciences
%D 2021
%P 571-587
%V 25
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/VSGTU_2021_25_3_a10/
%G ru
%F VSGTU_2021_25_3_a10
N. Yu. Enatskaya. Globalization of the analysis of particle placement models by cells. Journal of Samara State Technical University, Ser. Physical and Mathematical Sciences, Tome 25 (2021) no. 3, pp. 571-587. http://geodesic.mathdoc.fr/item/VSGTU_2021_25_3_a10/

[1] Vilenkin N. Ya., Combinatorics, Academic Press, New York, 1971, xiii+296 pp. | Zbl | Zbl

[2] Riordan J., An Introduction to Combinatorial Analysis, Wiley Publicatlon in Mathematical Statistics, John Wiley and Sons, New York, 1958, x+244 pp. | Zbl

[3] Sachkov V. N., Combinatorial Methods in Discrete Mathematics, Encyclopedia of Mathematics and its Applications, 55, Cambridge Univ. Press, Cambridge, 1996, xiii+306 pp. | DOI | Zbl | Zbl

[4] Sachkov V. N., Probabilistic Methods in Combinatorial Analysis, Encyclopedia of Mathematics and its Applications, 56, Cambridge Univ. Press, Cambridge, 1997, x+246 pp. | DOI | Zbl

[5] Hall M., Combinatorial Theory, Wiley Classics Library, Chichester, 1998, xviii+440 pp. | Zbl

[6] Ryser H. J., Combinatorial Mathematics, The Carus Mathematical Monographs, 14, John Wiley and Sons, New York, 1963, xiv+154 pp. | DOI | Zbl

[7] Rybnikov K. A., Vvedenie v kombinatornyi analiz [Introduction to Combinatorial Analysis], Moscow State Univ., Moscow, 1985, 312 pp. (In Russian) | Zbl

[8] Kolchin V. F., Sevast'yanov B. A., Chistyakov V. P., Random Allocations, Scripta Series in Mathematics, John Wiley and Sons, New York, 1978, xi+262 pp. | Zbl | Zbl

[9] Goulden I. P. Jackon D. M., Combinatorial Enumeration, Dover Publ., Mineola, NY, 2004, xxvi+569 pp. | Zbl

[10] Enatskaya N. Yu., “Probabilistic models of combinatorial schemes”, Bulletin of the South Ural State University, Ser. Mathematical Modelling, Programming and Computer Software, 13:3 (2020), 103–111 (In Russian) | DOI | Zbl

[11] Enatskaya N. Yu., “Analysis of combinatorial schemes in the pre-asymptotic region of parameter change”, Proceedings of the Karelian Research Centre of the Russian Academy of Sciences, 2018, no. 7, 117–133 (In Russian) | DOI

[12] Enatskaya N. Yu., “Combinatorial analysis of the scheme of allocation of distinguishable particles into distinguishable cells without empty cells”, Proceedings of the Karelian Research Centre of the Russian Academy of Sciences, 2020, no. 7, 120–126 (In Russian) | DOI