We study Mallows random permutations conditioned to avoid a given pattern α of length 3, for which we find limit shapes in the space of permutons when the bias parameter is of the form e^(β/n). Along the way, we provide parametrizations for α-avoiding permutons, and establish large deviation principles for uniform α-avoiding permutations.

Abstract. We introduce and study a notion of decomposition of planar point sets (or rather of their chirotopes) as trees decorated by smaller chirotopes. This decomposition is based on the concept of mutually avoiding sets (which we rephrase as modules) and adapts in some sense the modular decomposition of graphs in the world of chirotopes. The associated tree always exists and is unique up to some appropriate constraints. We also show how to compute the number of triangulations of a chirotope efficiently, starting from its tree and the (weighted) numbers of triangulations of its parts.

International audience

Following the lead of Stanley and Gessel, we consider a linear map which associates to an acyclic directed graph (or a poset) a quasi-symmetric function. The latter is naturally defined as a multivariate generating series of nondecreasing functions on the graph. We describe the kernel of this linear map by using a simple combinatorial operation that we call cyclic inclusion-exclusion. Our result also holds for the natural noncommutative analogue and for the commutative and noncommutative restrictions to bipartite graphs. An application to the theory of Kerov character polynomials is given.