0

I am looking for information about cyclic order sequences and subsequences that can be generated from them. I am dealing with such sequences in my computer science work and was curious to see if it had some background in mathematics. Pointers to any books, papers, articles on this topic would be helpful.

Googling showed up the Wikipedia entry on cyclic order and nothing more. I looked into all the combinatorics books I could find, but could not find anything.

Background: I am working with 2D surfaces where different regions meet. At each such meeting point, I create a cyclic order sequence (say anti-clockwise) of the regions meeting there. For a given meeting point where n regions meet, I am trying to break this apart into a set of smaller m-length subsequences, while maintaining the cyclic order from the parent sequence. (m <= n).

Note: I am a computer science student not from mathematics :-)

flag
Could you say a little more about your problem? What exactly do you want to know about "subsequences that can be generated from" a given sequence? Are you looking for specific types of subsequences? I guess I'm just not seeing the mathematical question here. – Darsh Ranjan Oct 23 2009 at 7:30
Could you also give a simple example, maybe a special case where you know what subsequences you get. – Henning Arnór Úlfarsson Oct 23 2009 at 9:20
If your question is what I think it is, you need no heavy mathematical machinery at all. Just generate the sequences as if they were on a line and then allow any term to be an initial value. – Jason Dyer Oct 23 2009 at 12:03

Your Answer

Get an OpenID
or

Browse other questions tagged or ask your own question.