Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Patxi Laborde-Zubieta"'
Autor:
Jean-Christophe Aval, Adrien Boussicault, Bérénice Delcroix-Oger, Florent Hivert, Patxi Laborde-Zubieta
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings, 28th... (2020)
We present a new definition of non-ambiguous trees (NATs) as labelled binary trees. We thus get a differ- ential equation whose solution can be described combinatorially. This yield a new formula for the number of NATs. We also obtain q-versions of o
Externí odkaz:
https://doaj.org/article/0d2c4d92d2b949ba99e8bf62b342493a
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 18 no. 3, Iss Combinatorics (2016)
In this paper, we confirm conjectures of Laborde-Zubieta on the enumeration of corners in tree-like tableaux and in symmetric tree-like tableaux. In the process, we also enumerate corners in (type $B$) permutation tableaux and (symmetric) alternative
Externí odkaz:
https://doaj.org/article/204a58e2952f4df09c639381f16e5009
Publikováno v:
Electronic Notes in Discrete Mathematics. 59:177-188
A periodic parallelogram polyomino is a parallelogram polyomino such that we glue the first and the last column. In this work we extend a bijection between ordered trees and parallelogram polyominoes in order to compute the generating function of per
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bef902f75c8c7fa7f8e7b20516c42dd2
https://doi.org/10.1016/j.endm.2017.05.013
https://doi.org/10.1016/j.endm.2017.05.013
Autor:
Loic Gondry, Ludovic Hofer, Patxi Laborde-Zubieta, Olivier Ly, Lucie Mathé, Grégoire Passault, Antoine Pirrone, Antun Skuric
Publikováno v:
23rd Annual RoboCup International Symposium 2019
23rd Annual RoboCup International Symposium 2019, Jul 2019, Sydney, Australia
RoboCup 2019: Robot World Cup XXIII ISBN: 9783030356989
HAL
23rd Annual RoboCup International Symposium 2019, Jul 2019, Sydney, Australia
RoboCup 2019: Robot World Cup XXIII ISBN: 9783030356989
HAL
International audience; In 2019, Rhoban Football Club reached the first place of the KidSize soccer competition for the fourth time and performed the first in-game throw-in in the history of the Humanoid league. Building on our existing code-base, we
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4b149aed9df657fb038ecc305f468a97
https://hal.archives-ouvertes.fr/hal-02330530/document
https://hal.archives-ouvertes.fr/hal-02330530/document
Autor:
Bérénice Delcroix-Oger, Florent Hivert, Patxi Laborde-Zubieta, Adrien Boussicault, Jean-Christophe Aval
Publikováno v:
FPSAC 2016
FPSAC 2016, 2016, Vancouver, Canada
FPSAC 2016, 2016, Vancouver, Canada
We present a new definition of non-ambiguous trees (NATs) as labelled binary trees. We thus get a differential equation whose solution can be described combinatorially. This yield a new formula for the number of NATs. We also obtain q-versions of our
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e73b829b9959789f6645eb1e66797213
https://doi.org/10.1016/j.ejc.2021.103331
https://doi.org/10.1016/j.ejc.2021.103331
In this paper, we confirm conjectures of Laborde-Zubieta on the enumeration of corners in tree-like tableaux and in symmetric tree-like tableaux. In the process, we also enumerate corners in (type $B$) permutation tableaux and (symmetric) alternative
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d860f8e2875660a661e9a7502381df60
https://doi.org/10.46298/dmtcs.1408
https://doi.org/10.46298/dmtcs.1408
Autor:
Adrien Boussicault, Jean-Christophe Aval, Patxi Laborde-Zubieta, Florent Hivert, Bérénice Delcroix-Oger
Publikováno v:
Discrete Mathematics and Theoretical Computer Science
28-th International Conference on Formal Power Series and Algebraic Combinatorics
28-th International Conference on Formal Power Series and Algebraic Combinatorics, Simon Fraser University, Jul 2016, Vancouver, Canada. ⟨10.46298/dmtcs.6414⟩
28-th International Conference on Formal Power Series and Algebraic Combinatorics, Simon Fraser University, Jul 2016, Vancouver, Canada
28-th International Conference on Formal Power Series and Algebraic Combinatorics
28-th International Conference on Formal Power Series and Algebraic Combinatorics, Simon Fraser University, Jul 2016, Vancouver, Canada. ⟨10.46298/dmtcs.6414⟩
28-th International Conference on Formal Power Series and Algebraic Combinatorics, Simon Fraser University, Jul 2016, Vancouver, Canada
We present a new definition of non-ambiguous trees (NATs) as labelled binary trees. We thus get a differ- ential equation whose solution can be described combinatorially. This yield a new formula for the number of NATs. We also obtain q-versions of o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2b4a5acad73a0c30204997d54a6e4ae9
https://hal.science/hal-02173753
https://hal.science/hal-02173753