MathDB
Problems
Contests
International Contests
Tournament Of Towns
1992 Tournament Of Towns
(355) 4
(355) 4
Part of
1992 Tournament Of Towns
Problems
(1)
TOT 355 1992 Autumn A S4 permutations of mn elemens in mxn table
Source:
6/10/2024
A table has
m
m
m
rows and
n
n
n
columns. The following permutations of its
m
n
mn
mn
elements are permitted: an arbitrary permutation leaving each element in the same row (a“horizontal move”) and an arbitrary permutation leaving each element in the same column (a “vertical move”). Find the number
k
k
k
such that any permutation of
m
n
mn
mn
elements can be obtained by
k
k
k
permitted moves but there exists a permutation that cannot be achieved in less than
k
k
k
moves.(A Andjans, Riga0
combinatorics