报告人:
Sergey Kitaev 【University of Strathclyde】
报告人单位:
时间:
2019-03-21 16:30-17:30
地点:
卫津路校区6号楼108教
开始时间:
2019-03-21 16:30-17:30
报告人简介:
年:
日月:
报告人简介
University of Strathclyde
报告内容介绍
The notion of a mesh pattern, generalizing several classes of permutation patterns, was introduced in 2011 by Branden and Claesson to provide explicit expansions for certain permutation statistics as, possibly infinite, linear combinations of (classical) permutation patterns. There is a long line of research papers dedicated to the study of mesh patterns and their generalizations.
In this talk, I will discuss a systematic study of avoidance and distribution of mesh patterns of short length, and also some other more general results.