Zobrazeno 1 - 10
of 17
pro vyhledávání: '"Adeline Pierrot"'
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:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AO,..., Iss Proceedings (2011)
We continue a study of the equivalence class induced on $S_n$ when one is permitted to replace a consecutive set of elements in a permutation with the same elements in a different order. For each possible set of allowed replacements, we characterise
Externí odkaz:
https://doaj.org/article/4c4a6dead29b448987197edf88daeb52
Autor:
Adeline, Pierrot, Dominique, Rossin
This article studies the poset of simple permutations with respect to the pattern involvement. We specify results on critically indecomposable posets obtained by Schmerl and Trotter to simple permutations and prove that if $\sigma, \pi$ are two simpl
Externí odkaz:
http://arxiv.org/abs/1201.3119
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/
Autor:
Alain Denise, Laurent Bulteau, Bryan Brancotte, Pierre Andrieu, Adeline Pierrot, Stéphane Vialette, Sarah Cohen-Boulakia
Publikováno v:
Future Generation Computer Systems
Future Generation Computer Systems, 2021, 124, pp.406-421. ⟨10.1016/j.future.2021.06.013⟩
Future Generation Computer Systems, Elsevier, 2021, 124, pp.406-421. ⟨10.1016/j.future.2021.06.013⟩
Future Generation Computer Systems, 2021, 124, pp.406-421. ⟨10.1016/j.future.2021.06.013⟩
Future Generation Computer Systems, Elsevier, 2021, 124, pp.406-421. ⟨10.1016/j.future.2021.06.013⟩
International audience; Massive biological datasets are available in various sources. To answer a biological question (e.g., ''which are the genes involved in a given disease?''), life scientists query and mine such datasets using various techniques.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::14f8ab4123bfded52a7169925afab50d
https://hal.science/hal-03388443/document
https://hal.science/hal-03388443/document
Autor:
Frédérique Bassino, Mathilde Bouvel, Valentin Féray, Lucas Gerin, Mickaël Maazoun, Adeline Pierrot
Publikováno v:
Journal of the European Mathematical Society
Journal of the European Mathematical Society, 2020, 22 (11), pp.3565-3639. ⟨10.4171/JEMS/993⟩
Journal of the European Mathematical Society, European Mathematical Society, 2020, 22 (11), pp.3565-3639. ⟨10.4171/JEMS/993⟩
Journal of the European Mathematical Society, 2020, 22 (11), pp.3565-3639. ⟨10.4171/JEMS/993⟩
Journal of the European Mathematical Society, European Mathematical Society, 2020, 22 (11), pp.3565-3639. ⟨10.4171/JEMS/993⟩
We consider uniform random permutations in proper substitution-closed classes and study their limiting behavior in the sense of permutons. The limit depends on the generating series of the simple permutations in the class. Under a mild sufficient con
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::aace7ba013e8ede9804dfee3d36f79b3
https://hal.science/hal-01653572
https://hal.science/hal-01653572
Autor:
Frédérique Bassino, Mathilde Bouvel, Valentin Féray, Lucas Gerin, Mickaël Maazoun, Adeline Pierrot
Publikováno v:
Advances in Mathematics
Advances in Mathematics, 2022, 405, pp.108513. ⟨10.1016/j.aim.2022.108513⟩
Advances in Mathematics, 2022, 405, pp.108513. ⟨10.1016/j.aim.2022.108513⟩
We consider uniform random permutations in classes having a finite combinatorial specification for the substitution decomposition. These classes include (but are not limited to) all permutation classes with a finite number of simple permutations. Our
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b9129320c5f267dc1d4500c9c6ca5015
Publikováno v:
Annals of Probability
Annals of Probability, 2018, 46 (4), pp.2134-2189
Ann. Probab. 46, no. 4 (2018), 2134-2189
Annals of Probability, Institute of Mathematical Statistics, 2018, 46 (4), pp.2134-2189. ⟨10.1214/17-AOP1223⟩
Annals of Probability, 2018, 46 (4), pp.2134-2189
Ann. Probab. 46, no. 4 (2018), 2134-2189
Annals of Probability, Institute of Mathematical Statistics, 2018, 46 (4), pp.2134-2189. ⟨10.1214/17-AOP1223⟩
We study random uniform permutations in an important class of pattern-avoiding permutations: the separable permutations. We describe the asymptotics of the number of occurrences of any fixed given pattern in such a random permutation in terms of the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bbbc6bde223fa5a3506a35689a6e52f0
https://hal.archives-ouvertes.fr/hal-01275310
https://hal.archives-ouvertes.fr/hal-01275310
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319946665
IWOCA
IWOCA
The median of permutations problem consists in finding a consensus permutation of a given set of m permutations of size n. This consensus represent the “closest” permutation to the given set under the Kendall-tau distance. Since the complexity of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::34e39e9ada7a1ef5499b5c487fe7f315
https://doi.org/10.1007/978-3-319-94667-2_19
https://doi.org/10.1007/978-3-319-94667-2_19
Publikováno v:
Discrete Applied Mathematics
Discrete Applied Mathematics, Elsevier, 2017, 224, pp.16-44. ⟨10.1016/j.dam.2017.02.013⟩
Discrete Applied Mathematics, Elsevier, 2017, 224, pp.16-44. ⟨10.1016/j.dam.2017.02.013⟩
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 permutations in C, when these sets are both finite. This is achieved
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5e7e577b51584fa4133e0a26a27cccb7
http://arxiv.org/abs/1506.00868
http://arxiv.org/abs/1506.00868