6 papers
Large deviation principles for pattern-avoiding permutations, and limit shapes for constrained Mallows permutations
Thomas Budzinski, Victor Dubach, Valentin Féray +2
We study Mallows random permutations conditioned to avoid a given pattern of length~. When the bias parameter is of the form , we prove that these permutations co…
Large chirotopes with computable numbers of triangulations
Mathilde Bouvel, Valentin Féray, Xavier Goaoc +1
Chirotopes are a common combinatorial abstraction of (planar) point sets. In this paper we investigate decomposition methods for chirotopes, and their application to the problem of…
Tree-indexed sums of Catalan numbers
Alin Bostan, Valentin Féray, Paul Thévenin
We consider a family of infinite sums of products of Catalan numbers, indexed by trees. We show that these sums are polynomials in with rational coefficients; the proof is e…
Binary search trees of permuton samples
Benoît Corsini, Victor Dubach, Valentin Féray
Binary search trees (BST) are a popular type of data structure when dealing with ordered data. Indeed, they enable one to access and modify data efficiently, with their height corr…
The mystery of plethysm coefficients
Laura Colmenarejo, Rosa Orellana, Franco Saliola +2
Composing two representations of the general linear groups gives rise to Littlewood's (outer) plethysm. On the level of characters, this poses the question of finding the Schur exp…
A canonical tree decomposition for order types, and some applications
Mathilde Bouvel, Valentin Féray, Xavier Goaoc +1
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 c…