Euler's numbers on sets of permutations and analogues of wilson's theorem | Applied Discrete Mathematics. Supplement. 2014. № 7.

HomeIssuesEuler's numbers on sets of permutations and analogues of wilson's theorem | Applied Discrete Mathematics. Supplement. 2014. № 7.

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

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: 369

Keywords

перестановка, числа Эйлера, полные отображения, теорема Вильсона, permutation, Euler's numbers, complete mappings, Wilson's theorem

Authors

NameOrganizationE-mail
Bondarenko L.N.leobond5@mail.ru
Sharapova M. L.msharapova@list.ru
Всего: 2

References

Стенли Р. Перечислительная комбинаторика. Т. 1. М.: Мир, 1990.
Айерлэнд К., Роузен М. Классическое введение в современную теорию чисел. М.: Мир, 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.
http://oeis.org/A003111 - Sloane N.J. A. The on-line encyclopedia of integer sequences.
Euler's numbers on sets of permutations and analogues of wilson's theorem | Applied Discrete Mathematics. Supplement. 2014. № 7.

Euler's numbers on sets of permutations and analogues of wilson's theorem | Applied Discrete Mathematics. Supplement. 2014. № 7.