119 citations · 207 across the 21 of their papers we have counts for
10 papers · 1 filter
Combinatorics and Asymptotics of Positive Systems of Linear Catalytic Equations
Cyril Banderier, Michael Drmota
We provide a complete combinatorial and asymptotic analysis of positive linear systems of equations in one catalytic variable that appear in several combinatorial problems such as…
Composition schemes: q-enumerations and phase transitions
Cyril Banderier, Markus Kuba, Stephan Wagner +1
Composition schemes are ubiquitous in combinatorics, statistical mechanics and probability theory. We give a unifying explanation to various phenomena observed in the combinatorial…
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…
Local time for lattice paths and the associated limit laws
Cyril Banderier, Michael Wallner
For generalized Dyck paths (i.e., directed lattice paths with any finite set of jumps), we analyse their local time at zero (i.e., the number of times the path is touching or cross…
Lattice paths with catastrophes
Cyril Banderier, Michael Wallner
In queuing theory, it is usual to have some models with a "reset" of the queue. In terms of lattice paths, it is like having the possibility of jumping from any altitude to zero. T…
Explicit formulas for enumeration of lattice paths: basketball and the kernel method
Cyril Banderier, Christian Krattenthaler, Alan Krinik +4
This article deals with the enumeration of directed lattice walks on the integers with any finite set of steps, starting at a given altitude and ending at a given altitude ,…
Enumeration and asymptotics of restricted compositions having the same number of parts
Cyril Banderier, Pawel Hitczenko
We study pairs and m--tuples of compositions of a positive integer n with parts restricted to a subset P of positive integers. We obtain some exact enumeration results for the numb…
Generating functions for generating trees
Cyril Banderier, Philippe Flajolet, Daniele Gardy +3
Certain families of combinatorial objects admit recursive descriptions in terms of generating trees: each node of the tree corresponds to an object, and the branch leading to the n…
Generating Functions For Kernels of Digraphs (Enumeration & Asymptotics for Nim Games)
Cyril Banderier, Jean-Marie Le Bars, Vlady Ravelomanana
In this article, we study directed graphs (digraphs) with a coloring constraint due to Von Neumann and related to Nim-type games. This is equivalent to the notion of kernels of dig…
Why Delannoy numbers?
Cyril Banderier, Sylviane Schwer
This article is not a research paper, but a little note on the history of combinatorics: We present here a tentative short biography of Henri Delannoy, and a survey of his most not…