|
Sibirskie Èlektronnye Matematicheskie Izvestiya [Siberian Electronic Mathematical Reports], 2012, Volume 9, Pages 377–381
(Mi semr362)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Discrete mathematics and mathematical cybernetics
Fine and Wilf’s theorem for permutations
A. È. Frid Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk
Abstract:
We try to extend to permutations the famous Fine and Wilf’s theorem valid for words and see that it is possible to do it only partially: the theorem is valid for coprime periods, but if the periods are not coprime, there is another statement valid instead.
Keywords:
Fine and Wilf’s theorem, periodicity, permutations, infinite permutations.
Received July 10, 2012, published August 22, 2012
Citation:
A. È. Frid, “Fine and Wilf’s theorem for permutations”, Sib. Èlektron. Mat. Izv., 9 (2012), 377–381
Linking options:
https://www.mathnet.ru/eng/semr362 https://www.mathnet.ru/eng/semr/v9/p377
|
Statistics & downloads: |
Abstract page: | 203 | Full-text PDF : | 71 | References: | 53 |
|