University of Cambridge > > Algebra and Representation Theory Seminar > Consecutive patterns in words, permutations and in trees

Consecutive patterns in words, permutations and in trees

Add to your list(s) Download to your calendar using vCal

  • UserVladimir Dotsenko (Trinity, Dublin)
  • ClockWednesday 23 February 2011, 16:30-17:30
  • HouseMR15.

If you have a question about this talk, please contact Christopher Brookes.

This talk is about algebraic approaches to several topics in the combinatorics of pattern avoidance, from the classical question of avoiding a fixed set of word patterns to questions of pattern avoidance in trees, a new concept that was motivated by study of algebraic operads. The model example I shall discuss in most detail is halfway between those two, that is consecutive pattern avoidance for permutations. Namely, I shall explain how can use homology of ``shuffle algebras’’ to obtain results in enumerative combinatorics. The talk is partly based on a joint work with A.Khoroshkin (ETH Zurich).

This talk is part of the Algebra and Representation Theory Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2023, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity