5 citations · 27 across the 15 of their papers we have counts for
11 papers · 1 filter
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…
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 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…
Reducing Simply Generated Trees by Iterative Leaf Cutting
Benjamin Hackl, Clemens Heuberger, Stephan Wagner
We consider a procedure to reduce simply generated trees by iteratively removing all leaves. In the context of this reduction, we study the number of vertices that are deleted afte…
Ascents in Non-Negative Lattice Paths
Benjamin Hackl, Clemens Heuberger, Helmut Prodinger
Non-negative Łukasiewicz paths are special two-dimensional lattice paths never passing below their starting altitude which have only one single special type of down step. They are…