An exhaustive generation algorithm for Catalan objects and others

Details An exhaustive generation algorithm for Catalan objects and others An exhaustive generation algorithm for Catalan objects and others

2006-12-05

arxiv.org/abs/math/0612127v2

Mathematics

Combinatorics

19 figures

Scientific paper

In this paper we present a CAT generation algorithm for Dyck paths with a fixed length n. It is the formalization of a method for the exhaustive generation of this kind of paths which can be described by means of two equivalent strategies. The former is described by a rooted tree, the latter lists the paths by means of three operations which, as we are going to see, are equivalent to visit the tree. These constructions are strictly connected with ECO method and can be encoded by a rule, very similar to the succession rule in ECO, with a finite number of labels for each n. Moreover with a slight variation this method can be generalized to other combinatorial classes like Grand Dyck or Motzkin paths.

Affiliated with

Also associated with

No associations

Rating

An exhaustive generation algorithm for Catalan objects and others 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 An exhaustive generation algorithm for Catalan objects and others, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An exhaustive generation algorithm for Catalan objects and others will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-717589