Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Adrien Boussicault"'
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 DMTCS Proceedings, 27th..., Iss Proceedings (2015)
We present a new method to obtain the generating functions for directed convex polyominoes according to several different statistics including: width, height, size of last column/row and number of corners. This method can be used to study different f
Externí odkaz:
https://doaj.org/article/fad9ede3322348508c4fabc69757974a
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. AO,..., Iss Proceedings (2011)
In this work we introduce and study tree-like tableaux, which are certain fillings of Ferrers diagrams in simple bijection with permutation tableaux and alternative tableaux. We exhibit an elementary insertion procedure on our tableaux which gives a
Externí odkaz:
https://doaj.org/article/3509de7eac3043f6adc1e259a8cceb6a
Autor:
Adrien Boussicault, Valentin Féray
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AK,..., Iss Proceedings (2009)
To a word $w$, we associate the rational function $\Psi_w = \prod (x_{w_i} - x_{w_{i+1}})^{-1}$. The main object, introduced by C. Greene to generalize identities linked to Murnaghan-Nakayama rule, is a sum of its images by certain permutations of th
Externí odkaz:
https://doaj.org/article/2dec14efb79c4fcabf5206ff62cb8679
Autor:
Adrien Boussicault, Jean-Gabriel Luque
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AJ,..., Iss Proceedings (2008)
We prove that a $q$-deformation $\mathfrak{D}_k(\mathbb{X};q)$ of the powers of the discriminant is equal, up to a normalization, to a specialization of a Macdonald polynomial indexed by a staircase partition. We investigate the expansion of $\mathfr
Externí odkaz:
https://doaj.org/article/66eeac2538fe40e6bca169301ddca73f
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
Autor:
Adrien Boussicault, Veronica Guerrini
Publikováno v:
Electronic Notes in Discrete Mathematics. 59:147-164
This paper introduces a further combinatorial interpretation in terms of permutations of the well-known Catalan number sequence. The permutations we treat have been called cap permutations because of their look, and their family does not coincide wit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4b8eabb5219dc6200d43ad789af0cfa3
https://doi.org/10.1016/j.endm.2017.05.011
https://doi.org/10.1016/j.endm.2017.05.011
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
Publikováno v:
Discrete Mathematics. 343:111731
We present a new general approach for the enumeration of directed convex polyominoes, which lets us easily control several statistics. This method relies on a bijection between directed convex polyominoes with semi-perimeter equal to n + 2 and triple
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9138480d7aeff55a0835920811775f33
https://doi.org/10.1016/j.disc.2019.111731
https://doi.org/10.1016/j.disc.2019.111731