Christian Stump <christian.st...@gmail.com> writes: > Hi, > > I see that there is quite some stuff implemented for "WordPaths". I > now wonder if someone already has code (or how much work would it be) > to provide the possibility of constructing WordPaths from a given > start point A to a given end point B that are contained in a region > given by linear (or polynomial, or other) inequalities. I do assume a > priori (since this is almost impossible to check in general, if I > recall correctly) that there are only finitely many paths from A to B.
I have an implementation that generates all non-intersecting k-tuples of paths between in a region given by two paths with a given descent set and given number of bottom and top contacts, etc. (Following the article by Sergi and myself.) (No idea whether it's efficient.) Is this what you are looking for? Martin -- You received this message because you are subscribed to the Google Groups "sage-combinat-devel" group. To post to this group, send email to sage-combinat-devel@googlegroups.com. To unsubscribe from this group, send email to sage-combinat-devel+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/sage-combinat-devel?hl=en.
