activity
20232026
most citedBinary search trees of permuton samples

1 citations · 2 across the 5 of their papers we have counts for

collaborators

7 papers

math.PR2026

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 conv…

cs.CG2026

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…

math.CO2025

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 ef…

cs.CG2024

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…

math.PR2024★ 1 cited

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…

math.PR2024

Dense and nondense limits for uniform random intersection graphs

Frédérique Bassino, Mathilde Bouvel, Valentin Féray +2

We obtain the scaling limits of random graphs drawn uniformly in three families of intersection graphs: permutation graphs, circle graphs, and unit interval graphs. The two first f…

math.CO2023★ 1 cited

Asymptotic normality of pattern counts in conjugacy classes

Valentin Féray, Mohamed Slim Kammoun

We prove, under mild conditions on fixed points and two cycles, the asymptotic normality of vincular pattern counts for a permutation chosen uniformly at random in a conjugacy clas…