On the sub-permutations of pattern avoiding permutations

@article{Disanto2014OnTS,
  title={On the sub-permutations of pattern avoiding permutations},
  author={Filippo Disanto and Thomas Wiehe},
  journal={Discret. Math.},
  year={2014},
  volume={337},
  pages={127-141}
}
  • Filippo Disanto, Thomas Wiehe
  • Published 2014
  • Computer Science, Mathematics
  • Discret. Math.
  • There is a deep connection between permutations and trees. Certain sub-structures of permutations, called sub-permutations, bijectively map to sub-trees of binary increasing trees. This opens a powerful tool set to study enumerative and probabilistic properties of sub-permutations and to investigate the relationships between 'local' and 'global' features using the concept of pattern avoidance.First, given a pattern µ , we study how the avoidance of µ in a permutation π affects the presence of… CONTINUE READING

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 31 REFERENCES

    Permutation Trees and Variation Statistics

    VIEW 2 EXCERPTS

    Pattern Matching for Permutations

    VIEW 3 EXCERPTS

    Non-Contiguous Pattern Avoidance in Binary Trees

    VIEW 1 EXCERPT

    Pattern avoidance in binary trees

    VIEW 1 EXCERPT

    Generating trees and the Catalan and Schröder numbers

    • Julian West
    • Computer Science, Mathematics
    • Discret. Math.
    • 1995
    VIEW 1 EXCERPT

    Excluded permutation matrices and the Stanley-Wilf conjecture

    VIEW 2 EXCERPTS

    Restricted Permutations

    VIEW 1 EXCERPT