32 citations · 135 across the 28 of their papers we have counts for
30 papers · 1 filter
Key-avoidance for alternating sign matrices
Mathilde Bouvel, Rebecca Smith, Jessica Striker
We initiate a systematic study of key-avoidance on alternating sign matrices (ASMs) defined via pattern-avoidance on an associated permutation called the \emph{key} of an ASM. We e…
Between weak and Bruhat: the middle order on permutations
Mathilde Bouvel, Luca Ferrari, Bridget Eileen Tenner
We define a partial order on permutations of any given size , which is the image of a natural partial order on inversion sequences. We call this the ``middle ord…
A logical limit law for -avoiding permutations
Michael Albert, Mathilde Bouvel, Valentin Féray +1
We prove that the class of 231-avoiding permutations satisfies a logical limit law, i.e. that for any first-order sentence , in the language of two total orders, the probability…
Preimages under the bubblesort operator
Mathilde Bouvel, Lapo Cioni, Luca Ferrari
We study preimages of permutations under the bubblesort operator . We achieve a description of these preimages much more complete than what is known for the more compli…
The interval posets of permutations seen from the decomposition tree perspective
Mathilde Bouvel, Lapo Cioni, Benjamin Izart
The interval poset of a permutation is the set of intervals of a permutation, ordered with respect to inclusion. It has been introduced and studied recently in [B. Tenner, arXiv:20…
Baxter Tree-like Tableaux
Jean-Christophe Aval, Adrien Boussicault, Mathilde Bouvel +2
Tree-like tableaux are objects in bijection with alternative or permutation tableaux. They have been the subject of a fruitful combinatorial study for the past few years. In the pr…
Linear-sized independent sets in random cographs and increasing subsequences in separable permutations
Frédérique Bassino, Mathilde Bouvel, Michael Drmota +4
This paper is interested in independent sets (or equivalently, cliques) in uniform random cographs. We also study their permutation analogs, namely, increasing subsequences in unif…
Counting Phylogenetic Networks of level 1 and 2
Mathilde Bouvel, Philippe Gambette, Marefatollah Mansouri
Phylogenetic networks generalize phylogenetic trees, and have been introduced in order to describe evolution in the case of transfer of genetic material between coexisting species.…
Random cographs: Brownian graphon limit and asymptotic degree distribution
Frédérique Bassino, Mathilde Bouvel, Valentin Féray +3
We consider uniform random cographs (either labeled or unlabeled) of large size. Our first main result is the convergence towards a Brownian limiting object in the space of graphon…
Two first-order logics of permutations
Michael Albert, Mathilde Bouvel, Valentin Féray
We consider two orthogonal points of view on finite permutations, seen as pairs of linear orders (corresponding to the usual one line representation of permutations as words) or se…
Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers
Nicholas R. Beaton, Mathilde Bouvel, Veronica Guerrini +1
The first problem addressed by this article is the enumeration of some families of pattern-avoiding inversion sequences. We solve some enumerative conjectures left open by the foun…
Semi-Baxter and strong-Baxter: two relatives of the Baxter sequence
Mathilde Bouvel, Veronica Guerrini, Andrew Rechnitzer +1
In this paper, we enumerate two families of pattern-avoiding permutations: those avoiding the vincular pattern , which we call semi-Baxter permutations, and those avoiding…
Some families of trees arising in permutation analysis
Mathilde Bouvel, Marni Mishna, Cyril Nicaud
We extend classical results on simple varieties of trees (asymptotic enumeration, average behavior of tree parameters) to trees counted by their number of leaves. Motivated by geno…
Slicings of parallelogram polyominoes: Catalan, Schröder, Baxter, and other sequences
Nicholas R. Beaton, Mathilde Bouvel, Veronica Guerrini +1
We provide a new succession rule (i.e. generating tree) associated with Schröder numbers, that interpolates between the known succession rules for Catalan and Baxter numbers. We de…
An algorithm computing combinatorial specifications of permutation classes
Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot +2
This article presents a methodology that automatically derives a combinatorial specification for a permutation class C, given its basis B of excluded patterns and the set of simple…
A general theory of Wilf-equivalence for Catalan structures
Michael Albert, Mathilde Bouvel
The existence of apparently coincidental equalities (also called Wilf-equivalences) between the enumeration sequences, or generating functions, of various hereditary classes of com…
Operators of equivalent sorting power and related Wilf-equivalences
Michael Albert, Mathilde Bouvel
We study sorting operators on permutations that are obtained composing Knuth's stack sorting operator and the reversal operator , as many time…
Permutation classes and polyomino classes with excluded submatrices
Daniela Battaglino, Mathilde Bouvel, Andrea Frosini +1
This article introduces an analogue of permutation classes in the context of polyominoes. For both permutation classes and polyomino classes, we present an original way of characte…
An algorithm for deciding the finiteness of the number of simple permutations in permutation classes
Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot +1
In this article, we describe an algorithm to determine whether a permutation class C given by a finite basis B of excluded patterns contains a finite number of simple permutations.…
Combinatorics of non-ambiguous trees
Jean-Christophe Aval, Adrien Boussicault, Mathilde Bouvel +1
This article investigates combinatorial properties of non-ambiguous trees. These objects we define may be seen either as binary trees drawn on a grid with some constraints, or as a…
Refined enumeration of permutations sorted with two stacks and a D_8-symmetry
Mathilde Bouvel, Olivier Guibert
We study permutations that are sorted by operators of the form , where is the usual stack sorting operator introduced by D. Knuth a…
Combinatorial specification of permutation classes
Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot +2
This article presents a methodology that automatically derives a combinatorial specification for the permutation class C = Av(B), given its basis B of excluded patterns and the set…
Geometric grid classes of permutations
Michael H. Albert, M. D. Atkinson, Mathilde Bouvel +2
A geometric grid class consists of those permutations that can be drawn on a specified set of line segments of slope \pm1 arranged in a rectangular pattern governed by a matrix. Us…
On the enumeration of d-minimal permutations
Mathilde Bouvel, Luca Ferrari
We suggest an approach for the enumeration of minimal permutations having d descents which uses skew Young tableaux. We succeed in finding a general expression for the number of su…