HomeIssuesEuler's numbers on sets of permutations and analogues of wilson's theorem

Euler's numbers on sets of permutations and analogues of wilson's theorem | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2014. № 7 (Приложение).

Euler's numbers on sets of permutations are defined. By using them the analogues of Wilson's theorem for the numbers of standard complete mappings and for the numbers of standard strong complete mappings are proved.
Download file
Counter downloads: 208
  • Title Euler's numbers on sets of permutations and analogues of wilson's theorem
  • Headline Euler's numbers on sets of permutations and analogues of wilson's theorem
  • Publesher Tomask State UniversityTomsk State University
  • Issue Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics 7 (Приложение)
  • Date:
  • DOI
Keywords
Wilson's theorem, complete mappings, Euler's numbers, permutation, теорема Вильсона, полные отображения, числа Эйлера, перестановка
Authors
References
http://oeis.org/A003111 - Sloane N.J. A. The on-line encyclopedia of integer sequences.
Айерлэнд К., Роузен М. Классическое введение в современную теорию чисел. М.: Мир, 1987.
Hsiang J., Hsu D. F., and Shieh Y. P. On the hardness of counting problems of complete mappings // Discr. Math. 2004. V. 277. P. 87-100.
Стенли Р. Перечислительная комбинаторика. Т. 1. М.: Мир, 1990.
Euler's numbers on sets of permutations and analogues of wilson's theorem | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2014. № 7 (Приложение).
Euler's numbers on sets of permutations and analogues of wilson's theorem | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2014. № 7 (Приложение).
Download full-text version
Counter downloads: 1917