Asymptotics with remainder term for moments of the total cycle number of random A-permutation

References

[1] Bender E.A., “Asymptotic methods in enumeration”, SIAM Review, 16:4 (1974), 485–515.10.1137/1016082Search in Google Scholar

[2] Goncharov V. L., “On the field of combinatory analysis”, Amer. Math. Soc. Transl., 19 (1962), 1–46.Search in Google Scholar

[3] Zacharovas V., “Distribution of the logarithm of the order of a random permutation”, Lith. Math. J., 44:3 (2004), 296–327.10.1023/B:LIMA.0000046878.72618.bbSearch in Google Scholar

[4] Klimavicius, J., Manstavicius, E., “Turan–Kubilius’ inequality on permutations”, Ann. Univ. Sci. Budapest. Sect. Comput., 48 (2018), 45–51.Search in Google Scholar

[5] Manstavicius E., Stepas V., “Variance of additive functions defined on random assemblies”, Lith. Math. J., 57:2 (2017), 222–235.10.1007/s10986-017-9356-1Search in Google Scholar

[6] Pavlov A. I., “On the limit distribution of the number of cycles and the logarithm of the order of a class of permutations”, Math. USSR-Sb., 42:4 (1982), 539–567.10.1070/SM1982v042n04ABEH002401Search in Google Scholar

[7] Pavlov A. I., “On some classes of permutations with number-theoretic restrictions on the lengths of cycles”, Math. USSR-Sb., 57:1 (1987), 263–275.10.1070/SM1987v057n01ABEH003068Search in Google Scholar

[8] Pavlov A. I., “On the number of substitutions with cycle lengths from a given set”, Discrete Math. Appl., 2:4 (1992), 445–459.10.1515/dma.1992.2.4.445Search in Google Scholar

[9] Pavlov A. I., “Arithmetic problems of combinatorial analysis”, Math. Notes, 55:2 (1994), 173–177.10.1007/BF02113298Search in Google Scholar

[10] Pavlov A. I., “On two classes of permutations with number-theoretic conditions on the lengths of the cycles”, Math. Notes, 62:6 (1997), 739–746.10.1007/BF02355462Search in Google Scholar

[11] Postnikov A. G., Introduction to Analytic Number Theory, Amer. Math. Soc., 1988, 320 pp.10.1090/mmono/068Search in Google Scholar

[12] Sachkov V. N., “Mappings of a finite set with limitations on contours and height”, Theory Probab. Appl., 17:4 (1973), 640–656.10.1137/1117077Search in Google Scholar

[13] Sachkov V. N., “Random mappings with bounded height”, Theory Probab. Appl., 18:1 (1973), 120–130.10.1137/1118009Search in Google Scholar

[14] Sachkov V. N., Combinatorial Methods in Discrete Mathematics, Cambridge University Press, 1996, 317 pp.10.1017/CBO9780511666186Search in Google Scholar

[15] Sachkov V. N., Probabilistic Methods in Combinatorial Analysis, Cambridge University Press, 1997, 246 pp.10.1017/CBO9780511666193Search in Google Scholar

[16] Sachkov V. N., Introduction to Combinatorial Methods in Discrete Mathematics, MCNMO, Moscow, 2004.Search in Google Scholar

[17] Seneta E., Regularly Varying Functions, Lecture Notes in Mathematics, 508, Springer-Verlag, 1976, 116 pp.10.1007/BFb0079658Search in Google Scholar

[18] Storm J., Zeindler D., “Total variation distance and the Erdős–Turán lawfor random permutations with polynomially growing cycle weights”, Ann. Inst. H. Poincaré, Probab. Stat., 52:4 (2016), 1614–1640.10.1214/15-AIHP692Search in Google Scholar

[19] Yakymiv A. L., Probabilistic applications of Tauberian theorems, Modern Probability and Statistics, VSP, Leiden, 2005, viii+225 pp.10.1515/9783110195293Search in Google Scholar

[20] Yakymiv A. L., “On the distribution of the mth maximal cycle lengths of random A-permutations”, Discrete Math. Appl., 15:5 (2005), 527–546.10.1515/156939205776368931Search in Google Scholar

[21] Yakymiv A. L., “A limit theorem for the logarithm of the order of a random A-permutation”, Discrete Math. Appl., 20:3 (2010), 247–275.10.1515/dma.2010.015Search in Google Scholar

[22] Yakymiv A. L., “Asymptotics of the moments of the number of cycles of a random A-permutation”, Math. Notes, 88:5–6 (2010), 759–766.10.1134/S0001434610110155Search in Google Scholar

[23] Yakymiv A. L., “On the order of random permutation with cycle weights”, Theory Probab. Appl., 63:2 (2018), 209–226.10.1137/S0040585X97T989015Search in Google Scholar