93 citations · 692 across the 41 of their papers we have counts for
5 papers · 1 filter
Non-D-finite excursions in the quarter plane
Alin Bostan, Kilian Raschel, Bruno Salvy
The number of excursions (finite paths starting and ending at the origin) having a given number of steps and obeying various geometric constraints is a classical topic of combinato…
Algorithms for Combinatorial Systems: Well-Founded Systems and Newton Iterations
Carine Pivoteau, Bruno Salvy, Michele Soria
We consider systems of recursively defined combinatorial structures. We give algorithms checking that these systems are well founded, computing generating series and providing nume…
Lindelöf Representations and (Non-)Holonomic Sequences
Philippe Flajolet, Stefan Gerhold, Bruno Salvy
Various sequences that possess explicit analytic expressions can be analysed asymptotically through integral representations due to Lindelöf, which belong to an attractive but some…
On the non-holonomic character of logarithms, powers, and the n-th prime function
Philippe Flajolet, Stefan Gerhold, Bruno Salvy
We establish that the sequences formed by logarithms and by "fractional" powers of integers, as well as the sequence of prime numbers, are non-holonomic, thereby answering three op…
Effective Scalar Products for D-finite Symmetric Functions
Frédéric Chyzak, Marni Mishna, Bruno Salvy
Many combinatorial generating functions can be expressed as combinations of symmetric functions, or extracted as sub-series and specializations from such combinations. Gessel has o…