Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Dominique Poulalhon"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings, 28th... (2020)
Corner polyhedra were introduced by Eppstein and Mumford (2014) as the set of simply connected 3D polyhedra such that all vertices have non negative integer coordinates, edges are parallel to the coordinate axes and all vertices but one can be seen f
Externí odkaz:
https://doaj.org/article/3f4be4d432e047dab3d118eab95998bf
Autor:
Enrica Duchi, Dominique Poulalhon
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AI,..., Iss Proceedings (2008)
Severini and Mansour introduced $\textit{square polygons}$, as graphical representations of $\textit{square permutations}$, that is, permutations such that all entries are records (left or right, minimum or maximum), and they obtained a nice formula
Externí odkaz:
https://doaj.org/article/a18ff29e05b246eeb34902d9903204a0
Publikováno v:
European Journal of Combinatorics. 30(7):1646-1658
A bijection $\Phi$ is presented between plane bipolar orientations with prescribed numbers of vertices and faces, and non-intersecting triples of upright lattice paths with prescribed extremities. This yields a combinatorial proof of the following fo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8bd85d9c0a4b43facaadb70087f7c960
Autor:
Patrice Ossona de Mendez, Michel Pocchiola, Dominique Poulalhon, Jorge Luis Ramírez Alfonsín, Gilles Schaeffer
Publikováno v:
Electronic Notes in Discrete Mathematics. 31:1-4
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aa63cf995632369a07afaa5f82d0227d
https://doi.org/10.1016/j.endm.2008.06.001
https://doi.org/10.1016/j.endm.2008.06.001
Publikováno v:
ACM Transactions on Algorithms. 4:1-48
We present a bijection between some quadrangular dissections of an hexagon and unrooted binary trees with interesting consequences for enumeration, mesh compression, and graph sampling. Our bijection yields an efficient uniform random sampler for 3-c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0795f3c4a6b6f43756a23cb6606747a0
https://doi.org/10.1145/1361192.1361196
https://doi.org/10.1145/1361192.1361196
Autor:
Gilles Schaeffer, Dominique Poulalhon
Publikováno v:
Algorithmica
Algorithmica, Springer Verlag, 2006, 46 (3-4), pp.505-527
Automata, Languages and Programming ISBN: 9783540404934
ICALP
Algorithmica, Springer Verlag, 2006, 46 (3-4), pp.505-527
Automata, Languages and Programming ISBN: 9783540404934
ICALP
International audience; We present a bijection between the set of plane triangulations (\emph{aka} maximal planar graphs) and a simple subset of the set of plane trees with two leaves adjacent to each node. The construction takes advantage of Schnyde
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cbf39405f5bd372d9396476365f5942d
https://doi.org/10.1007/s00453-006-0114-8
https://doi.org/10.1007/s00453-006-0114-8
Publikováno v:
Journal of Algebraic Combinatorics. 21:137-146
We define a family of differential operators indexed with fixed point free partitions. When these differential operators act on normalized power sum symmetric functions q?(x), the coefficients in the decomposition of this action in the basis q?(x) ar
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7fae4343ff25bae499aad56d3ed6a2fa
https://doi.org/10.1007/s10801-005-6904-2
https://doi.org/10.1007/s10801-005-6904-2
Autor:
Dominique Poulalhon, Gilles Schaeffer
Publikováno v:
Discrete Mathematics. 254(1-3):433-458
The factorizations of an n -cycle of the symmetric group S n into m permutations with prescribed cycle types α 1 ,…, α m describe topological equivalence classes of one pole meromorphic functions on Riemann surfaces. This is one of the motivation
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::72b79368b51b492876ca32665a524156
Publikováno v:
European Journal of Combinatorics
European Journal of Combinatorics, Elsevier, 2014, 35, pp. 13-31. ⟨10.1016/j.ejc.2013.06.031⟩
European Journal of Combinatorics, 2014, 35, pp. 13-31. ⟨10.1016/j.ejc.2013.06.031⟩
European Journal of Combinatorics, Elsevier, 2014, 35, pp. 13-31. ⟨10.1016/j.ejc.2013.06.031⟩
European Journal of Combinatorics, 2014, 35, pp. 13-31. ⟨10.1016/j.ejc.2013.06.031⟩
This article presents new enumerative results related to symmetric planar maps. In the first part a new way of enumerating rooted simple quadrangulations and rooted simple triangulations is presented, based on the description of two different quotien
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::59de4869f898ada68791fe23a1ff2f5f
https://hal.archives-ouvertes.fr/hal-00732814
https://hal.archives-ouvertes.fr/hal-00732814
Publikováno v:
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4a3b1b25b047d3232766bfe7455f8449
https://doi.org/10.1137/1.9781611973402.21
https://doi.org/10.1137/1.9781611973402.21