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], - N-connected - Document - PDFSEARCH.IO

First Page	Meta Content
	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 Document Date: 2003-03-05 09:54:11 Open Document File Size: 243,36 KB Share Result on Facebook

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