Algorithms for Combinatorial Systems

Details Algorithms for Combinatorial Systems Algorithms for Combinatorial Systems

2011-09-13

arxiv.org/abs/1109.2688v1

Mathematics

Combinatorics

Scientific paper

We consider systems of recursively defined combinatorial structures. We present a quadratic iterative method solving these systems when they are well founded. From there, we deduce truncations of the corresponding generating series in quasi-optimal complexity. This iteration transfers to a numerical scheme that converges unconditionally to the values of the generating series inside their disk of convergence. This provides algorithms that are important subroutines in random generation.

Affiliated with

Also associated with

No associations

Rating

Algorithms for Combinatorial Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Algorithms for Combinatorial Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algorithms for Combinatorial Systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-333153