Zobrazeno 1 - 10
of 40
pro vyhledávání: '"Mathilde Bouvel"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 26:1, Permutation..., Iss Special issues (2024)
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 siz
Externí odkaz:
https://doaj.org/article/c09d86b2f6804c109f24bfcaf7ad2df1
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings, 28th... (2020)
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 polyominoe
Externí odkaz:
https://doaj.org/article/01bb8ec85e8840c5beba6695b6aa16e2
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AS,..., Iss Proceedings (2013)
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, Boussica
Externí odkaz:
https://doaj.org/article/4e5bc633c4ac49899011cd073b29ad0b
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AS,..., Iss Proceedings (2013)
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
Externí odkaz:
https://doaj.org/article/10fee74cdc8c41ec96322d196b697df2
Autor:
Michael Albert, Mathilde Bouvel
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AS,..., Iss Proceedings (2013)
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 be
Externí odkaz:
https://doaj.org/article/f6d19c7d52ee4c82b1ccfb03db66a5d3
Autor:
Mathilde Bouvel, Olivier Guibert
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AR,..., Iss Proceedings (2012)
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,
Externí odkaz:
https://doaj.org/article/7c7eb77130174d45ace3c658d1bcc4f2
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AR,..., Iss Proceedings (2012)
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 set
Externí odkaz:
https://doaj.org/article/f55a8695f92643b89063831a02fda893
Publikováno v:
The Electronic Journal of Combinatorics
The Electronic Journal of Combinatorics, 2022, 29 (4), https://www.combinatorics.org/ojs/index.php/eljc/article/view/v29i4p32. ⟨10.37236/11390⟩
The Electronic Journal of Combinatorics, 2022, 29 (4), https://www.combinatorics.org/ojs/index.php/eljc/article/view/v29i4p32. ⟨10.37236/11390⟩
International audience; We study preimages of permutations under the bubblesort operator $\mathbf{B}$. We achieve a description of these preimages much more complete than what is known for the more complicated sorting operators $\mathbf{S}$ (stacksor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::11f38fec467d3d67ccbe738cd96d0262
http://arxiv.org/abs/2204.12936
http://arxiv.org/abs/2204.12936
Autor:
Frédérique Bassino, Lucas Gerin, Valentin Féray, Adeline Pierrot, Mathilde Bouvel, Mickaël Maazoun
Publikováno v:
Random Structures and Algorithms
Random Structures and Algorithms, Wiley, In press, ⟨10.1002/rsa.21033⟩
Random Structures and Algorithms, 2022, 60 (2), pp.166-200. ⟨10.1002/rsa.21033⟩
Random Structures and Algorithms, Wiley, In press, ⟨10.1002/rsa.21033⟩
Random Structures and Algorithms, 2022, 60 (2), pp.166-200. ⟨10.1002/rsa.21033⟩
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 graphons. We then show that the degree of a uniform random vertex in a unifor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::59b81b8f873e6fe19ab3113b9afe6aa7
https://www.zora.uzh.ch/id/eprint/205396/
https://www.zora.uzh.ch/id/eprint/205396/
Publikováno v:
European Journal of Combinatorics. :103689
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6bce4c57456b82d760226911121c8b6e
https://doi.org/10.1016/j.ejc.2023.103689
https://doi.org/10.1016/j.ejc.2023.103689