References

  1. Aigner M. Combinatorial theory. Springer-Verlag, New York, 1979.
  2. Barton D.E., Mallows C.L. Some aspects of the random sequence. Ann. Math. Statist. 1965, 36 (1), 236–260. doi:10.1214/aoms/1177700286
  3. Cartier P., Foata D. Problèmes combinatoires de commutation et réarrangements. In: Dold A., Eckmann B. (Eds.) Lecture Notes in Mathematics, 85. Springer-Verlag, Berlin, 1969.
  4. David F.N., Barton D.E. Combinatorial chance. Charles Griffin & Co. Limited, London, 1962.
  5. Foata D. Etude algébrique de certains problèmes d’analyse combinatoire et du calcul des probabilités. Publ. Inst. Statist. Univ. Paris 1965, 14, 81–241.
  6. Gotsulenko V.V. A formula for the number of combinations with constrained repetitions and its application. Prikl. Diskretn. Mat. 2013, 20 (2), 71–77. (in Russian)
  7. Green C., Kleitman D.J. Proof techniques in the theory of finite sets. In: Rota G.-C. (Ed.) Studies in combinatorics, 17. Math. Assoc. of Amer., Washington, 1978.
  8. Greene D.H., Knuth D.E. Mathematics for the analysis of algorithms. Birkhäuser, Boston, 1990.
  9. Hage J. Enumerating submultisets of multisets. Inf. Proc. Letters 2003, 85 (4), 221–226. doi:10.1016/S0020-0190(02)00394-0
  10. Knuth D.E. The art of computer pragramming. Sorting and searching. Vol. 3. Addison-Wesley, Reading, 1998.
  11. MacMahon P.A. Combinatory analysis. University Press, Cambridge, 1915.
  12. Riordan J. An introduction to combinatorial analysis. John Wiley & Sons, New York, 1958.
  13. Savage C.D., Wilf H.S. Pattern avoidance in compositions and multiset permutations. Adv. Appl. Math. 2006, 36 (2), 194–201. doi:10.1016/j.aam.2005.06.003
  14. Stanley R.P. Enumerative Combinatorics. Vol. 1. Cambridge University Press, Cambridge, 1997.
  15. Stanley R.P. Enumerative Combinatorics. Vol. 2. Cambridge University Press, Cambridge, 1999.
  16. Zatorskii R.A. Counting \(m\)-submultisets through their secondary specifications. In: Rybnikova K.A. (Ed.) Combinatorial Analysis, 7. MSU, Moscow, 1986. (in Russian)
  17. Zatorskii R.A. On the number of combinations on multisets. Bull. Kyiv Nat. Univ. Ser. Phys. Math. Sci. 2000, 3, 42–47. (in Ukrainian)
  18. Zatorskii R.A. On an algorithm for calculation of the number of \(m\)-permutations on multisets. Mat. Stud. 2002, 17 (2), 215–219. (in Ukrainian)
  19. Zatorskii R.A. Some methods and problems of combinatorial analysis. Lik, Ivano-Frankivsk, 2006. (in Ukrainian)