5 citations · 27 across the 15 of their papers we have counts for
15 papers
Rigorous Analytic Combinatorics in Several Variables in SageMath
Benjamin Hackl, Andrew Luo, Stephen Melczer +2
We introduce the new sage_acsv package for the SageMath computer algebra system, allowing users to rigorously compute asymptotics for a large variety of multivariate sequences with…
The Uncover Process for Random Labeled Trees
Benjamin Hackl, Alois Panholzer, Stephan Wagner
We consider the process of uncovering the vertices of a random labeled tree according to their labels. First, a labeled tree with vertices is generated uniformly at random. The…
Down-step statistics in generalized Dyck paths
Andrei Asinowski, Benjamin Hackl, Sarah J. Selkirk
The number of down-steps between pairs of up-steps in -Dyck paths, a generalization of Dyck paths consisting of steps such that the path stays (weakly) a…
Flip-sort and combinatorial aspects of pop-stack sorting
Andrei Asinowski, Cyril Banderier, Benjamin Hackl
Flip-sort is a natural sorting procedure which raises fascinating combinatorial questions. It finds its roots in the seminal work of Knuth on stack-based sorting algorithms and lea…
A hypergeometric proof for a binomial identity related to
Benjamin Hackl, Helmut Prodinger
We show that a binomial identity arising in the context of the study of series expansions of can be seen as an incarnation of Whipples second theorem for hypergeometric serie…
A Combinatorial Identity for Rooted Labeled Forests
Benjamin Hackl
In this brief note a straightforward combinatorial proof for an identity directly connecting rooted forests and unordered set partitions is provided. Furthermore, references that p…