SIF Permutations and Chord-Connected Permutations

SIF Permutations and Chord-Connected Permutations

A <i>stabilized-interval-free </i> (SIF) permutation on [n], introduced by Callan, is a permutation that does not stabilize any proper interval of [n]. Such permutations are known to be the irreducibles in the decomposition of permutations along non-crossing partitions. That is, if $s_n$...

Full description

Bibliographic Details
Main Author: Natasha Blitvić
Format: Article
Language:English
Published: Discrete Mathematics & Theoretical Computer Science 2014-01-01
Series:Discrete Mathematics & Theoretical Computer Science
Subjects:
stabilized-interval-free permutations
chord-connected permutations
non-crossing partitions
complex gaussian
[info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
[math.math-co] mathematics [math]/combinatorics [math.co]
Online Access:https://dmtcs.episciences.org/2443/pdf

Internet

https://dmtcs.episciences.org/2443/pdf

Similar Items