Irreducible and connected permutations Martin Klazar∗ Abstract A permutation π of [n] = {1, 2, . . . , n} is irreducible if π([m]) = [m] for no m ∈ [n], m < n, and it is connected if for no interval I ⊂ [n],

First Page		Document Content
Date: 2003-03-05 09:54:11		Irreducible and connected permutations Martin Klazar∗ Abstract A permutation π of [n] = {1, 2, . . . , n} is irreducible if π([m]) = [m] for no m ∈ [n], m < n, and it is connected if for no interval I ⊂ [n], Add to Reading List Source URL: kam.mff.cuni.cz Download Document from Source Website File Size: 243,36 KB Share Document on Facebook