119 citations · 207 across the 21 of their papers we have counts for
22 papers
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…
From geometry to generating functions: rectangulations and permutations
Andrei Asinowski, Cyril Banderier
We enumerate several classes of pattern-avoiding rectangulations. We establish new bijective links with pattern-avoiding permutations, prove that their generating functions are alg…
Height of walks with resets, the Moran model, and the discrete Gumbel distribution
Rafik Aguech, Asma Althagafi, Cyril Banderier
In this article, we consider several models of random walks in one or several dimensions, additionally allowing, at any unit of time, a reset (or "catastrophe") of the walk with pr…
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…
Phase transitions of composition schemes: Mittag-Leffler and mixed Poisson distributions
Cyril Banderier, Markus Kuba, Michael Wallner
Multitudinous probabilistic and combinatorial objects are associated with generating functions satisfying a composition scheme . The analysis becomes challenging when…
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…
Periodic Pólya Urns, the Density Method, and Asymptotics of Young Tableaux
Cyril Banderier, Philippe Marchal, Michael Wallner
Pólya urns are urns where at each unit of time a ball is drawn and replaced with some other balls according to its colour. We introduce a more general model: the replacement rule d…
On the period mod of polynomially-recursive sequences: a case study
Cyril Banderier, Florian Luca
Polynomially-recursive sequences generally have a periodic behavior mod . In this paper, we analyze the period mod of a second order polynomially-recursive sequence. The pro…
Periodic Pólya urns and an application to Young tableaux
Cyril Banderier, Philippe Marchal, Michael Wallner
P{ó}lya urns are urns where at each unit of time a ball is drawn and is replaced with some other balls according to its colour. We introduce a more general model: The replacement r…
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…
Rectangular Young tableaux with local decreases and the density method for uniform random generation (short version)
Cyril Banderier, Philippe Marchal, Michael Wallner
In this article, we consider a generalization of Young tableaux in which we allow some consecutive pairs of cells with decreasing labels. We show that this leads to a rich variety…
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 ,…
The kernel method for lattice paths below a line of rational slope
Cyril Banderier, Michael Wallner
We analyse some enumerative and asymptotic properties of lattice paths below a line of rational slope. We illustrate our approach with Dyck paths under a line of slope . This…
Lattice paths of slope 2/5
Cyril Banderier, Michael Wallner
We analyze some enumerative and asymptotic properties of Dyck paths under a line of slope 2/5.This answers to Knuth's problem \\#4 from his "Flajolet lecture" during the conference…
Some reflections on directed lattice paths
Cyril Banderier, Michael Wallner
This article analyzes directed lattice paths, when a boundary reflecting or absorbing condition is added to the classical models. The lattice paths are characterized by two time-in…
Right-jumps and pattern avoiding permutations
Cyril Banderier, Jean-Luc Baril, Céline Moreira Dos Santos
We study the iteration of the process "a particle jumps to the right" in permutations. We prove that the set of permutations obtained in this model after a given number of iteratio…
Analysis of an exhaustive search algorithm in random graphs and the n^{c\log n} -asymptotics
Cyril Banderier, Hsien-Kuei Hwang, Vlady Ravelomanana +1
We analyze the cost used by a naive exhaustive search algorithm for finding a maximum independent set in random graphs under the usual G_{n,p} -model where each possible edge appea…
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…