Zobrazeno 1 - 10
of 333
pro vyhledávání: '"Helmut Prodinger"'
Autor:
Helmut Prodinger
Publikováno v:
Enumerative Combinatorics and Applications, Vol 4, Iss 4, p Article #S2R30 (2024)
Externí odkaz:
https://doaj.org/article/b4c81ddf029f4a9fa85ddd824f35caaa
Autor:
Helmut Prodinger
Publikováno v:
Contributions to Mathematics, Vol 9, Pp 26-32 (2024)
Externí odkaz:
https://doaj.org/article/925885f6bdd04167a89d5971f8f509a2
Autor:
Helmut Prodinger
Publikováno v:
Discrete Mathematics Letters, Vol 12, Pp 78-85 (2023)
Externí odkaz:
https://doaj.org/article/4e43ffdb23a2419cbddf3410d9af4a1d
Autor:
Helmut Prodinger
Publikováno v:
Discrete Mathematics Letters, Vol 10, Pp 9-13 (2022)
Externí odkaz:
https://doaj.org/article/ba4a63bf9f784ebc9475276c6ec4a3b6
Autor:
Jean-Luc Baril, Helmut Prodinger
Publikováno v:
Enumerative Combinatorics and Applications, Vol 3, Iss 1, p #S2R2 (2022)
Externí odkaz:
https://doaj.org/article/4a37fa047baf4d0e8684197ba9f65e6f
Autor:
Helmut Prodinger
Publikováno v:
Enumerative Combinatorics and Applications, Vol 2, Iss 1, p Article S1H1 (2021)
Externí odkaz:
https://doaj.org/article/feb887105de9463284b27b227f6b61b3
Autor:
Helmut Prodinger
Publikováno v:
Enumerative Combinatorics and Applications, Vol 1, Iss 1, p Article S2R4 (2020)
Externí odkaz:
https://doaj.org/article/b2ce172c60744cb192af8023c707d64b
Autor:
Benjamin Hackl, Helmut Prodinger
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 20 no. 1, Iss Analysis of Algorithms (2018)
Stanley lists the class of Dyck paths where all returns to the axis are of odd length as one of the many objects enumerated by (shifted) Catalan numbers. By the standard bijection in this context, these special Dyck paths correspond to a class of roo
Externí odkaz:
https://doaj.org/article/4271381717384183980a024602548e26
Autor:
Helmut Prodinger, Stephan Wagner
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 17 no. 1, Iss Combinatorics (2015)
Combinatorics
Externí odkaz:
https://doaj.org/article/828cd314cb3944999e8e89f4cf2f4719
Autor:
Helmut Prodinger
Publikováno v:
International Journal of Mathematics and Mathematical Sciences, Vol 24, Iss 12, Pp 825-838 (2000)
Up-down permutations are counted by tangent (respectively, secant) numbers. Considering words instead, where the letters are produced by independent geometric distributions, there are several ways of introducing this concept; in the limit they all co
Externí odkaz:
https://doaj.org/article/89893f67fa4248728fa3d9b665ba7078