Biblio Discovery — Demo Discovery Service

8 hasil untuk "Mathilde Bouvel"

Menampilkan 1–8 · 0,64 detik · RSS

  1. Artikel Jurnal

    Enumeration of permutations sorted with two passes through a stack and D_8 symmetries

    Mathilde Bouvel; Olivier Guibert

    Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AR… · 2012 · Inggris · DOAJ Scopus

    We examine the sets of permutations that are sorted by two passes through a stack with a $D_8$ operation performed in between. From a characterization of these in terms of generalized excluded patterns, we prove two conjectures on their enumeration, that can be refined with the distribution of some…

  2. Artikel Jurnal

    Operators of equivalent sorting power and related Wilf-equivalences

    Michael Albert; Mathilde Bouvel

    Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AS… · 2013 · Inggris · DOAJ Scopus

    We study sorting operators $\textrm{A}$ on permutations that are obtained composing Knuth's stack sorting operator \textrmS and the reverse operator $\textrm{R}$, as many times as desired. For any such operator $\textrm{A}$, we provide a bijection between the set of permutations sorted by…

  3. Artikel Jurnal

    Slicings of parallelogram polyominoes, or how Baxter and Schröder can be reconciled

    Mathilde Bouvel; Veronica Guerrini; Simone Rinaldi

    Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings, 28th... (2020) · 2020 · Inggris · DOAJ Scopus

    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 define Schröder and Baxter generalizations of parallelogram polyominoes (called slicings) which grow according to these…

  4. Artikel Jurnal

    Key-avoidance for alternating sign matrices

    Mathilde Bouvel; Rebecca Smith; Jessica Striker

    Discrete Mathematics & Theoretical Computer Science, Vol vol. 27:1, Permutation..., Iss… · 2025 · Inggris · DOAJ Scopus

    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 enumerate alternating sign matrices whose key avoids a given set of permutation patterns in several instances. We show…

  5. Artikel Jurnal

    Some simple varieties of trees arising in permutation analysis

    Mathilde Bouvel; Marni Mishna; Cyril Nicaud

    Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AS… · 2013 · Inggris · DOAJ Scopus

    After extending classical results on simple varieties of trees to trees counted by their number of leaves, we describe a filtration of the set of permutations based on their strong interval trees. For each subclass we provide asymptotic formulas for number of trees (by leaves), average number of…

  6. Artikel Jurnal

    A logical limit law for $231$-avoiding permutations

    Michael Albert; Mathilde Bouvel; Valentin Féray dkk.

    Discrete Mathematics & Theoretical Computer Science, Vol vol. 26:1, Permutation..., Iss… · 2024 · Inggris · DOAJ Scopus

    We prove that the class of 231-avoiding permutations satisfies a logical limit law, i.e. that for any first-order sentence $\Psi$, in the language of two total orders, the probability $p_{n,\Psi}$ that a uniform random 231-avoiding permutation of size $n$ satisfies $\Psi$ admits a limit as $n$ is…

  7. Artikel Jurnal

    Combinatorics of non-ambiguous trees

    Jean-Christophe Aval; Adrien Boussicault; Mathilde Bouvel dkk.

    Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AS… · 2013 · Inggris · DOAJ Scopus

    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 subset of the tree-like tableaux previously defined by Aval, Boussicault and Nadeau. The enumeration of non-ambiguous…

  8. Artikel Jurnal

    Combinatorial specification of permutation classes

    Frédérique Bassino; Mathilde Bouvel; Adeline Pierrot dkk.

    Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AR… · 2012 · Inggris · DOAJ Scopus

    This article presents a methodology that automatically derives a combinatorial specification for the permutation class $\mathcal{C} = Av(B)$, given its basis $B$ of excluded patterns and the set of simple permutations in $\mathcal{C}$, when these sets are both finite. This is achieved considering…