RUS  ENG
Full version
JOURNALS // Sibirskie Èlektronnye Matematicheskie Izvestiya [Siberian Electronic Mathematical Reports] // Archive

Sib. Èlektron. Mat. Izv., 2012 Volume 9, Pages 377–381 (Mi semr362)

This article is cited 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.

UDC: 519.101

MSC: 05A05

Received July 10, 2012, published August 22, 2012

Language: English



© Steklov Math. Inst. of RAS, 2024